| Display title | Robinson–Schensted–Knuth correspondence |
| Default sort key | Robinson-Schensted-Knuth Correspondence |
| Page length (in bytes) | 13,941 |
| Namespace ID | 0 |
| Page ID | 207616 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>JTerm |
| Date of page creation | 15:13, 6 February 2024 |
| Latest editor | imported>JTerm |
| Date of latest edit | 15:13, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In mathematics, the Robinson–Schensted–Knuth correspondence, also referred to as the RSK correspondence or RSK algorithm, is a combinatorial bijection between matrices A with non-negative integer entries and pairs (P,Q) of semistandard Young tableaux of equal shape, whose size equals the sum of the entries... |
