Related papers: Paths and Kostka--Macdonald Polynomials
Two decades ago P. Martin and D. Woodcock made a surprising and prophetic link between statistical mechanics and representation theory. They observed that the decomposition numbers of the blob algebra (that appeared in the context of…
In this paper we establish a Steinberg-Lusztig tensor product theorem for abstract Fock space. This is a generalization of the type A result of Leclerc-Thibon and a Grothendieck group version of the Steinberg-Lusztig tensor product theorem…
We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of…
We report about some results, interesting examples, problems and conjectures revolving around the parabolic Kostant partition functions, the parabolic Kostka polynomials and ``saturation'' properties of several generalizations of the…
The Macdonald polynomials expanded in terms of a modified Schur function basis have coefficients called the $q,t$-Kostka polynomials. We define operators to build standard tableaux and show that they are equivalent to creation operators…
We prove that the combinatorial side of the "Rational Shuffle Conjecture" provides a Schur-positive symmetric polynomial. Furthermore, we prove that the contribution of a given rational Dyck path can be computed as a certain skew LLT…
We give a new characterization of the peak subalgebra of the algebra of quasisymmetric functions and use this to construct a new basis for this subalgebra. As an application of these results we obtain a combinatorial formula for the…
We demonstrate that statistics of certain classes of set partitions is described by generating functions related to the Burgers, Ibragimov--Shabat and Korteweg--de Vries integrable hierarchies.
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…
We develop the theory of weighted P-partitions, which generalises the theory of P-partitions from labelled posets to weighted labelled posets. We define the related generating functions in the natural way and compute their product,…
General statistical ensembles in the Hamiltonian formulation of hybrid quantum-classical systems are analyzed. It is argued that arbitrary probability densities on the hybrid phase space must be considered as the class of possible…
We recast the classical notion of standard tableaux in an alcove-geometric setting and extend these classical ideas to all reduced paths in our geometry. This broader path-perspective is essential for implementing the higher categorical…
We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged as a matrix, where q is a positive integer greater than one. Orthogonality relations are established and coefficients are…
We study a q-generalization of the classical Laguerre/Hermite orthogonal polynomials. Explicit results include: the recursive coefficients, matrix elements of generators for the Heisenberg algebra, and the Hankel determinants. The power of…
Interacting systems of particles with generalized statistics are considered on both classical and quantum level. It is shown that all possible quantum states and corresponding processes can be represented in terms of certain specific…
Littlewood-Richardson (LR) coefficients and Kostka Numbers appear in representation theory and combinatorics related to $GL_n$. It is known that Kostka numbers can be represented as special Littlewood-Rischardson coefficient. In this paper,…
We prove a combinatorial formula for Macdonald cumulants which generalizes the celebrated formula of Haglund for Macdonald polynomials. We provide several applications of our formula. Firstly, it gives a new, constructive proof of a strong…
A recent breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of a pair of statistics on fillings of Young diagrams. The…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
Multiple analogues of certain families of combinatorial numbers are recently constructed by the author in terms of well poised Macdonald functions, and some of their fundamental properties are developed. In this paper, we present…