Rainbow Arithmetic Progressions in Finite Abelian Groups
نویسنده
چکیده
For positive integers n and k, the anti-van der Waerden number of Zn, denoted by aw(Zn, 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(Zn, 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 unitary anti-van der Waerden number of a group is also defined and determined.
منابع مشابه
On rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملPermutations Destroying Arithmetic Structure
Given a linear form C1X1 + · · · + CnXn, with coefficients in the integers, we characterize exactly the countably infinite abelian groups G for which there exists a permutation f that maps all solutions (α1, . . . , αn) ∈ Gn (with the αi not all equal) to the equation C1X1+ · · ·+CnXn = 0 to non-solutions. This generalises a result of Hegarty about permutations of an abelian group avoiding arit...
متن کاملThree Term Arithmetic Progressions in Sumsets
Suppose that G is an abelian group and A ⊂ G is finite and contains no non-trivial three term arithmetic progressions. We show that |A + A| ≫ε |A|(log |A|) 1 3 −ε.
متن کاملA Probabilistic Technique for Finding Almost-periods of Convolutions
We introduce a new probabilistic technique for finding ‘almost-periods’ of convolutions of subsets of groups. This gives results similar to the Bogolyubov-type estimates established by Fourier analysis on abelian groups but without the need for a nice Fourier transform to exist. We also present applications, some of which are new even in the abelian setting. These include a probabilistic proof ...
متن کاملJohn-type Theorems for Generalized Arithmetic Progressions and Iterated Sumsets
A classical theorem of Fritz John allows one to describe a convex body, up to constants, as an ellipsoid. In this article we establish similar descriptions for generalized (i.e. multidimensional) arithmetic progressions in terms of proper (i.e. collision-free) generalized arithmetic progressions, in both torsion-free and torsion settings. We also obtain a similar characterization of iterated su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016