Related papers: Shuffle theorems and sandpiles
We classify recurrent configurations of the sandpile model on the complete bipartite graph K_{m,n} in which one designated vertex is a sink. We present a bijection from these recurrent configurations to decorated parallelogram polyominoes…
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…
FI-graphs were introduced by the second author and White to capture the idea of a family of nested graphs, each member of which is acted on by a progressively larger symmetric group. That work was built on the newly minted foundations of…
We introduce two operators on stable configurations of the sandpile model that provide an algorithmic bijection between recurrent and parking configurations. This bijection preserves their equivalence classes with respect to the sandpile…
Modern applications of algebraic topology to point cloud data analysis have motivated active investigation of combinatorial clique complexes -- high-dimensional extensions of combinatorial graphs. We show that meaningful invariants of such…
We present an LLT-type formula for a general power of the nabla operator applied to the Cauchy product for the modified Macdonald polynomials, and use it to deduce a new proof of the generalized shuffle theorem describing $\nabla^k e_n$,…
We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each…
We develop a formalism to address statistical pattern recognition of graph valued data. Of particular interest is the case of all graphs having the same number of uniquely labeled vertices. When the vertex labels are latent, such graphs are…
Divide a deck of $kn$ cards into $k$ equal piles and place them from left to right. The standard shuffle $\sigma$ is performed by picking up the top cards one by one from left to right and repeating until all cards have been picked up. For…
The article considers the procedure of connection of graphs to the edges of a cyclic graph and its influence on the sandpile group of the graph thus obtained. A series of classes of graphs CH_n(a_1,...,a_n) is defined. Recurrent and…
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…
We investigate the mathematics behind unshuffles, a type of card shuffle closely related to classical perfect shuffles. To perform an unshuffle, deal all the cards alternately into two piles and then stack the one pile on top of the other.…
The shuffle product has a connection with several useful permutation statistics such as descent and peak, and corresponds to the multiplication operation in the corresponding descent and peak algebras. In their recent work, Gessel and…
The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous variant G(n,W) of the Erdos-Renyi random graph. Here we study the clique number of these random graphs. We establish the concentration of…
A set of independence statements may define the independence structure of interest in a family of joint probability distributions. This structure is often captured by a graph that consists of nodes representing the random variables and of…
The modified Macdonald polynomials, introduced by Garsia and Haiman (1996), have many astounding combinatorial properties. One such class of properties involves applying the related $\nabla$ operator of Bergeron and Garsia (1999) to basic…
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.
Consider a permutation $\sigma\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $\sigma_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We study some probabilistic and…
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…
We prove here that the polynomial <nabla(C_p(1)), e_a h_b h_c> q, t-enumerates, by the statistics dinv and area, the parking functions whose supporting Dyck path touches the main diagonal according to the composition p of size a + b + c and…