Knuth's Moves on Timed Words
arXiv:1811.02169
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 article is based on the text of the 28th Srinivasa Ramanujan Memorial Award Lecture delivered at the 83rd Annual Conference of the Indian Mathematical Society - An international Meet held at Sri Venkateswara University, Tirupati - 517 502, Andhra Pradesh, India during December 12 - 15, 2017