From discrete to continuous: monochromatic 3-term arithmetic progressions
From MaRDI portal
Recommendations
Cites work
- A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less
- A combinatorial analysis of topological dissections
- A geometric perspective on the MSTD question
- An introduction to hyperplane arrangements
- Avoiding monochromatic solutions to 3-term equations
- Beweis einer Baudetschen Vermutung.
- Binomial determinants, paths, and hook length formulae
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Finding Patterns Avoiding Many Monochromatic Constellations
- scientific article; zbMATH DE number 1380572 (Why is no real title available?)
- Monochromatic 4-term arithmetic progressions in 2-colorings of Z_n
- On the asymptotic minimum number of monochromatic 3-term arithmetic progressions
- On the number of monochromatic Schur triples.
- On the Vector Representations of Induced Matroids
- Quantitative theorems for regular systems of equations
- Real analysis
- The minimum number of monochromatic 4-term progressions in Z_p
- The number of monochromatic Schur triples
- Unrolling residues to avoid progressions
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)