University of Cambridge > Talks.cam > Trinity Mathematical Society > [TMS] On Schmidt's games, badly approximable numbers & winning sets

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

[TMS] On Schmidt's games, badly approximable numbers & winning sets

Download to your calendar using vCal

If you have a question about this talk, please contact Jason Kwong .

Schmidt introduced a simple and powerful way to study certain important sets of real numbers, that although they exhibit remarkable rigidity features, they are ‘too thin’ to be detected using classical methods in analysis. The set of real numbers which badly approximable by rationals is an important example of such a set. In this talk, we will discuss Schmidt’s games, their applications and generalisations in geometry and dynamics. As a warm-up for the talk, you might like to try the following problem: Is every real number the difference of two badly approximable numbers? [1]https://en.wikipedia.org/wiki/Diophantine_approximation#Badly_approximable_numbers

This talk is part of the Trinity Mathematical Society series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Boardroom of The Sainsbury Laboratory (Bateman Street) Motivic stable homotopy theory study group Museum of Archaeology & Anthropology, Downing Street

Other talks

Alicia Anderson discussing some exciting news about HARPS3 Title to be confirmed Topology of the Ritz energy landscape Proteomics: Expression Analysis and Subcellular Localisation LMB Seminar - Mechanisms of mRNA packaging and export Title to be confirmed
 

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