Related papers: The last patch for classifying shuffle groups

These are detailed lecture notes of the crash-course on shuffle algebras delivered by the author at Tokyo University of Marine Science and Technology during the second week of March 2019. These notes consist of three chapters, providing a…

A skew morphism of a finite group $A$ is a permutation $\varphi$ of $A$ fixing the identity element and for which there is an integer-valued function $\pi$ on $A$ such that $\varphi(ab)=\varphi(a)\varphi^{\pi(a)}(b)$ for all $a, b \in A$. A…

For the general linear group $GL_n(k)$ over an algebraically closed field $k$ of characteristic $p$, there are two types of "twisting" operations that arise naturally on partitions. These are of the form $\lambda \rightarrow p\lambda$ and…

The notion of shuffle-compatible permutation statistics was implicit in Stanley's work on P-partitions and was first explicitly studied by Gessel and Zhuang. The aim of this paper is to prove that the triple ${\rm (udr, pk, des)}$ is…

We study the orbits under the natural action of a permutation group $G \subseteq S_n$ on the powerset $\mathscr{P}(\{1, \dots , n\})$. The permutation groups having exactly $n+1$ orbits on the powerset can be characterized as set-transitive…

Let $S_n$ be the symmetric group of all permutations of $\{1, \cdots, n\}$ with two generators: the transposition switching $1$ with $2$ and the cyclic permutation sending $k$ to $k+1$ for $1\leq k\leq n-1$ and $n$ to $1$ (denoted by…

We consider a card guessing game with complete feedback. An ordered deck of $n$ cards labeled $1$ up to $n$ is riffle-shuffled exactly one time. Given a value $p\in(0{,}1)\setminus\{\frac12\}$, the riffle shuffle is assumed to be…

A permutation sigma in Sn is a k-derangement if for any subset X = {a1, . . ., ak} \subseteq [n], {sigma(a1), . . ., sigma(ak)} is not equal to X. One can form the k-derangement graph on the set of permutations of Sn by connecting two…

For $\eta\in S_3$, let $S_n^{\text{av}(\eta)}$ denote the set of permutations in $S_n$ that avoid the pattern $\eta$, and let $E_n^{\text{av}(\eta)}$ denote the expectation with respect to the uniform probability measure on…

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 $n$ be an integer with $n > 1$. For every $r$ satisfying the inequalities $0 \leq r < n$, the residue class modulo $n$ is defined as $r(n)=\{r + kn | k \in Z\}$, where $Z$ is the set of all integers. Then for $0 \leq r_1\neq r_2 < n$,…

Let $n$ be a fixed integer with $n\geq 2$. For $i,j\in\mathbb{Z}_n$, define $||i,j||_n$ to be the distance between $i$ and $j$ when the elements of $\mathbb{Z}_n$ are written in a cycle. So $||i,j||_n=\min\{(i-j)\bmod n,(j-i)\bmod n\}$. For…

We show that any smooth permutation $\sigma\in S_n$ is characterized by the set ${\mathbf{C}}(\sigma)$ of transpositions and $3$-cycles in the Bruhat interval $(S_n)_{\leq\sigma}$, and that $\sigma$ is the product (in a certain order) of…

Denote by $A(p, n, k)$ the number of commuting $p$-tuples of permutations on $[n]$ that have exactly $k$ distinct orbits. It was conjectured in~\cite{abdesselam2023log} that $A(p, n, k)$ is log-concave with respect to $k$ for every $p\geq…

Using existing classification results for the 7- and 8-cycles in the pancake graph, we determine the number of permutations that require 4 pancake flips (prefix reversals) to be sorted. A similar characterization of the 8-cycles in the…

We introduce the stack-sorting map $\text{SC}_\sigma$ that sorts, in a right-greedy manner, an input permutation through a stack that avoids some vincular pattern $\sigma$. The stack-sorting maps of Cerbai et al. in which the stack avoids a…

A group action is said to be highly-transitive if it is $k$-transitive for every $k \ge 1$. The main result of this thesis is the following: Main Theorem: The fundamental group of a closed, orientable surface of genus > 1 admits a…

In this paper, we construct and classify a new family of flips, called generalized Grassmannian flips, by generalizing the construction of standard flips for $\mathbb{P}^m\times \mathbb{P}^n$ to any generalized Grassmannian $G/P$, where $P$…

We give shuffle algebra realization of positive part of quantum affine superalgebra $U_{v}(\widehat{\mathfrak{D}}(2,1;\theta))$ associated to any simple root systems. We also determine the shuffle algebra associated to…

Given a permutation group $G$, the derangement graph of $G$ is the Cayley graph with connection set the derangements of $G$. The group $G$ is said to be innately transitive if $G$ has a transitive minimal normal subgroup. Clearly, every…