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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Higher-rank Bohr sets and multiplicative diophantine approximation

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

in person & via zoom Andrew Chamblin Memorial Lecture 2016 Webex Meeting number: 140 388 203 Password: ZApmfTb7h56 https://meetingsemea10.webex.com/meetingsemea10/j.php?MTID=mf0c350ff1fab96540218f5767c51d098

Other talks

Title TBC A scientists guide to the art of radiation therapy and Neurosurgery for the oncologist Non-stationarity in structural dynamics, challenges and implications for modelling and structural health monitoring Group Work Clonal haematopoiesis, early detection and pre-leukemia to leukemia development Discussion I
 

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