Related papers: Cyclotomic shuffles
We give a new expression for the expected number of inversions in the product of n random adjacent transpositions in the symmetric group S_{m+1}. We then derive from this expression the asymptotic behaviour of this number when n scales with…
Let $G$ be a finite group, $H \le G$ a subgroup, $R$ a commutative ring, $A$ an $R$-algebra, and $\alpha$ an action of $G$ on $A$ by $R$-algebra automorphisms. We study the associated \emph{skew Hecke algebra}…
A pile-scramble shuffle is one of the most effective shuffles in card-based cryptography. Indeed, many card-based protocols are constructed from pile-scramble shuffles. This article aims to study the power of pile-scramble shuffles. In…
A mixed graph is a set of vertices together with an edge set and an arc set. An $(m,n)$-mixed graph $G$ is a mixed graph whose edges are each assigned one of $m$ colours, and whose arcs are each assigned one of $n$ colours. A \emph{switch}…
We show that it is possible to deduce the Calogero-Moser partition of the irreducible representations of the complex reflection groups G(m,d,n) from the corresponding partition for G(m,1,n). This confirms, in the case W = G(m,d,n), a…
The distribution of unicyclic components in a random graph is obtained analytically. The number of unicyclic components of a given size approaches a self-similar form in the vicinity of the gelation transition. At the gelation point, this…
The eigenvalues of quantum chaotic systems have been conjectured to follow, in the large energy limit, the statistical distribution of eigenvalues of random ensembles of matrices of size $N\rightarrow\infty$. Here we provide semiclassical…
Let k be a commutative algebra with the field of the rational numbers included in k and let (E,p,i) be a cleft extension of A. We obtain a new mixed complex, simpler than the canonical one, giving the Hochschild and cyclic homologies of E…
Let $\{G_n\}_1^{\infty}$ be a sequence of non-trivial finite groups. In this paper, we study the properties of a random walk on the complete monomial group $G_n\wr S_n$ generated by the elements of the form…
In a recent breakthrough, Teyssier [Tey20] introduced a new method for approximating the distance from equilibrium of a random walk on a group. He used it to study the limit profile for the random transpositions card shuffle. His techniques…
We study a class of symmetric quantum walks on Hamming graphs, where the distance between vertices specifies the transition probability. A special model is the simple quantum walk on the hypercube, which has been discussed in the…
Type A affine shuffles are compared with riffle shuffles followed by a cut. Although these probability measures on the symmetric group S_n are different, they both satisfy a convolution property. Strong evidence is given that when the…
Let $G_{k,n}$ be a group of permutations of $kn$ objects which permutes things independently in disjoint blocks of size $k$ and then permutes the blocks. We investigate the probabilistic and/or enumerative aspects of random elements of…
This paper aims to systematically study mystic reflection groups that emerged independently in the paper [Selecta Math. (N.S.) 14 (2009), 325-372, arXiv:0806.0867] by the authors and in the paper [Algebr. Represent. Theory 13 (2010),…
We give a classification of the simple modules for the cyclotomic Hecke algebras over $\mathbb{C}$ in the modular case. We use the unitriangular shape of the decomposition matrices of Ariki-Koike algebras and Clifford theory.
The enumeration of Hamiltonian cycles on 2n*2n grids of nodes is a longstanding problem in combinatorics. Previous work has concentrated on counting all cycles. The current work enumerates nonisomorphic cycles -- that is, the number of…
Counting homomorphisms between cyclic groups is a common exercise in a first course in abstract algebra. A similar problem, accessible at the same level, is to count the number of group homomorphisms from a dihedral group of order $2m$ into…
We study the Gilbert-Shannon-Reeds model for riffle shuffles and ask 'How many times must a deck of cards be shuffled for the deck to be in close to random order?'. In 1992, Bayer and Diaconis gave a solution which gives exact and…
Let $\mathcal{SS}_k(n)$ be the family of {\it shuffle squares} in $[k]^{2n}$, words that can be partitioned into two disjoint identical subsequences. Let $\mathcal{RSS}_k(n)$ be the family of {\it reverse shuffle squares} in $[k]^{2n}$,…
We study how the order of N independent random walks in one dimension evolves with time. Our focus is statistical properties of the inversion number m, defined as the number of pairs that are out of sort with respect to the initial…