Related papers: Shuffle Invariance of the Super-RSK Algorithm
The Robinson-Schensted-Knuth (RSK) correspondence is a bijective correspondence between two-rowed arrays of non-negative integers and pairs of same-shape semistandard tableaux. This correspondence satisfies the symmetry property, that is,…
Using the Berele/Remmel/Kerov/Vershik variation of the Robinson-Schensted-Knuth correspondence, we study the cycle and increasing subsequence structure after various methods of shuffling. One consequence is a cycle index for shuffles like:…
We investigate Robinson-Schensted-Knuth algorithm (RSK) and Sch\"utzenberger's jeu de taquin in the infinite setup. We show that the recording tableau in RSK defines an isomorphism of the following two dynamical systems: (i) a sequence of…
Several important families of computational and statistical results in machine learning and randomized algorithms rely on uniform bounds on quadratic forms of random vectors or matrices. Such results include the Johnson-Lindenstrauss (J-L)…
Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these…
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}$,…
Using symmetric function theory, we study the cycle structure and increasing subsequence structure of permutations after various shuffling methods, emphasizing the role of Cauchy type identities and the Robinson-Schensted-Knuth…
We give a new formula for the Littlewood--Richardson coefficients in terms of peelable tableaux compatible with shuffle tableaux, in the same fashion as Remmel--Whitney rule. This gives an efficient way to compute generalized…
Random Reshuffling (RR) is an algorithm for minimizing finite-sum functions that utilizes iterative gradient descent steps in conjunction with data reshuffling. Often contrasted with its sibling Stochastic Gradient Descent (SGD), RR is…
The Robinson-Schensted-Knuth (RSK) algorithm maps an integer matrix to a pair of semi-standard Young tableaux (SSYTs) whose underlying shape has the same integer partition. We study the set of matrices associated with a given partition…
A deck of $n$ cards is shuffled by repeatedly moving the top card to one of the bottom $k_n$ positions uniformly at random. We give upper and lower bounds on the total variation mixing time for this shuffle as $k_n$ ranges from a constant…
We show numerically that the roughness and growth exponents of a wide range of rough surfaces, such as random deposition with relaxation (RDR), ballistic deposition (BD) and restricted solid-on-solid model (RSOS), are independent of the…
Permutations avoiding all patterns of a given shape (in the sense of Robinson-Schensted-Knuth) are considered. We show that the shapes of all such permutations are contained in a suitable thick hook, and deduce an exponential growth rate…
We introduce a probabilistic generalization of the dual Robinson--Schensted--Knuth correspondence, called $qt$RSK${}^*$, depending on two parameters $q$ and $t$. This correspondence extends the $q$RS$t$ correspondence, recently introduced…
Given an rc-graph $R$ of permutation $w$ and an rc-graph $Y$ of permutation $v$, we provide an insertion algorithm, which defines an rc-graph $R\leftarrow Y$ in the case when $v$ is a shuffle with the descent at $r$ and $w$ has no descents…
We explain how to define the Robinson-Schensted-Knuth (RSK) correspondence in terms of local transformations called "toggles." (This note, which is not intended for publication and which is based on presentations of Alex Postnikov, was…
We characterize the class of cycle decompositions that can achieve all Young tableau shapes (except the trivial ones with a single row or a single column) under the Robinson--Schensted--Knuth (RSK) correspondence, a property that we call…
Given a free module L over a commutative ring k, we study two k-linear operators on the tensor algebra of T(L): One of them sends a pure tensor u_1 (X) u_2 (X) ... (X) u_k to the sum of all tensors u_i (X) u_1 (X) u_2 (X) ... (X) (skip u_i)…
It is well known that Rubik's cube has a set of group invariants. These values do not change if any layer was rotated, but they can change in case if some of the cubes were removed from the puzzle, mixed up and returned back. In this paper,…
Random matrix theory (RMT) provides a successful model for quantum systems, whose classical counterpart has a chaotic dynamics. It is based on two assumptions: (1) matrix-element independence, and (2) base invariance. Last decade witnessed…