A Timed Version of the Plactic Monoid
classification
🧮 math.CO
cs.DMmath.RT
keywords
timedwordsmonoidplacticalgorithmsalphabetcomecorrespondence
read the original abstract
Timed words are words where letters of the alphabet come with time stamps. We extend the definitions of semistandard tableaux, insertion, Knuth equivalence, and the plactic monoid to the setting of timed words. Using this, Greene's theorem is formulated and proved for timed words, and algorithms for the RSK correspondence are extended to real matrices.
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.