Related papers: Shuffle-compatible permutation statistics II: the …
We investigate bipartite particle number fluctuations near the rank-$2$ exceptional points (EPs) of $\mathcal{PT}$-symmetric Su-Schrieffer-Heeger models. Beyond a conformal field theory of massless fermions, fluctuations or equivalently…
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…
We investigate the $k$-cycle shuffle on repeated cards, namely on a deck consisting of $l$ identical copies of each of $m$ card types, with total size $n=ml$. We establish asymptotic results for the total variation mixing of this shuffle,…
Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968). Perhaps the most natural algorithmic question in this…
For a natural unit interval order $P$, we describe proper colorings of the incomparability graph of $P$ in the language of heaps. We also introduce a combinatorial operation, called a \emph{local flip}, on the heaps. This operation defines…
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…
This paper studies the degree to which a bivariate copula fails to be symmetric under coordinate permutation, a property known as non-exchangeability. Working within an axiomatic framework that quantifies this asymmetry through a family of…
This is a sequel to our paper "Permute, Graph, Map, Derange", involving decomposable combinatorial labeled structures in the exp-log class of type a=1/2, 1, 3/2, 2. As before, our approach is to establish how well existing theory matches…
A record in a permutation is a maximum or a minimum, from the left or from the right. The entries of a permutation can be partitioned into two types: the ones that are records are called external points, the others are called internal…
We introduce new natural generalizations of the classical descent and inversion statistics for permutations, called width-$k$ descents and width-$k$ inversions. These variations induce generalizations of the excedance and major statistics,…
The transpose top-$2$ with random shuffle (J. Theoret. Probab., 2020) is a lazy random walk on the alternating group $A_n$ generated by $3$-cycles of the form $(\star,n-1,n)$ and $(\star,n,n-1)$. We obtain the limit profile of this random…
We define a number of related combinatorial objects, each of which possesses a surprising symmetry. We include several applications such as a combinatorial explanation for certain fixed points of the involution $\omega$ on the ring of…
Theorems relating permutations with objects in other fields of mathematics are often stated in terms of avoided patterns. Examples include various classes of Schubert varieties from algebraic geometry (Billey and Abe 2013), commuting…
An instance $I$ of the Stable Matching Problem (SMP) is given by a bipartite graph with a preference list of neighbors for every vertex. A swap in $I$ is the exchange of two consecutive vertices in a preference list. A swap can be viewed as…
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…
It is well known since the seminal work by Bousquet-M\'elou, Claesson, Dukes and Kitaev (2010) that certain refinements of the ascent sequences with respect to several natural statistics are in bijection with corresponding refinements of…
We consider the distribution of ascents, descents, peaks, valleys, double ascents, and double descents over permutations avoiding a set of patterns. Many of these statistics have already been studied over sets of permutations avoiding a…
The peak set of a permutation records the indices of its peaks. These sets have been studied in a variety of contexts, including recent work by Billey, Burdzy, and Sagan, which enumerated permutations with prescribed peak sets. In this…
The partially asymmetric exclusion process (PASEP) is an important model from statistical mechanics which describes a system of interacting particles hopping left and right on a one-dimensional lattice of N sites. It is partially asymmetric…
Claesson and Linusson [Proc. Am. Math. Soc., 139 (2011), 435-449] observed that there are n! matchings on [2n] with no left-nestings. Inspired by this result, this paper is devoted to exploring a deeper connection between matchings and…