Diophantine approximation and coloring

Alan Haynes; Sara Ann Munday

doi:10.4169/amer.math.monthly.122.6.567

Diophantine approximation and coloring

Alan Haynes, Sara Ann Munday

Mathematics

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.4169/amer.math.monthly.122.6.567
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.

Access to Document

10.4169/amer.math.monthly.122.6.567

1308.0208
© 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.
Accepted author manuscript, 156 KB

http://www.jstor.org/stable/10.4169/amer.math.monthly.122.6.567

Diophantine approximation, chromatic number, and equivalence classes of separated nets
Haynes, A. K. (Principal investigator)
EPSRC
10/10/13 → 9/07/15
Project: Research project (funded) › Research
Career Acceleration Fellowship: Circle rotations and their generalisation in Diophantine approximation
Haynes, A. K. (Principal investigator)
EPSRC
1/10/13 → 30/09/16
Project: Research project (funded) › Research

Cite this

@article{bed43529a0a84cca87862ff20a947220,

title = "Diophantine approximation and coloring",

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.",

author = "Alan Haynes and Munday, {Sara Ann}",

note = "{\textcopyright} 2015 THE MATHEMATICAL ASSOCIATION OF AMERICA. This is an author-produced version of the published paper. Uploaded in accordance with the publisher{\textquoteright}s self-archiving policy. Further copying may not be permitted; contact the publisher for details.",

year = "2015",

month = jun,

day = "1",

doi = "10.4169/amer.math.monthly.122.6.567",

language = "English",

volume = "122",

pages = "567--580",

journal = "American mathematical monthly",

issn = "0002-9890",

publisher = "Taylor and Francis Ltd.",

number = "6",

}

TY - JOUR

T1 - Diophantine approximation and coloring

AU - Haynes, Alan

AU - Munday, Sara Ann

N1 - © 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.

PY - 2015/6/1

Y1 - 2015/6/1

N2 - 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.

AB - 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.

U2 - 10.4169/amer.math.monthly.122.6.567

DO - 10.4169/amer.math.monthly.122.6.567

M3 - Article

SN - 0002-9890

VL - 122

SP - 567

EP - 580

JO - American mathematical monthly

JF - American mathematical monthly

IS - 6

ER -

Diophantine approximation and coloring

Abstract

Bibliographical note

Access to Document

Projects

Diophantine approximation, chromatic number, and equivalence classes of separated nets

Career Acceleration Fellowship: Circle rotations and their generalisation in Diophantine approximation

Cite this