On a Permutation Problem for Finite Abelian Groups
Keywords:
Combinatorial number theory, Abelian group, Permutation, Subset sum
Abstract
Let G be a finite additive abelian group with exponent n>1, and let a1,…,an−1 be elements of G. We show that there is a permutation σ∈Sn−1 such that all the elements saσ(s) (s=1,…,n−1) are nonzero if and only if
|{1⩽
When G is the cyclic group \mathbb Z/n\mathbb Z, this confirms a conjecture of Z.-W. Sun.