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.


A simple combinatorial proof of a generalization of a result of Polo
HTML articles powered by AMS MathViewer

by Fabrizio Caselli
Represent. Theory 8 (2004), 479-486
Published electronically: November 2, 2004


We provide a simple combinatorial proof of, and generalize, a theorem of Polo which asserts that for any polynomial $P\in \mathbb N[q]$ such that $P(0)=1$ there exist two permutations $u$ and $v$ in a suitable symmetric group such that $P$ is equal to the Kazhdan-Lusztig polynomial $P^{v}_{u}$.
Similar Articles
  • Retrieve articles in Representation Theory of the American Mathematical Society with MSC (2000): 05E15, 20C08
  • Retrieve articles in all journals with MSC (2000): 05E15, 20C08
Bibliographic Information
  • Fabrizio Caselli
  • Affiliation: Università di Roma “La Sapienza”, Dipartimento di matematica “G. Castelnuovo”, P.le A. Moro 3, 00185, Roma, Italy
  • Email: and
  • Received by editor(s): July 30, 2003
  • Received by editor(s) in revised form: March 19, 2004, and July 25, 2004
  • Published electronically: November 2, 2004
  • Additional Notes: The author was partially supported by EC grant HPRN-CT-2002-00272
  • © Copyright 2004 American Mathematical Society
    The copyright for this article reverts to public domain 28 years after publication.
  • Journal: Represent. Theory 8 (2004), 479-486
  • MSC (2000): Primary 05E15, 20C08
  • DOI:
  • MathSciNet review: 2110357