Skip to search formSkip to main contentSkip to account menu

Robinson–Schensted–Knuth correspondence

Known as: Robinson-Schensted-Knuth correspondence, RSK algorithm, Robinson–Schensted–Knuth algorithm 
In mathematics, the Robinson–Schensted–Knuth correspondence, also referred to as the RSK correspondence or RSK algorithm, is a combinatorial… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Robinson-Schensted-Knuth (RSK) correspondence occurs in different contexts of algebra and combinatorics. Recently, this topic has… 
2018
2018
In this thesis, we study the representation theory of Lie colour algebras. Our strategy follows the work of G. Benkart, C. L… 
2017
2017
This paper is concerned with finding a combinatorial Schur expansion of the modified Macdonald polynomials. We will use the… 
2015
2015
Since it was originally defined by Schensted [19] in 1961 to study increasing and decreasing subsequences of permutations, the… 
2014
2014
Tese de doutoramento do Programa Inter-Universitario de Doutoramento em Matematica apresentada ao Departamento de Matematica da… 
2010
2010
In this paper we generalize to the case of partial flags a result proved both by Spaltenstein and by Steinberg that relates the… 
2010
2010
A proof-of-concept, pilot clinical trial was carried out in 2 hospitals, to evaluate the safety of recombinant streptokinase (rSK… 
2009
2009
Motivated by the longest increasing subsequence problem, we examine sundry topics at the interface of enumerative/algebraic… 
2007
2007
Fomin (1994) introduced a notion of duality between two graded graphs on the same set of vertices. He also introduced a… 
1998
1998
The Robinson-Schensted-Knuth correspondence (RSK, see [8] and Corollary 2.5 below) is a bijection between pairs of semi-standard…