Abstract
Young tableaux are combinatorial objects whose construction can be achieved from words over a finite alphabet by row or column insertion as shown by Schensted sixty years ago. Recently Abram and Reutenauer studied the action of the free monoid on the set of columns defined by the famous insertion algorithm. Since the number of columns is finite, this action yields a finite transformation monoid. Here we consider the action on the set of rows. We investigate the corresponding infinite monoid in the case of a 3 letter alphabet. In particular we show that it is the quotient of the free monoid relative to a congruence generated by the classical Knuth rules plus a unique extra rule.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
