Papers
Topics
Authors
Recent
Search
2000 character limit reached

Unrolling residues to avoid progressions

Published 12 Sep 2012 in math.CO and math.NT | (1209.2687v1)

Abstract: We consider the problem of coloring $[n]={1,2,...,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$.

Authors (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.