Properties and Calculations of Constructive Orderings of ℤ/nℤ
Zackary Baker
The King's University
Abstract
A sequencing of a finite group G of order n is a sequence g1,g2,g3,...gn of the elements of G whose set of partial products {g1g2...gi | 1 ≤ i ≤ n} contains every element of the group G. In this paper, we study this in the particular case of additive groups modulo n, replacing the partial products with partial sums. We make and prove several observations about these sequencings, and calculate how many there are for n≤16.
