𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Chebysheff recursion formula for Coxeter polynomials

✍ Scribed by Helmut Lenzing; José A. de la Peña

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
215 KB
Volume
430
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recursion and Explicit Formulas for Part
Recursion and Explicit Formulas for Particular N-Variable Knop–Sahi and Macdonald Polynomials
✍ Jennifer Morse 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Knop and Sahi simultaneously introduced a family of non-homogeneous, non-symmetric polynomials, G : (x; q, t). The top homogeneous components of these polynomials are the non-symmetric Macdonald polynomials, E : (x; q, t). An appropriate Hecke algebra symmetrization of E : yields the Macdonald polyn

A Combinatorial Proof of a Recursion for
A Combinatorial Proof of a Recursion for the q-Kostka Polynomials
✍ Kendra Killpatrick 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 196 KB

The Kostka numbers K \* + play an important role in symmetric function theory, representation theory, combinatorics and invariant theory. The q-Kostka polynomials K \* + (q) are the q-analogues of the Kostka numbers and generalize and extend the mathematical meaning of the Kostka numbers. Lascoux an