Generalized cyclotomic mappings: Switching between polynomial, cyclotomic, and wreath product form
Alexander Bors, Qiang Wang

TL;DR
This paper explores generalized cyclotomic mappings over finite fields, providing methods to switch between polynomial, cyclotomic, and wreath product forms, with applications in permutation analysis and cycle structure classification.
Contribution
It introduces two rewriting procedures for generalized cyclotomic mappings and applies them to permutation classification, cycle structures, and inversion problems.
Findings
Rewriting procedures enable switching between different representations of cyclotomic mappings.
Applications include classification of permutations and cycle structures.
Methods facilitate analysis of involutions and inversion in finite fields.
Abstract
This paper is concerned with so-called index generalized cyclotomic mappings of a finite field , which are functions that agree with a suitable monomial function on each coset of the index subgroup of . We discuss two important rewriting procedures in the context of generalized cyclotomic mappings and present applications thereof that concern index generalized cyclotomic permutations of and pertain to cycle structures, the classification of -cycles and involutions, as well as inversion.
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.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · Cryptography and Residue Arithmetic
