A Timed Version of the Plactic Monoid
Combinatorics
2019-05-17 v2 Discrete Mathematics
Representation Theory
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.
Cite
@article{arxiv.1806.04393,
title = {A Timed Version of the Plactic Monoid},
author = {Amritanshu Prasad},
journal= {arXiv preprint arXiv:1806.04393},
year = {2019}
}
Comments
18 pages, revised