Related papers: A Relation for Domino Robinson-Schensted Algorithm…
In [Matveev-Petrov 2016](arXiv:1504.00666) a $q$-deformed Robinson-Schensted-Knuth algorithm ($q$RSK) was introduced. In this article we give reformulations of this algorithm in terms of the Noumi-Yamada description, growth diagrams and…
We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…
We study domino tilings of certain regions $R_\lambda$, indexed by partitions $\lambda$, weighted according to generalized area and dinv statistics. These statistics arise from the $q,t$-Catalan combinatorics and Macdonald polynomials. We…
Differentiable systems in this paper means systems of equations that are described by differentiable real functions in real matrix variables. This paper proposes algorithms for finding minimal rank solutions to such systems over (arbitrary…
A Markov chain is considered whose states are orderings of an underlying fixed tree and whose transitions are local "random-to-front" reorderings, driven by a probability distribution on subsets of the leaves. The eigenvalues of the…
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
Recently Wilson [Ann. Appl. Probab. 14 (2004) 274--325] introduced an important new technique for lower bounding the mixing time of a Markov chain. In this paper we extend Wilson's technique to find lower bounds of the correct order for…
We show that the quantum straightening algorithm for Young tableaux and Young bitableaux reduces in the crystal limit $q \mapsto 0$ to the Robinson-Schensted algorithm.
The goal of these expository notes is to give an introduction to random matrices for non-specialist of this topic focusing on the link between random matrices and systems of particles in interaction. We first recall some general results…
Recently, a variety of methods under the name of non-contrastive learning (like BYOL, SimSiam, SwAV, DINO) show that when equipped with some asymmetric architectural designs, aligning positive pairs alone is sufficient to attain good…
We prove a limit shape theorem describing the asymptotic shape of bumping routes when the Robinson-Schensted algorithm is applied to a finite sequence of independent, identically distributed random variables with the uniform distribution…
We provide a deterministic CONGEST algorithm to constant factor approximate the minimum dominating set on graphs of bounded arboricity in $O(\log n)$ rounds. This improves over the well-known randomized algorithm of Lenzen and…
Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. We examine how the sign property is transferred by the skew Robinson-Schensted correspondence…
We introduce and study q-randomized Robinson-Schensted-Knuth (RSK) correspondences which interpolate between the classical (q=0) and geometric (q->1) RSK correspondences (the latter ones are sometimes also called tropical). For 0<q<1 our…
In this paper we investigate a permutation statistic that was independently introduced by Romik in 2005. This statistic counts the number of bumps that occur during the execution of the Robinson-Schensted procedure when applied to a given…
We construct a relationship between integral and differential representation of second-order Jordan chains. Conditions to obtain regular potentials through the confluent supersymmetry algorithm when working with the differential…
The Robinson-Schensted correspondence can be viewed as a map from permutations to partitions. In this work, we study the number of inversions of permutations corresponding to a fixed partition $\lambda$ under this map. Hohlweg characterized…
We prove K-theoretic and shifted K-theoretic analogues of the bijection of Stanton and White between domino tableaux and pairs of semistandard tableaux. As a result, we obtain product formulas for pairs of stable Grothendieck polynomials…
A novel approach for supervised classification is presented which sits at the intersection of machine learning and dynamical systems theory. At variance with other methodologies that employ ordinary differential equations for classification…
We show how the sign of a permutation can be deduced from the tableaux induced by the permutation under the Robinson-Schensted-Knuth correspondence. The result yields a simple proof of a conjecture on the squares of imbalances raised by…