Related papers: Wreath Macdonald polynomials, a survey

We consider potential theory on Bratteli diagrams arising from Macdonald polynomials. The case of Hall-Littlewood polynomials is particularly interesting; the elements of the diagram are partitions, the branching multiplicities are…

In this work we study the relationship between several combinatorial formulas for type $A$ spherical Whittaker functions. These are spherical functions on $p$-adic groups, which arise in the theory of automorphic forms. They depend on a…

There are representations of the type-A Hecke algebra on spaces of polynomials in anti-commuting variables. Luque and the author [S\'em. Lothar. Combin. 66 (2012), Art. B66b, 68 pages, arXiv:1106.0875] constructed nonsymmetric Macdonald…

We construct type A partially-symmetric Macdonald polynomials $P_{(\lambda \mid \gamma)}$, where $\lambda \in \mathbb{Z}_{\geq 0}^{n-k}$ is a partition and $\gamma \in \mathbb{Z}_{\geq 0}^k$ is a composition. These are polynomials which are…

We introduce a family of polynomials, which arise in three distinct ways: in the large $N$ expansion of a matrix integral, as a weighted enumeration of factorisations of permutations, and via the topological recursion. More explicitly, we…

We establish a previously conjectured connection between $p$-adics and quantum groups. We find in Sklyanin's two parameter elliptic quantum algebra and its generalizations, the conceptual basis for the Macdonald polynomials, which…

We give an explicit raising operator formula for the modified Macdonald polynomials $\tilde{H}_{\mu }(X;q,t)$, which follows from our recent formula for $\nabla$ on an LLT polynomial and the Haglund-Haiman-Loehr formula expressing modified…

String diagrams turn algebraic equations into topological moves that have recurring shapes, involving the sliding of one diagram past another. We individuate, at the root of this fact, the dual nature of polygraphs as presentations of…

The goal of this paper is to lay the foundations for a combinatorial study, via orthogonal functions and intertwining operators, of category O for the rational Cherednik algebra of type G(r,p,n). As a first application, we give a…

The cyclic sieving phenomenon of Reiner, Stanton, and White says that we can often count the fixed points of elements of a cyclic group acting on a combinatorial set by plugging roots of unity into a polynomial related to this set. One of…

This work records the details of the Ram-Yip formula for nonsymmetric Macdonald-Koornwinder polynomials for the double affine Hecke algebras of not-necessarily-reduced affine root systems. It is shown that the t=0 equal-parameter…

For an almost split Kac-Moody group G over a local non-archimedean field, the last two authors constructed a spherical Hecke algebra H (over the complex numbers C, say) and its Satake isomorphism with the commutative algebra of Weyl…

We give an algebraic construction of shift operators for the non-symmetric Heckman-Opdam polynomials and the non-symmetric Macdonald-Koornwinder polynomials. To each linear character of the finite Weyl group, we associate forward and…

In a preceding paper the theory of nonsymmetric Macdonald polynomials taking values in modules of the Hecke algebra of type $A$ (Dunkl and Luque SLC 2012) was applied to such modules consisting of polynomials in anti-commuting variables, to…

Multisymplectic geometry - which originates from the well known de Donder-Weyl theory - is a natural framework for the study of classical field theories. Recently, two algebraic structures have been put forward to encode a given theory…

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 develop basic constructions of the Baxter operator formalism for the Macdonald polynomials associated with root systems of type A. Precisely we construct a dual pair of mutually commuting Baxter operators such that the Macdonald…

Symmetric functions provide one of the most efficient tools for combinatorial enumeration, in the context of objects that may be acted upon by permutations. Only assuming a basic knowledge of linear algebra, we introduce and describe the…

In the present paper we derive complicated families of orthogonal polynomials in one variable from scratch using the known ones as building blocks. We recall the basics of operational formalism and introduce the notations we use throughout…

We present a new, explicit sum formula for symmetric Macdonald polynomials $P_\lambda$ and show that they can be written as a trace over a product of (infinite dimensional) matrices. These matrices satisfy the Zamolodchikov--Faddeev (ZF)…