The Robinson–Schensted algorithm
| dc.bibliographicCitation.seriesTitle | Snapshots of Modern Mathematics from Oberwolfach | eng |
| dc.bibliographicCitation.volume | 2/2022 | |
| dc.contributor.author | Thomas, Hugh | |
| dc.date.accessioned | 2022-08-05T08:11:38Z | |
| dc.date.available | 2022-08-05T08:11:38Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | I am going to describe the Robinson–Schensted algorithm which transforms a permutation of the numbers from 1 to n into a pair of combinatorial objects called “standard Young tableaux”. I will then say a little bit about a few of the fascinating properties of this transformation, and how it connects to current research. | eng |
| dc.description.version | publishedVersion | eng |
| dc.identifier.uri | https://oa.tib.eu/renate/handle/123456789/9946 | |
| dc.identifier.uri | http://dx.doi.org/10.34657/8984 | |
| dc.language.iso | eng | |
| dc.publisher | Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach gGmbH | |
| dc.relation.doi | https://doi.org/10.14760/SNAP-2022-002-EN | |
| dc.relation.essn | 2626-1995 | |
| dc.rights.license | CC BY-SA 4.0 Unported | eng |
| dc.rights.uri | https://creativecommons.org/licenses/by-sa/4.0/ | eng |
| dc.subject.ddc | 510 | |
| dc.subject.other | Algebra and Number Theory | eng |
| dc.subject.other | Discrete Mathematics and Foundations | eng |
| dc.title | The Robinson–Schensted algorithm | eng |
| dc.type | Report | eng |
| dc.type | Text | eng |
| dcterms.extent | 7 S. | |
| tib.accessRights | openAccess | |
| wgl.contributor | MFO | |
| wgl.subject | Mathematik | |
| wgl.type | Report / Forschungsbericht / Arbeitspapier |
Files
Original bundle
1 - 1 of 1