COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

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

## [TMS] On Schmidt's games, badly approximable numbers & winning setsAdd to your list(s) Download to your calendar using vCal - Dr. Stergios Antonakoudis (DPMMS)
- Monday 25 January 2016, 20:30-21:30
- Winstanley Lecture Theatre, Trinity College.
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 listsBehavioural and Clinical Neuroscience Seminars SciBar Cambridge Monday Mechanics Seminars (DAMTP) Type the title of a new list here Brain Training: secrets, drugs and analysis. Institute of Astronomy Colloquia## Other talksMachine learning, social learning and self-driving cars Plastics in the Ocean: Challenges and Solutions Martin Roth: »Widerrede!« Eukaryotic cell division and its origins Putting Feminist New Materialism to work through affective methodologies in early childhood research Not Maggie's fault? The Thatcher government and the reemergence of global finance |