arXiv Analytics

Sign in

arXiv:1603.08153 [math.CO]AbstractReferencesReviewsResources

Rainbow Arithmetic Progressions in Finite Abelian Groups

Michael Young

Published 2016-03-26Version 1

For positive integers $n$ and $k$, the \emph{anti-van der Waerden number} of $\mathbb{Z}_n$, denoted by $aw(\mathbb{Z}_n,k)$, is the minimum number of colors needed to color the elements of the cyclic group of order $n$ and guarantee there is a rainbow arithmetic progression of length $k$. Butler et al. showed a reduction formula for $aw(\mathbb{Z}_{n},3) = 3$ in terms of the prime divisors of $n$. In this paper, we analagously define the anti-van der Waerden number of a finite abelian group $G$ and show $aw(G,3)$ is determined by the order of $G$ and the number of groups with even order in a direct sum isomorphic to $G$. The \emph{unitary anti-van der Waerden number} of a group is also defined and determined.

Related articles: Most relevant | Search more
arXiv:2310.20462 [math.CO] (Published 2023-10-31)
Anti-van der Waerden Numbers of Graph Products with Trees
arXiv:1101.4715 [math.CO] (Published 2011-01-25, updated 2011-03-30)
Extremal incomplete sets in finite abelian groups
arXiv:1802.01509 [math.CO] (Published 2018-02-05)
Anti-van der Waerden numbers on Graphs