R\'edei permutations with cycles of the same length
Juliane Capaverde, Ariane M. Masuda, Virg\'inia M. Rodrigues

TL;DR
This paper investigates Rédéi permutations over finite fields that have cycle structures consisting only of fixed points and cycles of a fixed length j, providing conditions, characterizations, and explicit constructions for such permutations.
Contribution
It offers necessary and sufficient conditions for the existence of these permutations, characterizes their structure, and provides explicit formulas and construction procedures for specific cycle lengths.
Findings
Characterization of Rédéi permutations with only 1- and j-cycles.
Explicit formulas for Rédéi involutions based on fixed points.
Procedures to construct permutations with specified cycle structures.
Abstract
Let be a finite field of odd characteristic. We study R\'edei functions that induce permutations over whose cycle decomposition contains only cycles of length and , for an integer . When is or a prime number, we give necessary and sufficient conditions for a R\'edei permutation of this type to exist over , characterize R\'edei permutations consisting of - and -cycles, and determine their total number. We also present explicit formulas for R\'edei involutions based on the number of fixed points, and procedures to construct R\'edei permutations with a prescribed number of fixed points and -cycles for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
