Skip to Main Content

Representation Theory

Published by the American Mathematical Society since 1997, this electronic-only journal is devoted to research in representation theory and seeks to maintain a high standard for exposition as well as for mathematical content. All articles are freely available to all readers and with no publishing fees for authors.

ISSN 1088-4165

The 2020 MCQ for Representation Theory is 0.71.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


Automata and cells in affine Weyl groups
HTML articles powered by AMS MathViewer

by Paul E. Gunnells
Represent. Theory 14 (2010), 627-644
Published electronically: October 1, 2010


Let $\widetilde {W}$ be an affine Weyl group, and let $C$ be a left, right, or two-sided Kazhdan–Lusztig cell in $\widetilde {W}$. Let $\mathtt {Red}(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 $\mathtt {Red}(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.
Similar Articles
  • Retrieve articles in Representation Theory of the American Mathematical Society with MSC (2010): 20F10, 20F55
  • Retrieve articles in all journals with MSC (2010): 20F10, 20F55
Bibliographic Information
  • Paul E. Gunnells
  • Affiliation: Department of Mathematics and Statistics, University of Massachusetts, Amherst, Massachusetts 01003
  • Email:
  • Received by editor(s): September 5, 2008
  • Received by editor(s) in revised form: July 27, 2009
  • Published electronically: October 1, 2010
  • © Copyright 2010 American Mathematical Society
  • Journal: Represent. Theory 14 (2010), 627-644
  • MSC (2010): Primary 20F10, 20F55
  • DOI:
  • MathSciNet review: 2726285