Events

Filter by:

Limit to events where the title matches:
Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Wednesday, July 25, 2012 1:00 pm - 1:00 pm EDT (GMT -04:00)

Geometry working seminar - Part 2

Li Chen, Pure Mathematics, University of Waterloo

Talk #2: "Symmetry groups of differential Equations Part II - Symmetry of algebraic equations"

This will be the second part of a three part series on applications of Lie groups to differential equations. This time, we will focus on determining necessary and sufficient conditions for a system of algebraic equations and their level sets to be invariant under a group action.

Wednesday, July 25, 2012 3:40 pm - 3:40 pm EDT (GMT -04:00)

Computability learning seminar

Matthew Harrison-Trainor, Pure Mathematics, University of Waterloo

"$n$-systems - Part II"

We will continue our discussion of $n$-systems, and prove a  
general "metatheorem'' with a list of conditions that guarantee the  
success of a priority construction.

Tuesday, July 31, 2012 10:00 am - 10:00 am EDT (GMT -04:00)

Student Number Theory seminar

Xiaomei Zhao, Pure Mathematics, University of Waterloo

"New strategies for minor arc estimates: Part II"

Abstract: We have seen the outline of the circle method in Waring's problem from Shuntaro's talks, where the minor arc contribution was established by combining Weyl's inequality with Hua's lemma. In my two talks, we will continue to see some improvements on minor arc estimates. The first method is to replace Hua's lemma by Vinogradov's mean value theorem (VMVT).

Wednesday, August 1, 2012 1:00 pm - 1:00 pm EDT (GMT -04:00)

Geometry working seminar

Pure Mathematics Department, University of Waterloo

Matthew Beckett “Non-minimal Yang-Mills solutions”

Abstract:

Wednesday, August 1, 2012 3:40 pm - 3:40 pm EDT (GMT -04:00)

Computability learning seminar

Matthew Harrison-Trainor, Pure Mathematics, University Of Waterloo

"Pairs of computable structures"

We will begin by finishing the proof of the meta-theorem on n-systems, and then we will look at an application of back-and-forth relations and n-systems.

Thursday, August 2, 2012 2:30 pm - 2:30 pm EDT (GMT -04:00)

Zariski Geometries working seminar

Adam Gutter, University of Waterloo

"Zariski Structures: Non-Standard Analysis"

In this seminar, our focus is on introducing several new geometrically
motivated concepts, namely coverings, multiplicity, and local
functions. Time permitting, we may also discuss topological sorts, a
tool that allows us to generate new Zariski structures from a given
Zariski structure.

Tuesday, August 7, 2012 10:00 am - 10:00 am EDT (GMT -04:00)

Student Number Theory seminar

Stanley Xiao, Pure Mathematics Department, University of Waterloo

"SOME RESULTS ON POWERFREE VALUES OF POLYNOMIALS IN ONE OR TWO VARIABLES"

In this talk I will discuss the problem of finding powerfree values of polynomials in one or two variables, with an emphasis on the determinant method of D.R. Heath-Brown.

Wednesday, August 8, 2012 1:00 pm - 1:00 pm EDT (GMT -04:00)

Geometry working seminar

Li Chen & Jordan Rose, Pure Mathematics Department, University of Waterloo

Li Chen

"Symmetry groups of differential Equations Part III - Symmetry of differential equations with examples"

This will be the last of a series of three talks on symmetry groups of DE. In this talk, I will use the tools developed in the second talk, namely, symmetry of algebraic equations, to study differential equations when we view them as algebraic equations in higher jet spaces.

Wednesday, August 8, 2012 3:09 pm - 3:09 pm EDT (GMT -04:00)

Constraint Satisfaction seminar

Ian Payne, Pure Mathematics Department, University of Waterloo

“Determining CSP complexity using universal algebra”

Given a finite relational structure, A, the complexity of the constraint satisfaction problem for A can sometimes be determined using universal algebra. There are several known algebraic conditions on the polymorphism algebra of a structure that imply the NP-completeness of its CSP.

Wednesday, August 8, 2012 3:40 pm - 3:40 pm EDT (GMT -04:00)

Computability learning seminar

Matthew Harrison-Trainor, Pure Mathematics University of Waterloo

“Pairs of computable structures”

Let A and B be two structures over the same language. We consider the question of which sets S can be coded by those structures as follows: there is a uniformly computable sequence of structures (Cn)n ∈ ω such that Cn is isomorphic to A if n ∈ S and to B otherwise.