Related papers: The probability of long cycles in interchange proc…

We present some Markovian approaches to prove universality results for some functions on the symmetric group. Some of those statistics are already studied in [Kammoun, 2018, 2020] but not the general case. We prove, in particular, that the…

Exclusion processes became paradigmatic models of nonequilibrium interacting particle systems of wide range applicability both across the natural and the applied, social and technological sciences. Usually they are defined as a…

The goal of this monograph is to study the indicator function for a set of permutations mapping one finite sequence of positive integers to another from a representation theoretic, combinatorial and probabilistic perspective. The degree of…

We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,...,n}. These classes include the following: (1) both w and w^{-1} are alternating, (2) w has certain special shapes, such as…

Which combinatorial sequences correspond to moments of probability measures on the real line? We present a generating function, in the form of a continued fraction, for a fourteen-parameter family of such sequences and interpret these in…

We introduce the notion of a weighted inversion statistic on the symmetric group, and examine its distribution on each conjugacy class. Our work generalizes the study of several common permutation statistics, including the number of…

We enumerate permutations that avoid all but one of the $k$ patterns of length $k$ starting with a monotone increasing subsequence of length $k-1$. We compare the size of such permutation classes to the size of the class of permutations…

Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…

Starting from the cycle permutation sigma_(2^k) associated with the (2^k)-periodic orbit of the period doubling cascade we obtain the inverse permutation (sigma_(2^k))^-1. Then we build a matrix permutation related to (sigma_(2^k))^-1,…

This paper develops an analogy between the cycle structure of, on the one hand, random permutations with cycle lengths restricted to lie in an infinite set $S$ with asymptotic density $\sigma$ and, on the other hand, permutations selected…

We give a new proof of the cyclic sieving phenomena for promotion on rectangular standard tableaux. This uses an action of the cactus groups in the seminormal bases of the irreducible representations of the Hecke algebras.

We enumerate permutations in the two permutation classes $\text{Av}_n(312, 4321)$ and $\text{Av}_n(321, 4123)$ by the number of cycles each permutation admits. We also refine this enumeration with respect to several statistics.

We study random spatial permutations on Z^3 where each jump x -> \pi(x) is penalized by a factor exp(-T ||x-\pi(x)||^2). The system is known to exhibit a phase transition for low enough T where macroscopic cycles appear. We observe that the…

Denote the alternating and symmetric groups of degree $n$ by $A_n$ and $S_n$ respectively. Consider a permutation $\sigma\in S_n$ all of whose nontrivial cycles are of the same length. We find the minimal polynomials of $\sigma$ in the…

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…

We prove the Complete nontrivial cycle-intersection theorem for systems of permutations.

We characterize the minimum-length sequences of independent lazy simple transpositions whose composition is a uniformly random permutation. For every reduced word of the reverse permutation there is exactly one valid way to assign…

The possibility to study intermittency in a single event of high multiplicity is investigated in the framework of the $\alpha-$model. It is found that, for cascade long enough, the dispersion of intermittency exponents obtained from…

Each connected component of a mapping $\{1,2,...,n\}\rightarrow\{1,2,...,n\}$ contains a unique cycle. The largest such component can be studied probabilistically via either a delay differential equation or an inverse Laplace transform. The…

In probability theory, equalities are much less than inequalities. In this paper, we find a series of equalities which characterize the symmetry of the forming times of a family of similar cycles for discrete-time and continuous-time Markov…