Rédei permutations with the same cycle structure
نویسندگان
چکیده
Let $\mathbb{F}_q$ be the finite field of order $q$, and $\mathbb P^1(\mathbb{F}_q) = \mathbb F_q\cup \{\infty\}$. Write $(x+\sqrt y)^m$ as $N(x,y)+D(x,y)\sqrt{y}$. For $m\in\mathbb N$ $a \in \mathbb{F}_q$, R\'edei function $R_{m,a}\colon P^1(\mathbb F_q) \to F_q)$ is defined by $N(x,a)/D(x,a)$ if $D(x,a)\neq 0$ $x\neq\infty$, $\infty$, otherwise. In this paper we give a complete characterization all pairs $(m,n)\in\mathbb N^2$ such that permutations $R_{m,a}$ $R_{n,b}$ have same cycle structure when $a$ $b$ quadratic character $q$ odd. We explore some relationships between $(m,n)$, provide explicit families with structure. When permutation has unique not shared any other permutation, call it isolated. show only isolated are involutions. Moreover, our results can transferred to bijections form $mx$ $x^m$ on certain domains.
منابع مشابه
Cycle structure of random permutations with cycle weights
We investigate the typical cycle lengths, the total number of cycles, and the number of finite cycles in random permutations whose probability involves cycle weights. Typical cycle lengths and total number of cycles depend strongly on the parameters, while the distributions of finite cycles are usually independent Poisson random variables. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 44,...
متن کاملStirling Permutations, Cycle Structure of Permutations and Perfect Matchings
In this paper we provide constructive proofs that the following three statistics are equidistributed: the number of ascent plateaus of Stirling permutations of order n, a weighted variant of the number of excedances in permutations of length n and the number of blocks with even maximal elements in perfect matchings of the set {1, 2, 3, . . . , 2n}.
متن کاملSymmetric functions, generalized blocks, and permutations with restricted cycle structure
We present various techniques to count proportions of permutations with restricted cycle structure in finite permutation groups. For example, we show how a generalized block theory for symmetric groups, developed by Külshammer, Olsson, and Robinson, can be used for such calculations. The paper includes improvements of recurrence relations of Glasby, results on average numbers of fixed points in...
متن کاملCounting Permutations with Given Cycle Structure and Descent Set
The purpose of this paper is to count permutations in S , with a given cycle structure and a given descent set. Our main result (Theorem 2.1) asserts that the number of these permutations can be expressed as a scalar product of two symmetric functions, one associated with the cycle structure and the other with the descent set. Both of these symmetric functions can be interpreted as characterist...
متن کاملEnumerating pairs of permutations with the same up-down form
For each sequence q = {qi} = ±1, i = 1 . . . . . n 1 let Nq = the number of permutations tr of 1, 2 . . . . . n with up-down sequence sgn(tri+x-tri) = th, i = 1 . . . . . n 1. Clearly Y.q (Nqln!) = 1 but what is the probability p, = Y.q (NJn! ) 2 that two random permutations have the same up-down sequence? We show that p,, = ( K " t l , 1) where 1 = l(x, y)-1 and K "-1 is the iterated integral ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2022
ISSN: ['1090-2465', '1071-5797']
DOI: https://doi.org/10.1016/j.ffa.2022.102046