论文标题
具有三个发电机的语法单体
Grammic monoids with three generators
论文作者
论文摘要
年轻的Tableaux是组合物体，可以从有限的字母或列插入的有限字母上实现其结构，如六十年前所示。最近，艾布拉姆（Abram）和路透社（Reutenauer）通过稍微调整插入算法来研究一组柱子上的自由基体。由于列的数量是有限的，因此该动作产生有限的转换单体。在这里，我们考虑行对行的动作。在3个字母字母的情况下，我们调查了这种无限的单体。特别是，我们表明，这是自由基相对于经典诺斯规则产生的一致性以及独特的额外规则的商。
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 the free monoid on the set of columns by slightly adapting the 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 this 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.
