✦ LIBER ✦

Combinatorial Proofs of q-Series Identities

✍ Scribed by Robin Chapman

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 138 KB
Volume: 99
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.2002.3251

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Quick Combinatorial Proof of Eisenstei

A Quick Combinatorial Proof of Eisenstein Series Identities

✍ N.P. Skoruppa 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 222 KB

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

Three Alternating Sign Matrix Identities

Three Alternating Sign Matrix Identities in Search of Bijective Proofs

✍ David M. Bressoud 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 121 KB

This paper highlights three known identities, each of which involves sums over alternating sign matrices. While proofs of all three are known, the only known derivations are as corollaries of difficult results. The simplicity and natural combinatorial interpretation of these identities, however, sug

Combinatorial sums, identities and trace

Combinatorial sums, identities and trace identities of the 2 × 2 matrices

✍ Amitai Regev 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 393 KB

Bialgebras of Recursive Sequences and Co

Bialgebras of Recursive Sequences and Combinatorial Identities

✍ Carl A. Futia; Eric F. Müller; Earl J. Taft 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 194 KB

A recursive sequence is an infinite sequence of elements of some fixed ground field which satisfies a recursion relation of finite order. We shall investigate certain bialgebra structures on linear spaces of recursive sequences. By choosing appropriate bases for these bialgebras we show how an expli

Hook–Schur Functions Analogues of Little

Hook–Schur Functions Analogues of Littlewood's Identities and their Bijective Proofs

✍ M. Yang; J.B. Remmel 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 233 KB

We give bijective proofs of the Hook-Schur function analogues of two well-known identities of Littlewood. In the course of our proof, we propose a new correspondence which can be considered as a generalization of the Burge correspondences used in proving the Littlewood identities.