Prime and polynomial distances in colourings of the plane
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909208409014272 |
|---|---|
| author | Davies, James McCarty, Rose Pilipczuk, Michał |
| author_facet | Davies, James McCarty, Rose Pilipczuk, Michał |
| contents | We give two extensions of the recent theorem of the first author that the odd distance graph has unbounded chromatic number. The first is that for any non-constant polynomial $f$ with integer coefficients and positive leading coefficient, every finite colouring of the plane contains a monochromatic pair of distinct points whose distance is equal to $f(n)$ for some integer $n$. The second is that for every finite colouring of the plane, there is a monochromatic pair of points whose distance is a prime number. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_02483 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Prime and polynomial distances in colourings of the plane Davies, James McCarty, Rose Pilipczuk, Michał Combinatorics Metric Geometry Number Theory We give two extensions of the recent theorem of the first author that the odd distance graph has unbounded chromatic number. The first is that for any non-constant polynomial $f$ with integer coefficients and positive leading coefficient, every finite colouring of the plane contains a monochromatic pair of distinct points whose distance is equal to $f(n)$ for some integer $n$. The second is that for every finite colouring of the plane, there is a monochromatic pair of points whose distance is a prime number. |
| title | Prime and polynomial distances in colourings of the plane |
| topic | Combinatorics Metric Geometry Number Theory |
| url | https://arxiv.org/abs/2308.02483 |