Related papers: RSK as a linear operator

A novel strategy to automated classification is introduced which exploits a fully trained dynamical system to steer items belonging to different categories toward distinct asymptotic attractors. These latter are incorporated into the model…

R. Sulzgruber's rim hook insertion and the Hillman-Grassl correspondence are two distinct bijections between the reverse plane partitions of a fixed partition shape and multisets of rim-hooks of the same partition shape. It is known that…

Promotion permutations have recently been associated to each rectangular standard Young tableau by Gaetz--Pechenik--Pfannerer--Striker--Swanson. Here we relate promotion permutations to the Robinson--Schensted (RS) correspondence. More…

We introduce a generalization of the scaled relative graph (SRG) to pairs of operators, enabling the visualization of their relative incremental properties. This novel SRG framework provides the geometric counterpart for the study of…

The symbol is used to describe the Springer correspondence for the classical groups by Lusztig. We refine the explanation that the $S$-duality maps of the rigid surface operators are symbol preserving maps. And we find that the maps $X_S$…

We review some algebraic and combinatorial structures that underlie models in the KPZ universality class.Emphasis is placed on the Robinson-Schensted-Knuth correspondence and its geometric lifting due to A.N.Kirillov. We present how these…

We establish a bijective RSK correspondence of type C for King tableaux with Berele insertion as a reformulation of Sundaram's correspondence (1986). For its $Q$-symbol, we make use of semistandard oscillating tableaux (SSOT), a new object…

We introduce an object called a decorated Young tableau which can equivalently be viewed as a continuous time trajectory of Young diagrams or as a non-intersecting line ensemble. By a natural extension of the Robinson-Schensted…

This paper is about randomized iterative algorithms for solving a linear system of equations $X \beta = y$ in different settings. Recent interest in the topic was reignited when Strohmer and Vershynin (2009) proved the linear convergence…

As in the $(k,l)$-RSK (Robinson-Schensted-Knuth) of [1], other super-RSK algorithms can be applied to sequences of variables from the set $\{t_1,...,t_k,u_1,...,u_l\}$, where $t_1<...<t_k$, and $u_1<...<u_l$. While the $(k,l)$-RSK of [1] is…

This is a survey on discrete linear operators which, besides approximating in Jackson or near-best order, possess some interpolatory property at some nodes. Such operators can be useful in numerical analysis.

To be able to solve operator equations numerically a discretization of those operators is necessary. In the Galerkin approach bases are used to achieve discretized versions of operators. In a more general set-up, frames can be used to…

We construct the analogue of the plactic monoid for the super semistandard Young tableaux over a signed alphabet. This is done by developing a generalization of the Knuth's relations. Moreover we get generalizations of Greene's invariants…

We consider the Robinson-Schensted-Knuth algorithm applied to a random input and investigate the shape of the bumping route (in the vicinity of the $y$-axis) when a specified number is inserted into a large Plancherel-distributed tableau.…

Combinatorial aspects of multivariate diagonal invariants of the symmetric group are studied. As a consequence it is proved the existence of a multivariate extension of the classical Robinson-Schensted correspondence. Further byproduct are…

A Robinson similarity matrix is a symmetric matrix where the entry values on all rows and columns increase toward the diagonal. Decompose the Robinson matrix into the sum of k {0, 1}-matrices, then these k {0, 1}-matrices are the adjacency…

Lascoux polynomials are $K$-theoretic analogues of the key polynomials. They both have combinatorial formulas involving tableaux: reverse set-valued tableaux ($\mathsf{RSVT}$) rule for Lascoux polynomials and reverse semistandard Young…

We define a number of new combinatorial operations on skew semistandard domino tableaux, which together with constructions introduced earlier by C. Carre and B. Leclerc, define an elegant structure on the set of these tableaux, that closely…

Young's lattice, the lattice of all Young diagrams, has the Robinson-Schensted-Knuth correspondence, the correspondence between certain matrices and pairs of semi-standard Young tableaux with the same shape. Fomin introduced generalized…

In [BF12] the authors associated to a knot K an invariant n_R(K) which is defined using the Blanchfield form and which gives a lower bound on the unknotting number. In this paper we express n_R(K) in terms of Levine-Tristram signatures and…