Contact Info
Pure MathematicsUniversity of Waterloo
200 University Avenue West
Waterloo, Ontario, Canada
N2L 3G1
Departmental office: MC 5304
Phone: 519 888 4567 x43484
Fax: 519 725 0160
Email: puremath@uwaterloo.ca
Brett Nasserden, Department of Pure Mathematics, University of Waterloo
"The valuative tree at infinity"
To study the dynamics of a polynomial map on the complex affine plane we must be able to study the behavior of the mapping near the origin and near infinity. The study of the dynamics near a point leads to the notion of the valuative tree at the origin of the affine plane. To study the dynamics near infinity, we introduce a new but analogous object,the valuative tree at infinity, which will be the subject of this lecture.
MC 5403
Sylvie Davies, Department of Pure Mathematics, University of Waterloo
"Algebraic Approaches to State Complexity of Regular Operations"
Wilson Poulter, Department of Pure Mathematics, University of Waterloo
"NIP II"
We finish up section 2.1 and begin section 2.2 of Simon's Guide to NIP theories.
MC 5413
Mizanur Rahaman, Department of Pure Mathematics, University of Waterloo
"Bisynchronous games and factorizable maps"
Dino Rossegger, Department of Pure Mathematics, University of Waterloo
"The complexity of Scott sentences of scattered linear orders -- Part II"
Alex Iosevich, University of Rochester
"Analytic, geometric and combinatorial aspects of the Falconer distance conjecture"
**Note time and room change**
Ehsaan Hossain, Department of Pure Mathematics, University of Waterloo
"Introduction to the valuative tree"
Adam Humeniuk, Department of Pure Mathematics, University of Waterloo
"C*-covers of semicrossed products"
Aasaimani Thamizhazhagan, Department of Pure Mathematics, University of Waterloo
"On the structure of invertible elements in Fourier-Stieltjes algebras"
Dino Rossegger, Department of Pure Mathematics, University of Waterloo
"The complexity of Scott sentences of scattered linear orders"
J.C. Saunders, Ben Gurion University of Negev
"Diophantine equations involving the Euler totient function"
We deal with various Diophantine equations involving the Euler totient function. In particular, for $a,b,c,m,n\in\mathbb{N}$ with $m\geq 2$ we study the equations $\varphi(ax^m)=\frac{b\cdot n!}{c}$ and $\varphi\left(\frac{b\cdot n!}{c}\right)=ax^m$ where $\varphi(x)$ is the Euler totient function. We also deal with similar equations involving Lucas sequences of the first kind and second kind, generalising the work of Luca and Stanica.
Adina Goldberg, Department of Pure Mathematics, University of Waterloo
"This title contains information"
How can we mathematically test the claim made in the title? In this talk, we will learn about Claude Shannon's entropy and determine if it gives us the best measure of informativeness. If you can picture the graph of a logarithm, you are well prepared.
MC 5501
Shai Ben-David, School of Computer Science, University of Waterloo
"A basic machine learning problem is independent of set theory"
Departmental office: MC 5304
Phone: 519 888 4567 x43484
Fax: 519 725 0160
Email: puremath@uwaterloo.ca
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is co-ordinated within our Office of Indigenous Relations.