arXiv Analytics

Sign in

arXiv:1111.3507 [math.NT]AbstractReferencesReviewsResources

Three-factor decompositions of $\mathbb{U}_n$ with the three generators in arithmetic progression

P. J. Cameron, D. A. Preece

Published 2011-11-15Version 1

Irrespective of whether n is prime, prime power with exponent >1, or composite, the group U_n of units of Z_n can sometimes be obtained as the direct product of cyclic groups generated by x, x+k and x+2k, for x, k in Z_n. Indeed, for many values of n, many distinct 3-factor decompositions of this type exist. The circumstances in which such decompositions exist are examined. Many decompositions have additional interesting properties. We also look briefly at decompositions of the multiplicative groups of finite fields.

Comments: 26 pages; tables; submitted to Integers
Categories: math.NT, math.CO
Subjects: 11T99
Related articles: Most relevant | Search more
arXiv:1103.6000 [math.NT] (Published 2011-03-30, updated 2013-02-25)
Arithmetic progressions in sumsets and L^p-almost-periodicity
arXiv:1211.4917 [math.NT] (Published 2012-11-21, updated 2013-10-09)
On arithmetic progressions in A + B + C
arXiv:1909.13549 [math.NT] (Published 2019-09-30)
Partitions into polynomial with the number of parts in arithmetic progression