Related papers: Matrix product formula for Macdonald polynomials
The exact solution of the asymmetric exclusion problem and several of its generalizations is obtained by a matrix product {\it ansatz}. Due to the similarity of the master equation and the Schr\"odinger equation at imaginary times the…
A simple matrix formulation of the Fibonacci, Lucas, Chebyshev, and Dixon polynomials polynomials is presented. It utilizes the powers and the symmetric tensor powers of a certain matrix.
The super-Macdonald polynomials, introduced by Sergeev and Veselov, generalise the Macdonald polynomials to (arbitrary numbers of) two kinds of variables, and they are eigenfunctions of the deformed Macdonald-Ruijsenaars operators…
We introduce a canonical operator-theoretic construction associated to a finite geometric lattice, in which a simple nonassociative ``diamond product'' on the lattice basis gives rise to a family of creation operators indexed by atoms and a…
We present a method to compute the full non-linear deformations of matrix factorizations for ADE minimal models. This method is based on the calculation of higher products in the cohomology, called Massey products. The algorithm yields a…
We establish a connection between a specialization of the nonsymmetric Macdonald polynomials and the Demazure characters of the corresponding affine Kac-Moody algebra. This allows us to obtain a representation-theoretical interpretation of…
We give an explicit formula for the exchange matrix correponding to the tensor product of two copies of the natural (standard) evaluation representation of the quantum group associated to the affine Lie algebra of sl(n+1). Then we calculate…
Singular nonsymmetric Macdonald polynomials are constructed by use of the representation theory of the Hecke algebras of the symmetric groups. These polynomials are labeled by quasistaircase partitions and are associated to special…
We give degree formulas for Grothendieck polynomials indexed by vexillary permutations and $1432$-avoiding permutations via tableau combinatorics. These formulas generalize a formula for degrees of symmetric Grothendieck polynomials which…
Very recently we have shown that the spherical transform is a convenient tool for studying the relation between the joint density of the singular values and that of the eigenvalues for bi-unitarily invariant random matrices. In the present…
In this paper we prove that certain matrix elements of vertex operators of deformed W-algebra satisfy Macdonald difference equations and form n! -dimensional space of solutions. These solutions are the analogues of Harish Chandra solutions…
We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…
This article gives a natural decomposition of the suspension of generalized moment-angle complexes or {\it partial product spaces} which arise as {\it polyhedral product functors} described below. In the special case of the complements of…
We present explicit Pieri formulas for Macdonald's spherical functions (or generalized Hall-Littlewood polynomials associated with root systems) and their $q$-deformation the Macdonald polynomials. For the root systems of type $A$, our…
We generalize multivariate hook product formulae for $P$-partitions. We use Macdonald symmetric functions to prove a $(q,t)$-deformation of Gansner's hook product formula for the generating functions of reverse (shifted) plane partitions.…
We give a direct proof of the combinatorial formula for interpolation Macdonald polynomials by introducing certain polynomials, which we call generic Macdonald polynomials, which depend on $d$ additional parameters and specialize to all…
Macdonald symmetric polynomial at $t=q^{-m}$ reduces to a sum of much simpler complementary non-symmetric polynomials, which satisfy a simple system of the first order linear difference equations with constant coefficients, much simpler…
The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…
In this note we develop a systematic combinatorial definition for constructed earlier supersymmetric polynomial families. These polynomial families generalize canonical Schur, Jack and Macdonald families so that the new polynomials depend…
Wreath Macdonald polynomials arise from the geometry of $\Gamma$-fixed loci of Hilbert schemes of points in the plane, where $\Gamma$ is a finite cyclic group of order $r\ge 1$. For $r=1$, they recover the classical (modified) Macdonald…