Enumerative and combinatorial properties of Dyck partitions

DOI10.1006/jcta.2002.3255zbMath1017.05018OpenAlexW2016854070MaRDI QIDQ1865370

Francesco Brenti

Publication date: 26 March 2003

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/26c6e317526d382ed7d65f7303b9c11038ddda4f

zbMATH Keywords

partitionDyck pathlattice pathKazhdan-Lusztig polynomial

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

Related Items (2)

Enumerative properties of shifted-Dyck partitions ⋮ Kazhdan-Lusztig polynomials, tight quotients and Dyck superpartitions.

Cites Work

• On some geometric aspects of Bruhat orderings. II: The parabolic analogue of Kazhdan-Lusztig polynomials
• Representations of Coxeter groups and Hecke algebras
• Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)
• Kazhdan-Lusztig and \(R\)-polynomials, Young's lattice, and Dyck partitions.
• Affine permutations of type \(A\)
• Critical exponents from nonlinear functional equations for partially directed cluster models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumerative and combinatorial properties of Dyck partitions