In this paper we give a new closed formula for the Kazhdan-Lusztig polynomials of finite Coxeter groups and affine Weyl groups. This formula is computationally more efficient than any existing one, and it conjecturally holds for all Coxeter groups. (c) 2006 Elsevier Inc. All rights reserved.

Brenti, F., & Incitti, F. (2006). Lattice paths, lexicographic correspondence and Kazhdan-Lusztig polynomials. JOURNAL OF ALGEBRA, 303(2), 742-762 [10.1016/j.jalgebra.2005.12.030].

Lattice paths, lexicographic correspondence and Kazhdan-Lusztig polynomials

BRENTI, FRANCESCO;
2006

Abstract

In this paper we give a new closed formula for the Kazhdan-Lusztig polynomials of finite Coxeter groups and affine Weyl groups. This formula is computationally more efficient than any existing one, and it conjecturally holds for all Coxeter groups. (c) 2006 Elsevier Inc. All rights reserved.
Pubblicato
Rilevanza internazionale
Articolo
Sì, ma tipo non specificato
Settore MAT/03 - Geometria
English
Bruhat order; Coxeter group; Kazhdan-Lusztig polynomial; Lattice path; Lexicographic correspondence
Brenti, F., & Incitti, F. (2006). Lattice paths, lexicographic correspondence and Kazhdan-Lusztig polynomials. JOURNAL OF ALGEBRA, 303(2), 742-762 [10.1016/j.jalgebra.2005.12.030].
Brenti, F; Incitti, F
Articolo su rivista
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2108/38025
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 4
social impact