arXiv Analytics

Sign in

arXiv:1211.6875 [math.CO]AbstractReferencesReviewsResources

Permutations over cyclic groups

Zoltán Lóránt Nagy

Published 2012-11-29Version 1

Generalizing a result in the theory of finite fields we prove that, apart from a couple of exceptions that can be classified, for any elements $a_1,...,a_m$ of the cyclic group of order $m$, there is a permutation $\pi$ such that $1a_{\pi(1)}+...+ma_{\pi(m)}=0$.

Journal: European Journal of Combinatorics 41C (2014), pp. 68-78
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:math/9910056 [math.CO] (Published 1999-10-11)
Lamps, Factorizations and Finite Fields
arXiv:1212.5305 [math.CO] (Published 2012-12-21, updated 2013-04-19)
Distance sets of two subsets of vector spaces over finite fields
arXiv:0802.0630 [math.CO] (Published 2008-02-05)
A problem on polynomial maps over finite fields