Kazhdan-Lusztig polynomials for maximally-clustered hexagon-avoiding permutations.
From MaRDI portal
Publication:2655025
DOI10.1016/j.jalgebra.2009.09.003zbMath1210.20007arXiv0704.3067MaRDI QIDQ2655025
Publication date: 22 January 2010
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0704.3067
Hecke algebras; Kazhdan-Lusztig bases; Kazhdan-Lusztig polynomials; pattern avoidance; 321-hexagon; hexagon-avoiding permutations; maximally clustered permutations
05A15: Exact enumeration problems, generating functions
05A05: Permutations, words, matrices
20C08: Hecke algebras and their representations
20F55: Reflection and Coxeter groups (group-theoretic aspects)
Related Items
The enumeration of maximally clustered permutations, On inversion triples and braid moves, Kazhdan-Lusztig polynomials of Boolean elements
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The enumeration of maximally clustered permutations
- A combinatorial setting for questions in Kazhdan-Lusztig theory
- Kazhdan-Lusztig conjecture and holonomic systems
- Representations of Coxeter groups and Hecke algebras
- Some combinatorial properties of Schubert polynomials
- Schubert varieties and short braidedness
- The enumeration of fully commutative elements of Coxeter groups
- On rank functions for heaps
- Freely braided elements in Coxeter groups.
- On the fully commutative elements of Coxeter groups
- Acyclic heaps of pieces. I.
- Freely braided elements in Coxeter groups. II.
- The intersection cohomology of Schubert varieties is a combinatorial invariant
- Maximally clustered elements and Schubert varieties.
- Embedded factor patterns for Deodhar elements in Kazhdan-Lusztig theory.
- Reduced decompositions and permutation patterns
- Combinatorial problems of commutation and rearrangements
- Combinatorics of Coxeter Groups
- ACYCLIC HEAPS OF PIECES, II
- Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations