Automata and cells in affine Weyl groups

Simple item page
dc.creatorGunnells, Paul E.
dc.date2008-07-15
dc.date2008-09-05
dc.date.accessioned2026-07-07T10:00:34Z
dc.date.available2026-07-07T10:00:34Z
dc.descriptionLet 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.
dc.descriptionfixed typos
dc.identifierhttps://arxiv.org/abs/0807.2463
dc.identifierhttp://arxiv.org/abs/0807.2463
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/168356
dc.subjectGroup Theory
dc.subjectRepresentation Theory
dc.subject20F10, 20F55
dc.titleAutomata and cells in affine Weyl groups
dc.typetext

Files

Collections

arXiv