Knuth's Moves on Timed Words
Combinatorics
2018-11-07 v1 Discrete Mathematics
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.
Cite
@article{arxiv.1811.02169,
title = {Knuth's Moves on Timed Words},
author = {Amritanshu Prasad},
journal= {arXiv preprint arXiv:1811.02169},
year = {2018}
}
Comments
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