English
Related papers

Related papers: R\'edei permutations with cycles of the same lengt…

200 papers

We investigate dynamical properties of the set of permutations of $\mathbb{Z}^d$ with restricted movement, i.e., permutations $\pi $ of $\mathbb{Z}^d$ such that $\pi (\mathbf{n})-\mathbf{n}$ lies, for every $\mathbf{n}\in \mathbb{Z}^d$, in…

Dynamical Systems · Mathematics 2017-06-26 Klaus Schmidt , Gabriel Strasser

Fix $q\neq 1$, and sample $w\in S_n$ from the Mallows measure. We study the distribution of $C_i(w)$, the number of $i$-cycles, as $n$ grows large. When $q<1$, they are jointly Gaussian, and this more or less follows from known ideas, but…

Probability · Mathematics 2022-06-22 Jimmy He

We explore the connection between cyclotomic mapping permutation polynomials and permutation polynomials of the form $x^rf(x^{\frac{q-1}{l}})$ over finite fields. We present a new necessary and a new sufficient condition to verify…

Number Theory · Mathematics 2025-10-13 Suman Mondal

Let $R$ be a finite commutative ring with $1\ne 0$. The set $\mathcal{F}(R)$ of polynomial functions on $R$ is a finite commutative ring with pointwise operations. Its group of units $\mathcal{F}(R)^\times$ is just the set of all…

Commutative Algebra · Mathematics 2021-06-04 Amr Ali Al-Maktry

Let $\mathbb{F}_q$ be the finite field with $q=p^s$ elements, where $p$ is an odd prime and $s$ a positive integer. In this paper, we define the function $f(X)=(cX^q+aX)(X^{q}-X)^{n-1}$, for $a,c\in\mathbb{F}_q$ and $n\geq 1$. We study the…

Number Theory · Mathematics 2026-03-04 Fabio E. Brochero Martínez , Hugo R. Teixeira

Let V be a d-dimensional vector space over a field of prime order p. We classify the affine transformations of V of order at least p^d/4, and apply this classification to determine the finite primitive permutation groups of affine type, and…

Group Theory · Mathematics 2013-06-07 Simon Guest , Joy Morris , Cheryl Praeger , Pablo Spiga

We bound the number of permutations with a fixed number $r$ of $321 \ominus p_0$ patterns by a constant times the number of permutations which avoid $321 \ominus p_0$. We use this new upper bound to show that the ordinary generating…

Combinatorics · Mathematics 2025-10-29 Michael Waite

Kitaev, Potapov, and Vajnovszki [On shortening u-cycles and u-words for permutations, Discrete Appl. Math, 2019] described how to shorten universal words for permutations, to length $n!+n-1-i(n-1)$ for any $i \in [(n-2)!]$, by introducing…

Combinatorics · Mathematics 2023-08-14 Rachel Kirsch , Bernard Lidický , Clare Sibley , Elizabeth Sprangel

The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…

Probability · Mathematics 2009-11-23 Paul-Olivier Dehaye , Dirk Zeindler

We consider the linear vector space formed by the elements of the finite fields $\mathbb{F}_q$ with $q=p^r$ over $\mathbb{F}_p$. Let ${a_1,\ldots,a_r}$ be a basis of this space. Then the elements $x$ of $\mathbb{F}_q$ have a unique…

Number Theory · Mathematics 2016-02-23 Mikhail Gabdullin

We explore variants of Erd\H os' unit distance problem concerning dot products between successive pairs of points chosen from a large finite subset of either $\mathbb F_q^d$ or $\mathbb Z_q^d,$ where $q$ is a power of an odd prime.…

Combinatorics · Mathematics 2021-09-22 Vincent Blevins , David Crosby , Ethan Lynch , Steven Senger

Let F_{q^n} be the field of order q^n, and let Tr be the trace map from F_{q^n} to its q-element subfield. We exhibit nine sequences of polynomials of the form f(x):=x+c*Tr(x^k), with c in F_{q^n}, such that for each polynomial the function…

Number Theory · Mathematics 2016-03-04 Gohar Kyureghyan , Michael Zieve

We present various results on multiplying cycles in the symmetric group. Our first result is a generalisation of the following theorem of Boccara (1980): the number of ways of writing an odd permutation in the symmetric group on $n$ symbols…

Combinatorics · Mathematics 2015-10-13 Valentin Féray , Amarpreet Rattan

Let $\beta$ be any permutation on $n$ symbols and let $c(k, \beta)$ be the number of permutations that $k$-commute with $\beta$. The cycle type of a permutation $\beta$ is a vector $(c_1, \dots, c_n)$ such that $\beta$ has exactly $c_i$…

Combinatorics · Mathematics 2015-12-01 Luis Manuel Rivera

We study maps on the set of permutations of n generated by the R\'enyi-Foata map intertwined with other dihedral symmetries (of a permutation considered as a 0-1 matrix). Iterating these maps leads to dynamical systems that in some cases…

Combinatorics · Mathematics 2020-08-10 Michael LaCroix , Tom Roby

A criterion of joint ergodicity of several sequences of transformations of a probability measure space $X$ of the form $T_{i}^{\phi_{i}(n)}$ is given for the case where $T_{i}$ are commuting measure preserving transformations of $X$ and…

Dynamical Systems · Mathematics 2014-09-26 Vitaly Bergelson , Alexander Leibman , Younghwan Son

We study planar bicycle dynamics via the rotation number function associated with a closed front track and bicycle length R. We prove that mode-locking plateaus occur only at integer rotation numbers and that the rotation number function is…

Dynamical Systems · Mathematics 2025-11-21 Diantong Li , Qiaoling Wei , Meirong Zhang , Zhe Zhou

We characterize the class of cycle decompositions that can achieve all Young tableau shapes (except the trivial ones with a single row or a single column) under the Robinson--Schensted--Knuth (RSK) correspondence, a property that we call…

Combinatorics · Mathematics 2023-01-19 Agastya Goel , Simon Rubinstein-Salzedo

Carlitz proved that, for any prime power q other than 2, the group of all permutations of the finite field F_q is generated by the permutations induced by degree-one polynomials and x^{q-2}. His proof relies on a remarkable polynomial which…

Number Theory · Mathematics 2016-03-04 Michael E. Zieve

We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then…

Number Theory · Mathematics 2013-10-08 Ariane M. Masuda , Michael E. Zieve