Diophantine Approximation and Coloring

DOI10.4169/AMER.MATH.MONTHLY.122.6.567MaRDI QIDQ3459977zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Sara Munday, Alan Haynes

Publication date 11 January 2016

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1308.0208, https://eprints.whiterose.ac.uk/112245/1/1308.0208.pdf

zbMATH Keywords

Cayley graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Diophantine approximation, transcendental number theory (11J99)

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.

Cited in

(5)

• Badly approximable points for diagonal approximation in solenoids
• Coloring the \(n\)-smooth numbers with \(n\) colors
• scientific article; zbMATH DE number 6010901 (Why is no real title available?)
• On the multiples of a badly approximable vector
• A randomized version of the Littlewood conjecture

This page was built for publication: Diophantine Approximation and Coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3459977)