A Timed Version of the Plactic Monoid

06/12/2018
by   Amritanshu Prasad, et al.
0

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.

READ FULL TEXT
research
07/20/2022

Abelian Combinatorics on Words: a Survey

We survey known results and open problems in abelian combinatorics on wo...
research
11/06/2018

Knuth's Moves on Timed Words

We give an exposition of Schensted's algorithm to find the length of the...
research
07/29/2021

Mesosome Avoidance

We consider avoiding mesosomes – that is, words of the form xx' with x' ...
research
05/24/2022

A Free Group of Rotations of Rank 2

One of the key steps in the proof of the Banach-Tarski Theorem is the in...
research
02/15/2022

The pseudofinite monadic second order theory of words

We analyse the pseudofinite monadic second order theory of words over a ...
research
09/23/2017

A new indexed approach to render the attractors of Kleinian groups

One widespread procedure to render the attractor of Kleinian groups, pub...
research
06/21/2020

Lyric Video Analysis Using Text Detection and Tracking

We attempt to recognize and track lyric words in lyric videos. Lyric vid...

Please sign up or login with your details

Forgot password? Click here to reset