University of Cambridge > Talks.cam > Discrete Analysis Seminar > Higher-rank Bohr sets and multiplicative diophantine approximation

Higher-rank Bohr sets and multiplicative diophantine approximation

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Aled Walker.

Gallagher’s theorem is a sharpening and extension of the Littlewood conjecture that holds for almost all tuples of real numbers. This talk is about joint work with Sam Chow where we provide a fibre refinement, solving a problem posed by Beresnevich, Haynes and Velani in 2015. Hitherto, this was only known on the plane, as previous approaches relied heavily on the theory of continued fractions. Using reduced successive minima in lieu of continued fractions, we develop the structural theory of Bohr sets of arbitrary rank, in the context of diophantine approximation.

This talk is part of the Discrete Analysis Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity