Adding generators in cyclic groups

Abstract

For a cyclic group $a$, define the atom of $a$ as the set of all elements generating $a$. Given any two elements $a,b$ of a finite cyclic group $G$, we study the sumset of the atom of $a$ and the atom of $b$. It is known that such a sumset is a disjoint union of atoms. The goal of this paper is to offer a deeper understanding of this phenomenon, by determining which atoms make up the sum of two given atoms and by computing the exact number of representations of each element of the sumset.

Cited by in corpus (6)

• Restricted linear congruences
• On a restricted linear congruence
• On an almost-universal hash function family with applications to authentication and secrecy codes
• On the number of solutions of a restricted linear congruence
• On solving a restricted linear congruence using generalized Ramanujan sums
• On the additive and multiplicative structures of the exceptional units in finite commutative rings