arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.08673math.COmath.RT
收藏

关于核心双重陪集的既约表达式

On reduced expressions for core double cosets

Ben Elias, Hankyung Ko, Nicolas Libedinsky, Leonardo Patimo

AI总结:

本文定义了原子陪集,证明核心陪集可由其复合构成既约表达式,从而为任意陪集提供算法构造,并在类型A和B中揭示其与较小群普通表达式的组合一致性。

摘要:

Williamson 引入了 Coxeter 群中双重陪集的既约表达式概念,Elias 和 Ko 近期的工作使该理论更易于理解且更具组合性。Elias-Ko 的一个结论是:任何陪集都存在既约表达式,该表达式可分解为通过其相关陪集(称为 core)的既约表达式。本文定义了一类称为 atomic cosets 的陪集,并证明每个 core coset 都存在作为 atomic cosets 复合的既约表达式。这导出了任意陪集既约表达式的算法构造。在类型 $A$ 和 $B$ 中,我们证明了 atomic cosets 复合的组合学与较小群中普通表达式的组合学相匹配。在其他类型中,该组合学是全新的,正如 Ko 在后续工作中所探讨的。

英文摘要:

The notion of a reduced expression for a double coset in a Coxeter group was introduced by Williamson, and recent work of Elias and Ko has made this theory more accessible and combinatorial. One result of Elias-Ko is that any coset admits a reduced expression which factors through a reduced expression for a related coset called its core. In this paper we define a class of cosets called atomic cosets, and prove that every core coset admits a reduced expression as a composition of atomic cosets. This leads to an algorithmic construction of a reduced expression for any coset. In types $A$ and $B$ we prove that the combinatorics of compositions of atomic cosets matches the combinatorics of ordinary expressions in a smaller group. In other types the combinatorics is new, as explored in a sequel by Ko.

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

↑