Article
Automata and cells in affine Weyl groups
Representation Theory
Publication Date
2010
Abstract
Let be an affine Weyl group, and let be a left, right, or two-sided Kazhdan-Lusztig cell in . Let be the set of all reduced expressions of elements of , regarded as a formal language in the sense of the theory of computation. We show that is a regular language. Hence, the reduced expressions of the elements in any Kazhdan-Lusztig cell can be enumerated by a finite state automaton.
Disciplines
Pages
627-644
Citation Information
PE Gunnells. "Automata and cells in affine Weyl groups" Representation Theory Vol. 14 (2010) Available at: http://works.bepress.com/paul_gunnells/21/
This is the pre-published version harvested from ArXiv. The published version is located at http://www.ams.org/journals/ert/2010-14-17/S1088-4165-2010-00391-X/home.html