Abstract
We point out a deep and surprising connection between the Kazhdan-LusztigR-polynomials forSnand the enumeration and combinatorics of increasing subsequences in permutations. This leads to a simple combinatorial recurrence and to several new closed formulas for these polynomials. © 1997 Academic Press.
Cite
CITATION STYLE
APA
Brenti, F. (1997). Combinatorial properties of the Kazhdan-LusztigR-Polynomials forSn. Advances in Mathematics, 126(1), 21–51. https://doi.org/10.1006/aima.1996.1607
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free