arXiv Analytics

Sign in

arXiv:1308.0208 [math.NT]AbstractReferencesReviewsResources

Diophantine approximation and coloring

Alan Haynes, Sara Munday

Published 2013-08-01, updated 2014-02-20Version 2

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.

Comments: 16 pages, pre-publication version of paper which will appear in American Mathematical Monthly
Categories: math.NT, math.CO
Subjects: 05C15, 11J99
Related articles: Most relevant | Search more
arXiv:1202.4539 [math.NT] (Published 2012-02-21, updated 2012-12-22)
On some open problems in Diophantine approximation
arXiv:2112.11752 [math.NT] (Published 2021-12-22, updated 2022-06-29)
Some Connections Between Discrepancy, Finite Gap Properties, and Pair Correlations
arXiv:1404.5161 [math.NT] (Published 2014-04-21)
A Quantitative Result on Diophantine Approximation for Intersective Polynomials

Links

Toolbox