Unrolling residues to avoid progressions

DOI10.4169/MATH.MAG.87.2.83MaRDI QIDQ2929448zbMATH OpenOpenAlexFDO

Authors Steve Butler, Linyuan Lu, Ron Graham

Publication date 12 November 2014

Published in Mathematics Magazine (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1209.2687

zbMATH Keywords

coloringresiduesmonochromatic \(k\)-term arithmetic progressions

Mathematics Subject Classification ID

Extremal set theory (05D05)

Abstract: We consider the problem of coloring $[n]=1,2,\mathrm{...},n$ with $r$ colors to minimize the number of monochromatic $k$ term arithmetic progressions (or $k$-APs for short). We show how to extend colorings of $mathbb{Z}_m$ which avoid nontrivial $k$-APs to colorings of $[n]$ by an unrolling process. In particular, by using residues to color $mathbb{Z}_m$ we produce the best known colorings for minimizing the number of monochromatic $k$-APs for coloring with $r$ colors for several small values of $r$ and $k$.

Recommendations

• Sub-Ramsey numbers of arithmetic progressions
• Monochromatic 4-term arithmetic progressions in 2-colorings of Z_n
• Integer colorings with no rainbow \(k\)-term arithmetic progression
• On rainbow arithmetic progressions
• On sequences covering all rainbow \(k\)-progressions

Cited in

(1)

• From discrete to continuous: monochromatic 3-term arithmetic progressions

This page was built for publication: Unrolling residues to avoid progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929448)