Related papers: Set-valued tableaux for Macdonald polynomials

Whereas set-valued tableaux are the combinatorial objects associated to stable Grothendieck polynomials, hook-valued tableaux are associated to stable canonical Grothendieck polynomials. In this paper, we define a novel uncrowding algorithm…

In this paper, we derive new combinatorial formulas for symmetric Macdonald polynomials $P_{\lambda}(X;q,t)$ and integral Macdonald polynomials $J_{\lambda}(X;q,t)$, in terms of several new statistics and the major index for a partition…

We definitively establish that the theory of symmetric Macdonald polynomials aligns with quantum and affine Schubert calculus using a discovery that distinguished weak chains can be identified by chains in the strong (Bruhat) order poset on…

In 1996, Knop and Sahi introduced a remarkable family of inhomogeneous symmetric polynomials, defined via vanishing conditions, whose top homogeneous parts are exactly the Macdonald polynomials. Like the Macdonald polynomials, these…

We present a variety of new identities involving operators in the theory of wreath Macdonald polynomials. One such family of identities gives five-term relations, analogous to the one given by Garsia and Mellit for the modified Macdonald…

A generalization of the Macdonald polynomials depending upon both commuting and anticommuting variables has been introduced recently. The construction relies on certain orthogonality and triangularity relations. Although many…

Enriched versions of type A Schubert polynomials are constructed with coefficients in a polynomial ring in variables $c_1, c_2, \ldots$. Specializing these variables to $0$ recovers the double Schubert polynomials of Lascoux and…

We provide new approaches to prove identities for the modified Macdonald polynomials via their LLT expansions. As an application, we prove a conjecture of Haglund concerning the multi-$t$-Macdonald polynomials of two rows.

Set-valued tableaux play an important role in combinatorial $K$-theory. Separately, semistandard skyline fillings are a combinatorial model for Demazure atoms and key polynomials. We unify these two concepts by defining a set-valued…

We discuss the problem of factorisation of the symmetric Macdonald polynomials and present the obtained results for the cases of 2 and 3 variables.

We prove a new tableaux formula for the symmetric Macdonald polynomials $P_{\lambda}(X;q,t)$ that has considerably fewer terms and simpler weights than previously existing formulas. Our formula is a sum over certain sorted non-attacking…

We discuss tableaux for the Implicational Propositional Calculus and show how they may be used to establish its completeness.

We give the explicit analytic development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions. These expansions are obtained by inverting the Pieri formula. Specialization yields similar developments…

We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restricted to the special case of partitions with 2 columns. We…

The two-parameter Macdonald polynomials are a central object of algebraic combinatorics and representation theory. We give a Markov chain on partitions of k with eigenfunctions the coefficients of the Macdonald polynomials when expanded in…

We present conjectures giving formulas for the Macdonald polynomials of type B, C, D which are indexed by a multiple of the first fundamental weight. The transition matrices between two different types are explicitly given.

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…

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. Ram and…

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…

We study an action of the skew divided difference operators on the Schubert polynomials and give an explicit formula for structural constants for the Schubert polynomials in terms of certain weighted paths in the Bruhat order on the…