arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0807.2463math.GRmath.RT

Automata and cells in affine Weyl groups

Paul E. Gunnells

英文摘要:

Let W~ be an affine Weyl group, and let C be a left, right, or two-sided Kazhdan--Lusztig cell in W~. Let Reduced (C) be the set of all reduced expressions of elements of C, regarded as a formal language in the sense of the theory of computation. We show that Reduced (C) is a regular language. Hence the reduced expressions of the elements in any Kazhdan--Lusztig cell can be enumerated by a finite state automaton.

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

↑