Projects per year
Abstract
We demonstrate how connections between graph theory and Diophantine approximation can be used in conjunction to give simple and accessible proofs of seemingly difficult results in both subjects.
Original language | English |
---|---|
Pages (from-to) | 567-580 |
Journal | American mathematical monthly |
Volume | 122 |
Issue number | 6 |
DOIs | |
Publication status | Published - 1 Jun 2015 |
Bibliographical note
© 2015 THE MATHEMATICAL ASSOCIATION OF AMERICA. This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details.Projects
- 2 Finished
-
Diophantine approximation, chromatic number, and equivalence classes of separated nets
10/10/13 → 9/07/15
Project: Research project (funded) › Research
-
Career Acceleration Fellowship: Circle rotations and their generalisation in Diophantine approximation
1/10/13 → 30/09/16
Project: Research project (funded) › Research