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

Coxeter群中约化表达式的一些组合模型

Some combinatorial models for reduced expressions in Coxeter groups

Hugh Denoncourt

摘要:

斯坦利的公式的数量减少表达式的置换视为一个Coxeter群元素提出了一个问题,如何枚举减少表达式的任意Coxeter群元素。我们提供了一个框架来回答这个问题,通过构建组合对象,表示反演集和减少表达式的任意Coxeter群元素。该框架还提供了一个公式的长度所形成的一个元素,通过删除一个生成元从考克斯特群元素。Fan和Hagiwara等人$.$证明了对于某些Coxeter群,当从约化表达式中删除任何生成元时,避免短辫的元素表征了给出约化表达式的元素。我们提供了一个特征,在所有Coxeter群。最后,我们给自由编织的Green和Losonczy介绍的元素的应用程序,推广他们的一些结果,持有简单的花边Coxeter群的任意Coxeter群设置。

英文摘要:

Stanley's formula for the number of reduced expressions of a permutation regarded as a Coxeter group element raises the question of how to enumerate the reduced expressions of an arbitrary Coxeter group element. We provide a framework for answering this question by constructing combinatorial objects that represent the inversion set and the reduced expressions for an arbitrary Coxeter group element. The framework also provides a formula for the length of an element formed by deleting a generator from a Coxeter group element. Fan and Hagiwara, et al$.$ showed that for certain Coxeter groups, the short-braid avoiding elements characterize those elements that give reduced expressions when any generator is deleted from a reduced expression. We provide a characterization that holds in all Coxeter groups. Lastly, we give applications to the freely braided elements introduced by Green and Losonczy, generalizing some of their results that hold in simply-laced Coxeter groups to the arbitrary Coxeter group setting.

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

↑