arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1209.0938math.CO
收藏

塔台

Tower Tableaux

Olcay Coşkun, Müge Taşkın

摘要:

我们引入了一个新的组合对象称为塔图,并证明了这些对象的基本属性。我们还介绍了一种算法,使我们能够滑动的话塔图。我们表明,该算法是定义良好的,只减少的话,使该算法的测试reductionality。利用该算法,得到了塔图与有限置换之间的一个双射,并证明了该双射是塔图的某些标号与相应置换的约化表达式之间的一个双射.

英文摘要:

We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only for reduced words which makes the algorithm a test for reducibility. Using the algorithm, a bijection between tower diagrams and finite permutations is obtained and it is shown that this bijection specializes to a bijection between certain labellings of a given tower diagram and reduced expressions of the corresponding permutation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑