Monochromatic configurations on a circle
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909595473018880 |
|---|---|
| author | Damásdi, Gábor Frankl, Nóra Pach, János Pálvölgyi, Dömötör |
| author_facet | Damásdi, Gábor Frankl, Nóra Pach, János Pálvölgyi, Dömötör |
| contents | If we two-colour a circle, we can always find an inscribed triangle with angles $(\fracπ{7},\frac{2π}{7},\frac{4π}{7})$ whose three vertices have the same colour. In fact, Bialostocki and Nielsen showed that it is enough to consider the colours on the vertices of an inscribed heptagon. We prove that for every other triangle $T$ there is a two-colouring of the circle without any monochromatic copy of $T$.
More generally, for $k\geq 3$, call a $k$-tuple $(d_1,d_2,\dots,d_k)$ with $d_1\geq d_2\geq \dots \geq d_k>0$ and $\sum_{i=1}^k d_i=1$ a Ramsey $k$-tuple if the following is true: in every two-colouring of the circle of unit perimeter, there is a monochromatic $k$-tuple of points in which the distances of cyclically consecutive points, measured along the arcs, are $d_1,d_2,\dots,d_k$ in some order. By a conjecture of Stromquist, if $d_i=\frac{2^{k-i}}{2^k-1}$, then $(d_1,\dots,d_k)$ is Ramsey.
Our main result is a proof of the converse of this conjecture. That is, we show that if $(d_1,\dots,d_k)$ is Ramsey, then $d_i=\frac{2^{k-i}}{2^k-1}$. We do this by finding connections of the problem to certain questions from number theory about partitioning $\mathbb{N}$ into so-called Beatty sequences. We also disprove a majority version of Stromquist's conjecture, study a robust version, and discuss a discrete version. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_10687 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Monochromatic configurations on a circle Damásdi, Gábor Frankl, Nóra Pach, János Pálvölgyi, Dömötör Combinatorics Number Theory If we two-colour a circle, we can always find an inscribed triangle with angles $(\fracπ{7},\frac{2π}{7},\frac{4π}{7})$ whose three vertices have the same colour. In fact, Bialostocki and Nielsen showed that it is enough to consider the colours on the vertices of an inscribed heptagon. We prove that for every other triangle $T$ there is a two-colouring of the circle without any monochromatic copy of $T$. More generally, for $k\geq 3$, call a $k$-tuple $(d_1,d_2,\dots,d_k)$ with $d_1\geq d_2\geq \dots \geq d_k>0$ and $\sum_{i=1}^k d_i=1$ a Ramsey $k$-tuple if the following is true: in every two-colouring of the circle of unit perimeter, there is a monochromatic $k$-tuple of points in which the distances of cyclically consecutive points, measured along the arcs, are $d_1,d_2,\dots,d_k$ in some order. By a conjecture of Stromquist, if $d_i=\frac{2^{k-i}}{2^k-1}$, then $(d_1,\dots,d_k)$ is Ramsey. Our main result is a proof of the converse of this conjecture. That is, we show that if $(d_1,\dots,d_k)$ is Ramsey, then $d_i=\frac{2^{k-i}}{2^k-1}$. We do this by finding connections of the problem to certain questions from number theory about partitioning $\mathbb{N}$ into so-called Beatty sequences. We also disprove a majority version of Stromquist's conjecture, study a robust version, and discuss a discrete version. |
| title | Monochromatic configurations on a circle |
| topic | Combinatorics Number Theory |
| url | https://arxiv.org/abs/2504.10687 |