Connecting two types of representations of a permutation of F_q
From MaRDI portal
Publication:2297741
Abstract: In this paper, we connect two types of representations of a permutation of the finite field . One type is algebraic, in which the permutation is represented as the composition of degree-one polynomials and copies of , for some prescribed value of . The other type is combinatorial, in which the permutation is represented as the composition of a degree-one rational function followed by the product of -cycles on , where each -cycle moves . We show that, after modding out by obvious equivalences amongst the algebraic representations, then for each there is a bijection between the algebraic representations of and the combinatorial representations of . We also prove analogous results for permutations of . One consequence is a new characterization of the notion of Carlitz rank of a permutation on , which we use elsewhere to provide an explicit formula for the Carlitz rank. Another consequence involves a classical theorem of Carlitz, which says that if then the group of permutations of is generated by the permutations induced by degree-one polynomials and . Our bijection provides a new perspective from which the two proofs of this result in the literature can be seen to arise naturally, without requiring the clever tricks that previously appeared to be needed in order to discover those proofs.
Recommendations
Cites work
- scientific article; zbMATH DE number 3235418 (Why is no real title available?)
- scientific article; zbMATH DE number 3274801 (Why is no real title available?)
- A Class Of Permutation Groups Of Prime Degree
- A Note on Permutations in an Arbitrary Field
- Complete mappings and Carlitz rank
- Enumeration of a class of sequences generated by inversions
- Note on Permutations in a Finite Field
- On a theorem of Carlitz
- On the Carlitz rank of permutation polynomials
- On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences
- On the Inversive Pseudorandom Number Generator
- On the cycle structure of permutation polynomials
- Permutations in a finite field
- Permutations of finite fields with prescribed properties
- The Carlitz rank of permutations of finite fields: a survey
Cited in
(4)
This page was built for publication: Connecting two types of representations of a permutation of \(\mathbb{F}_q\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297741)