On a permutation problem for finite abelian groups
From MaRDI portal
Abstract: Let be a finite additive abelian group with exponent , and let . We show that there is a permutation such that all the elements are nonzero if and only if left|left{1le s<n: frac{n}{d}a_s
e 0
ight}
ight|ge d-1 extrm{ for every positive divisor } d extrm{ of } n. When is the cyclic group , this confirms a conjecture of Z.-W. Sun.
Summary: Let \(G\) be a finite additive abelian group with exponent \(n>1\), and let \(a_1,\ldots,a_{n-1}\) be elements of \(G\). We show that there is a permutation \(\sigma\in S_{n-1}\) such that all the elements \(sa_{\sigma(s)}\;(s=1,\ldots,n-1)\) are nonzero if and only if \[ |{1\leqslant s<n:\frac{n}{d}a_s\neq 0}|\geqslant d-1\,\,\text{for any positive divisor}\,\,d\,\,\text{of}\,\,n. \] When \(G\) is the cyclic group \(\mathbb Z/n\mathbb Z\), this confirms a conjecture of Z.-W. Sun.
Recommendations
Cites work
Cited in
(8)- Complementary permutations for abelian groups
- On permutations of \(\{1,\ldots ,n\}\) and related topics
- On random permutations of finite groups
- Permutations in Abelian groups and the sequence \(n!\pmod p\).
- Some new problems in additive combinatorics
- Permutations with a distinct divisor property
- A proof of Snevily's conjecture.
- Classifying problems on linear congruences and Abelian permutation groups using logspace counting classes
This page was built for publication: On a permutation problem for finite abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510328)