(redirected from Robinson-Schensted-Knuth)
RSKRibosomal S6 Kinase
RSKRight Soft Key (handheld electronic devices)
RSKRussian Aircraft Corporation (Russian acronym)
RSKRepublika Srpska Krajina
RSKReaktor-Sicherheitskommission (German: reactor safety commission)
RSKRobinson-Schensted-Knuth (combinatorial algorithm)
RSKRaymond S. Kellis (High School, Glendale, Arizona)
RSKRitter Survival Knife
RSKRealty School of Kansas (Wichita, KS)
RSKRobertson, Smith and Kempson (real estate; UK)
RSKRural Serial Killers (band)
RSKRoof Safety Kit
RSKRepubljik Srpsko Kosovo
References in periodicals archive ?
Remmel [Rem84] introduces an analogue of the Robinson-Schensted-Knuth (RSK) algorithm for (k, l)semistandard tableaux, the objects used to generate (k, l)-hook Schur functions.
In Sections 4 and 5 we introduce an insertion algorithm and use it to provide an analogue of the Robinson-Schensted-Knuth algorithm as well as a generalized Cauchy identity.
Here, a Knuth class is a set of permutations which result in the same insertion tableau when performing the Robinson-Schensted-Knuth (RSK) algorithm.
Factorization of the Robinson-Schensted-Knuth correspondence.
An important outcome of Mason's work is a generalization of the Robinson-Schensted-Knuth (RSK) insertion algorithm for semi-standard augmented fillings that she used to give combinatorial proofs of many results involving Demazure atoms.
Properties of the nonsymmetric Robinson-Schensted-Knuth algorithm.
Semi-skyline augmented fillings also satisfy a variation of the Robinson-Schensted-Knuth algorithm which commutes with the usual RSK and retains its symmetry.
The fundamental operation of the Robinson-Schensted-Knuth (1970) (RSK) algorithm is Schensted insertion which is a procedure for inserting a positive integer k into a SSYT T.
The classical Robinson-Schensted-Knuth (RSK) correspondence gives a bijection between two-line arrays [w.
This insertion process forms the foundation for the well-known Robinson-Schensted-Knuth (RSK) algorithm which produces a bijection between matrices with non-negative integer coefficients and pairs of reverse column-strict tableaux of the same shape.
The computations involve, among others, complex integration and the Robinson-Schensted-Knuth correspondence.
The celebrated Robinson-Schensted-Knuth correspondence (14) is abijection between words in a linearly ordered alphabet X = {1 < 2 < 3 < .