Cyclic decomposition of permutations of finite fields obtained using monomials
From MaRDI portal
The authors study permutation polynomials over the finite field \(\mathbb F_q\) of order \(q\) where of course \(q\) is a prime power. In particular, they study permutation monomials \(x^i\) which decompose as products of cycles of the same length. Necessary and sufficient conditions on the exponent \(i\) are given in order to obtain such a permutation polynomial. The details are however too complicated to state here. For the entire collection see [Zbl 1048.11003].
Recommendations
Cited in
(18)- Enumerating permutation polynomials. II: \(k\)-cycles with minimal degree.
- Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)
- Permutations from an arithmetic setting
- Permutations on finite fields with invariant cycle structure on lines
- Rédei permutations with cycles of the same length
- Irreducible factors of a class of permutation polynomials
- Permutations of finite fields with prescribed properties
- Explicit formulas for monomial involutions over finite fields
- Decomposition of permutations in a finite field
- The cycle structure of a class of permutation polynomials
- Numerical-symbolic exact irreducible decomposition of cyclic-12
- scientific article; zbMATH DE number 4142162 (Why is no real title available?)
- Dickson permutation polynomials that decompose in cycles of the same length
- scientific article; zbMATH DE number 4108894 (Why is no real title available?)
- On the reducibility behavior of Thue polynomials
- A general construction of regular complete permutation polynomials
- The cycle structure of a class of permutation binomials
- Regular complete permutation polynomials over quadratic extension fields
This page was built for publication: Cyclic decomposition of permutations of finite fields obtained using monomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4832293)