From discrete to continuous: monochromatic 3-term arithmetic progressions
From MaRDI portal
Publication:6590636
DOI10.1090/MCOM/3970zbMATH Open1545.05214MaRDI QIDQ6590636
Jonathan Kariv, Torin Greenwood, Noah Williams
Publication date: 21 August 2024
Published in: Mathematics of Computation (Search for Journal in Brave)
Linear programming (90C05) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Arithmetic progressions (11B25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monochromatic 4-term arithmetic progressions in 2-colorings of \(\mathbb Z_n\)
- The minimum number of monochromatic 4-term progressions in \(\mathbb Z_p\)
- Binomial determinants, paths, and hook length formulae
- Quantitative theorems for regular systems of equations
- A combinatorial analysis of topological dissections
- A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less
- On the number of monochromatic Schur triples.
- Beweis einer Baudetschen Vermutung.
- The number of monochromatic Schur triples
- Avoiding monochromatic solutions to 3-term equations
- A geometric perspective on the MSTD question
- On the asymptotic minimum number of monochromatic 3-term arithmetic progressions
- Finding Patterns Avoiding Many Monochromatic Constellations
- Unrolling Residues to Avoid Progressions
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- On the Vector Representations of Induced Matroids
This page was built for publication: From discrete to continuous: monochromatic 3-term arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6590636)
