Emmy Noether’s statue?
Non-existence theorem There is no statue of Emmy Noether. Yes, she’s had a Google doodle. Yes, there is a bust of her in the Hall of Fame in Munich. But no statue. To those who don’t know, Noether was one of the most influential of twentieth century mathematicians. She accomplished ground-breaking work in abstract algebra, and had a…
CanaDAM’17 at Ryerson
CanaDAM The sixth Canadian Discrete and Algorithmic Mathematics conference (or CanaDAM) will be held June 12-15, 2017 at my home institution of Ryerson University in Toronto. CanaDAM focuses on the theory and application of discrete mathematics. This includes areas such as graph theory and networks, coding theory, enumeration, combinatorial designs and algorithms, and many others. The meeting…
Remembering Raymond Paley
Paley graphs Paley graphs play a role in my research, and they are an important family of graphs in combinatorics and graph theory. They are examples of quasi-random graphs: explicit, deterministic networks exhibiting properties we typically expect to see asymptotically in random graphs. Consider a prime power p congruent to 1 (mod 4), and let vertices be the elements of…
Sir Michael Atiyah: hard at work at 86
Transitivity The blog today is a result of transitivity: A implies B, and B implies C, so A implies C. (A) I am at the Banff International Research Station (BIRS) in Banff for a workshop on random geometric graphs. (B) The director of BIRS is Nassif Ghoussoub, who I recently interviewed. (C) Nassif Ghoussoub recently posted on…