Related papers: R\'edei permutations with the same cycle structure

Let $S_n$ and $S_{n,k}$ be, respectively, the number of subsets and $k$-subsets of $\mathbb{N}_n=\{1,\ldots,n\}$ such that no two subset elements differ by an element of the set $\mathcal{Q}$, the largest element of which is $q$. We prove a…

Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…

Let $n \in \NN$ and let $q=p^r$ be an odd prime power. Let $R$ be a finite commutative local principal ring of cardinality $q^{n}$ with $R/J(R) \simeq GF(q)$. We study the conjugation action of the group of all unipotent elements in the…

We study integrals over Hermitian supermatrices of arbitrary size $p+q$, that are parametrized by an external field $X$ and a source $Y$, of respective size $m+n$ and $p+q$. We show that these integrals exhibit a simple topological…

We discuss both simple and more subtle connections between the numbers of permutations and full cycles with some restrictions,in particular, between the numbers of permutations and full cycles with prescribed up-down structure.

We define a series $\mathcal{F}_{M,N}$ as a certain generalization of $q$-hypergeometric function. We study its duality and the system of $q$-difference nonlinear equations which admits particular solutions in terms of $\mathcal{F}_{1,M}$.

We study the modularity of the generating series of special cycles on unitary Shimura varieties over CM-fields of degree $2d$ associated with a Hermitian form in $n+1$ variables whose signature is $(n,1)$ at $e$ real places and $(n+1,0)$ at…

In this paper, we study restricted excludant statistics depending on its parity in partitions where parts with same parity are distinct. Using $q$-series transformations, we show that generating functions of these partition statistics are…

A cycle $C$ of a graph $G$ is \emph{isolating} if every component of $G-V(C)$ is a single vertex. We show that isolating cycles in polyhedral graphs can be extended to larger ones: every isolating cycle $C$ of length $6 \leq |E(C)| < \left…

We study two new families of symmetric functions arising from a species-theoretic construction motivated by cycle structure. For each partition of $n$, we define two combinatorial species that decompose into molecules indexed by the same…

Let $ G = \mathbb{Z}/r\mathbb{Z}$ be the cyclic group of order $r$, and let $\varpi = e^{2\pi i / r}$ denote a primitive $r$ th root of unity. Consider the action of $G$ on $\mathbb{C}^n$ via the embedding $$ \varphi : G \hookrightarrow…

An algorithm for solving first order ODEs, by systematically determining symmetries of the form [ xi = F(x), eta = P(x) y + Q(x) ], where xi d/dx + eta d/dy is the symmetry generator - is presented. To these {\it linear} symmetries one can…

Let $n,m\in \mathbb{N}$, and let $B_{n,m}(\mathbb{R}P^2)$ be the set of $(n + m)$-braids of the projective plane whose associated permutation lies in the subgroup $S_n\times S_m$ of the symmetric group $S_{n+m}$. We study the splitting…

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

For a graph with edge ordering, a linear order on the edge set, we obtain a permutation of vertices by considering the edges as transpositions of endvertices. It is known from D\'enes' results that the permutation of a tree is a full cyclic…

We first give two new proofs of an old result that the reduced Euler characteristic of a matroid complex is equal to the M\"obius number of the lattice of cycles of the matroid up to the sign. The purpose has been to find a model to…

Recent work by Huang, Lewis, Morales, Reiner, and Stanton suggests that the regular elliptic elements of $\mathrm{GL}_n \mathbb{F}_q$ are somehow analogous to the $n$-cycles of the symmetric group. In 1981, Stanley enumerated the…

An adjacent $q$-cycle is a natural generalization of an adjacent transposition. We show that the number of adjacent $q$-cycles in a permutation maps to the sum of occurrences of two mesh patterns under Foata's fundamental transformation. As…

If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4] and [5] showed that, if a permutation-like matrix group contains a maximal cycle of length equal to a…

We study the cycle structure of words in several random permutations. We assume that the permutations are independent and that their distribution is conjugation invariant, with a good control on their short cycles. If, after successive…