Knuth's Moves on Timed Words
classification
🧮 math.CO
cs.DM
keywords
generalizationknuthresultsschenstedtimedwordsalgorithmalphabet
read the original abstract
We give an exposition of Schensted's algorithm to find the length of the longest increasing subword of a word in an ordered alphabet, and Greene's generalization of Schensted's results using Knuth equivalence. We announce a generalization of these results to timed words.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.