We provide a simple combinatorial proof of, and generalize, a theorem of Polo which asserts that for any polynomial P with nonnegative integer coefficients 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 Pu,v.
F. Caselli (2004). A simple combinatorial proof of a generalization of a result of Polo Author: F. Caselli Representation Theory 8 (2004), 479-486. REPRESENTATION THEORY, 8, 479-486.
A simple combinatorial proof of a generalization of a result of Polo Author: F. Caselli Representation Theory 8 (2004), 479-486
CASELLI, FABRIZIO
2004
Abstract
We provide a simple combinatorial proof of, and generalize, a theorem of Polo which asserts that for any polynomial P with nonnegative integer coefficients 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 Pu,v.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
