Shai Ben-David, School of Computer Science, University of Waterloo
"A basic machine learning problem is independent of set theory"
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
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.
Dino Rossegger, Department of Pure Mathematics, University of Waterloo
"The complexity of Scott sentences of scattered linear orders"
Aasaimani Thamizhazhagan, Department of Pure Mathematics, University of Waterloo
"On the structure of invertible elements in Fourier-Stieltjes algebras"
Adam Humeniuk, Department of Pure Mathematics, University of Waterloo
"C*-covers of semicrossed products"
**Note time and room change**
Ehsaan Hossain, Department of Pure Mathematics, University of Waterloo
"Introduction to the valuative tree"
Alex Iosevich, University of Rochester
"Analytic, geometric and combinatorial aspects of the Falconer distance conjecture"
Dino Rossegger, Department of Pure Mathematics, University of Waterloo
"The complexity of Scott sentences of scattered linear orders -- Part II"
Mizanur Rahaman, Department of Pure Mathematics, University of Waterloo
"Bisynchronous games and factorizable maps"