Permutations from an arithmetic setting
From MaRDI portal
Abstract: Let be positive integers such that divides . In this paper, we introduce a special class of piecewise-affine permutations of the finite set with the property that the reduction of consecutive elements in any of its cycles is, up to a cyclic shift, a fixed permutation of . Our main result provides the cycle decomposition of such permutations. We further show that such permutations give rise to permutations of finite fields. In particular, we explicitly obtain classes of permutation polynomials of finite fields whose cycle decomposition and its inverse are explicitly given.
Recommendations
Cites work
- A note on inverses of cyclotomic mapping permutation polynomials over finite fields
- A piecewise construction of permutation polynomials over finite fields
- Complete permutation polynomials from exceptional polynomials
- Constructing permutation polynomials from piecewise permutations
- Constructing permutations of finite fields via linear translators
- Cycle structure of automorphisms of finite cyclic groups
- Cycles of linear permutations over a finite field
- Cyclotomy and permutation polynomials of large indices
- Handbook of finite fields
- scientific article; zbMATH DE number 61942 (Why is no real title available?)
- On constructing permutations of finite fields
- On the cycle structure of permutation polynomials
- Permutation polynomials over finite fields -- a survey of recent advances
- Reflection ciphers
- The functional graph of linear maps over finite fields and applications
Cited in
(5)
This page was built for publication: Permutations from an arithmetic setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185926)