One of the most fundamental notions in group theory is the notion of the normal rank of a group. This is the smallest size of a set of elements, which if included in the set of relations, render the group trivial. The smallest number of factors in the direct sum decomposition of the group abelianization provides a natural lower bound for the normal rank. The 1976 Wiegold problem on perfect groups asks whether there exist finitely generated perfect groups whose normal rank is greater than one. We demonstrate that free products of finitely generated perfect left orderable groups have normal rank greater than one. This solves the Wiegold problem in the affirmative, since a plethora of such examples exist. This is joint work with Lvzhou Chen.
I'll discuss numerous generalizations of FLT -- for instance, for fixed integers $a,b,c \geq 2$ satisfying $1/a + 1/b + 1/c < 1$, Darmon and Granville proved the single generalized Fermat equation $x^a + y^b = z^c$ has only finitely many coprime integer solutions. Conjecturally something stronger is true: for $a,b,c \geq 3$ there are no non-trivial solutions. More generally, I'll discuss my subfield "arithmetic geometry", and in particular the geometric intuitions that underlie the conjectural framework of modern number theory.
What is the second moment of a random smooth plane curve? Is the multiset of eigenvalues of a random orthogonal matrix a Gaussian random variable? Is a random compact Riemann surface a Poisson process? In this talk, I will describe a categorified version of probability theory that makes these nonsense questions into precise mathematics and give some applications to the topology and arithmetic of moduli spaces in algebraic geometry.
I will tell a story around a theorem we proved with Tom Hutchcroft and Omer Tamuz. In one version of the story, we look for fixed-point theorems in the spirit of Markov-Kakutani but for several maps at the same time.
In the other version, we cross out items from a finite list and we ask: is there a random list that would almost not change at all when we cross out any of the first few items?
We solve these questions, which are really only one question, by performing what looks like a backwards random walk in which every step would be infinitely long, but stationary.
In this public talk, internationally acclaimed choreographer Reggie Wilson and math professor Jesse Wolfson will describe their decade+ collaboration exploring what math can do for dance and what dance can do for math.
I. The entropy of the restriction of a pure quantum state to a subsystem is a measure of the entanglement between the system's two components.
II. After explaining the concepts, the talk will focus on conditions implying an area-type bound on the entanglement in pure states of quantum lattice models.