Related papers: Shuffling via sums of Jucys--Murphy Elements

Particles labelled $1,...,n$ are initially arranged in increasing order. Subsequently, each pair of neighboring particles that is currently in increasing order swaps according to a Poisson process of rate 1. We analyze the asymptotic…

The (n,k)-arrangement graph A(n,k) is a graph with all the k-permutations of an n-element set as vertices where two k-permutations are adjacent if they agree in exactly k-1 positions. We introduce a cyclic decomposition for k-permutations…

We investigate traces of powers of random matrices whose distributions are invariant under rotations (with respect to the Hilbert--Schmidt inner product) within a real-linear subspace of the space of $n\times n$ matrices. The matrices we…

We show that for an infinitely many natural numbers $k$ there are $k$-uniform hypergraphs which admit a `rescaling phenomenon' as described in [9]. More precisely, let $\mathcal{A}(k,I, n)$ denote the class of $k$-graphs on $n$ vertices in…

Determining the mixing time of Kac's random walk on the sphere $\mathrm{S}^{n-1}$ is a long-standing open problem. We show that the total variation mixing time of Kac's walk on $\mathrm{S}^{n-1}$ is between $\frac{1}{2} \, n \log(n)$ and…

In the top to random shuffle, the first a cards are removed from a deck of n cards 12 \cdots n and then inserted back into the deck. This action can be studied by treating the top to random shuffle as an element B_a, which we define…

We study the counts of smooth permutations and smooth polynomials over finite fields. For both counts we prove an estimate with an error term that matches the error term found in the integer setting by de Bruijn more than 70 years ago. The…

We consider self-adjoint unbounded Jacobi matrices with diagonal q_n=n and weights \lambda_n=c_n n, where c_n is a 2-periodical sequence of real numbers. The parameter space is decomposed into several separate regions, where the spectrum is…

We prove a conjecture by Shannon Starr regarding the asymptotics for the number of tuples of commuting permutations with given number of joint orbits. These numbers generalize unsigned Stirling numbers of the first kind which count how many…

We describe and compute various families of commuting elements of the matrix shuffle algebra of type $\mathfrak{gl}_{n|m}$, which is expected to be isomorphic to quantum toroidal $\mathfrak{gl}_{n|m}$. Our formulas are given in terms of…

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…

We generalize Reiner--Saliola--Welker's well-known but mysterious family of *$k$-random-to-random shuffles* from Markov chains on symmetric groups to Markov chains on the Type-$A$ Iwahori--Hecke algebras. We prove that the family of…

We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erd\H{o}s-R\'enyi graphs. Our error bounds are sharp for a large class of sparse random matrices.…

Consider the elements of the group algebra CS_{n} given by R_{j}=Sigma_{i=1}^{j-1}(ij), for 2<=j<=n. Jucys [3 - 5] and Murphy[7] showed that these elements act diagonally on elements of S_{n} and gave explicit formulas for the diagonal…

We introduce a variation of strong stationary times for random walks on the symmetric group. Rather than proceed in the usual fashion of accumulating larger and larger blocks of cards which may be in any order, we wait for pairs of cards to…

The cutoff phenomenon describes a sharp transition in the convergence of a family of ergodic finite Markov chains to equilibrium. Many natural families of chains are believed to exhibit cutoff, and yet establishing this fact is often…

We introduce a natural generalization of twisted maps, called \emph{warped maps}. While twisted maps play an important role in the study of Deligne--Mumford stacks, warped maps are better suited for studying Artin stacks. Heuristically,…

In the present paper, we consider a class of Markov processes on the discrete circle which has been introduced by K\"onig, O'Connell and Roch. These processes describe movements of exchangeable interacting particles and are discrete…

We consider a card guessing game with complete feedback. An ordered deck of $n$ cards labeled $1$ up to $n$ is shelf-shuffled exactly one time. One after the other a single card is drawn from the shuffled deck. The guesser makes has guess…