scientific article
From MaRDI portal
Publication:2751975
zbMath0982.05105arXivmath/9912094MaRDI QIDQ2751975
Publication date: 29 March 2002
Full work available at URL: https://arxiv.org/abs/math/9912094
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schur function\(q\)-Catalan numberKostant partition functionKostka polynomialgeneralized \(q\)-Gaussian polynomialLiskova semigroupMacMahon, Gelfand-Tsetlin and Chan-Robbins polytopes
Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10)
Related Items (24)
A vector partition function for the multiplicities of \(\mathfrak{sl}_k\mathbb C\) ⋮ Effective lattice point counting in rational convex polytopes ⋮ \(h\)-polynomials via reduced forms ⋮ A monoid of Kostka-Foulkes polynomials ⋮ Spin Kostka polynomials and vertex operators ⋮ On some quadratic algebras. I \(\frac{1}{2}\): Combinatorics of Dunkl and Gaudin elements, Schubert, Grothendieck, Fuss-Catalan, universal Tutte and reduced polynomials ⋮ Kirillov's unimodality conjecture for the rectangular Narayana polynomials ⋮ \(Q\)-Kostka polynomials and spin Green polynomials ⋮ Root cones and the resonance arrangement ⋮ Modified Macdonald polynomials and integrability ⋮ Restricted Birkhoff polytopes and Ehrhart period collapse ⋮ An iterative formula for the Kostka-Foulkes polynomials ⋮ Distributions defined by \(q\)-supernomials, fusion products, and Demazure modules ⋮ Fermionic characters and arbitrary highest-weight integrable \({\widehat{\mathfrak{sl}}}_{r+1}\)-modules ⋮ Crystals, semistandard tableaux and cyclic sieving phenomenon ⋮ A generalization of the Kostka-Foulkes polynomials ⋮ Zig-zag Eulerian polynomials ⋮ $h$-Polynomials of Reduction Trees ⋮ Counting integer points of flow polytopes ⋮ \(K\)-matrices for 2D conformal field theories ⋮ Product formulas for volumes of flow polytopes ⋮ Interacting systems and wormholes ⋮ Rigged configurations and unimodality ⋮ Derangement characters of the finite general linear group.
This page was built for publication: