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

减少字enumeration、复杂性和随机化

Reduced word enumeration, complexity, and randomization

Cara Monical, Benjamin Pankow, Alexander Yong

摘要:

置换$w$的简化字是$w$作为简单置换的乘积的最小长度表达式。我们研究的计算复杂性,公式和(随机)算法,其枚举。特别地,我们证明了S.比利湾Pawlowski,通常是指数级的。这意味着B的一个结果。Pawlowski,它有指数增长的期望。我们的结果是通过对A.拉斯科-M P. Schützenberger的转换算法。更一般的问题Hecke字计数,其密切相关的问题,计数集值标准杨tableaux,也进行了研究。后一个计数问题是由M.陈Pflueger和D.安德森湖陈N塔拉斯卡

英文摘要:

A reduced word of a permutation $w$ is a minimal length expression of $w$ as a product of simple transpositions. We examine the computational complexity, formulas and (randomized) algorithms for their enumeration. In particular, we prove that the Edelman-Greene statistic, defined by S. Billey-B. Pawlowski, is typically exponentially large. This implies a result of B. Pawlowski, that it has exponentially growing expectation. Our result is established by a formal run-time analysis of A. Lascoux-M.-P. Schützenberger's transition algorithm. The more general problem of Hecke word enumeration, and its closely related question of counting set-valued standard Young tableaux, is also investigated. The latter enumeration problem is further motivated by work on Brill-Noether varieties due to M. Chan-N. Pflueger and D. Anderson-L. Chen-N. Tarasca.

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

↑