arXiv (All)
open access
Arithmetic Progressions in Midpoint Colourings
We introduce an asymmetric variant of a classic problem by Roth about colourings of integers and midpoints. The new problem cannot be solved with the standard approach by Erdös-Sárközy-Sós which uses symmetry. We describe a Fourier Analytic approach which gives asymptotically tight bounds. In the $\
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Congruences for Overcolored Partition $k$-tuples Restricted by Parity of the Parts#1116945
- Explicit and logarithmically improved chromatic bounds for $(P_2\cup P_3)$-free graphs#987759
- Sparse Approximate Chromatic Profiles of Triangle-Free Graphs#1063363
- A combinatorial approach to point-flat incidences over finite fields#1118077
- The discrete second moment of the Riemann zeta-function along powers of Gram points#1357762
Record · ID 1249127
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive