English
Related papers

Related papers: A combinatorial formula for Macdonald polynomials

200 papers

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…

Mathematical Physics · Physics 2013-07-04 O. Blondeau-Fournier , P. Desrosiers , L. Lapointe , P. Mathieu

We present a new combinatorial formula for Hall-Littlewood functions associated with the affine root system of type $\tilde A_{n-1}$, i.e. corresponding to the affine Lie algebra $\hat{\mathfrak{sl}}_n$. Our formula has the form of a sum…

Combinatorics · Mathematics 2016-07-12 Boris Feigin , Igor Makhlin

We generalize the generating formula for plane partitions known as MacMahon's formula as well as its analog for strict plane partitions. We give a 2-parameter generalization of these formulas related to Macdonald's symmetric functions. The…

Combinatorics · Mathematics 2009-03-11 Mirjana Vuletić

Multiline queues are versatile combinatorial objects that play a key role in understanding the remarkable connection between the asymmetric simple exclusion process (ASEP) on a circle and Macdonald polynomials. Specializing the results of…

Combinatorics · Mathematics 2025-09-05 Olya Mandelshtam , Jerónimo Valencia-Porras

Let k be an algebraically closed field of characteristic p>0. We compute the Weyl filtration multiplicities in indecomposable tilting modules and the decomposition numbers for the general linear group over k in terms of cap diagrams under…

Representation Theory · Mathematics 2023-01-09 Rudolf Tange

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…

Representation Theory · Mathematics 2011-09-16 J. F. van Diejen , E. Emsiz

The Knop-Sahi interpolation Macdonald polynomials are inhomogeneous and nonsymmetric generalisations of the well-known Macdonald polynomials. In this paper we apply the interpolation Macdonald polynomials to study a new type of basic…

Classical Analysis and ODEs · Mathematics 2009-12-09 Alain Lascoux , Eric M. Rains , S. Ole Warnaar

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…

Combinatorics · Mathematics 2022-12-05 Jenna Rajchgot , Colleen Robichaux , Anna Weigandt

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…

Combinatorics · Mathematics 2023-08-24 Daniel Orr , Mark Shimozono

We give an explicit formula for the Hankel transform of a regular sequence in terms of the coefficients of the associated orthogonal polynomials and the sequence itself. We apply this formula to some sequences of combinatorial interest,…

Combinatorics · Mathematics 2011-03-31 Paul Barry

We express the integral form Macdonald polynomials as a weighted sum of Shareshian and Wachs' chromatic quasisymmetric functions of certain graphs. Then we use known expansions of these chromatic quasisymmetric functions into Schur and…

Combinatorics · Mathematics 2018-03-26 James Haglund , Andrew Timothy Wilson

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…

High Energy Physics - Theory · Physics 2024-10-25 Dmitry Galakhov , Alexei Morozov , Nikita Tselousov

We prove that supports of non-symmetric Macdonald polynomials are $M$-convex. As a consequence, we resolve a 2019 conjecture of Monical, Tokcan, and Yong that they have the saturated Newton polytope property. As a corollary we show that…

Combinatorics · Mathematics 2026-03-24 Milo Bechtloff Weising , Alexander E. Black

This paper defines and investigates nonsymmetric Macdonald polynomials with values in an irreducible module of the Hecke algebra of type $A_{N-1}$. These polynomials appear as simultaneous eigenfunctions of Cherednik operators. Several…

Combinatorics · Mathematics 2011-06-07 C. F. Dunkl , J. -G. Luque

We consider multiple orthogonal polynomials corresponding to two Macdonald functions (modified Bessel functions of the second kind), with emphasis on the polynomials on the diagonal of the Hermite-Pad\'e table. We give some properties of…

Classical Analysis and ODEs · Mathematics 2013-10-16 W. Van Assche , S. B. Yakubovich

In this paper we prove a new combinatorial formula for the modified Macdonald polynomials $\widetilde{H}_\lambda(X;q,t)$, motivated by connections to the theory of interacting particle systems from statistical mechanics. The formula…

Combinatorics · Mathematics 2023-02-28 Arvind Ayyer , Olya Mandelshtam , James B. Martin

In this paper, we introduce higher rank generalizations of Macdonald polynomials. The higher rank non-symmetric Macdonald polynomials are Laurent polynomials in several sets of variables which form weight bases for higher rank polynomial…

Combinatorics · Mathematics 2025-02-18 Milo Bechtloff Weising

We present an explicit branching formula for the six-parameter Macdonald-Koornwinder polynomials with hyperoctahedral symmetry.

Combinatorics · Mathematics 2015-10-12 J. F. van Diejen , E. Emsiz

Let $G$ be an almost simple simply connected complex Lie group, and let $G/U_-$ be its base affine space. In this paper we formulate a conjecture, which provides a new geometric interpretation of the Macdonald polynomials associated to $G$…

Algebraic Geometry · Mathematics 2013-11-05 Alexander Braverman , Michael Finkelberg , Jun'ichi Shiraishi

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…

Combinatorics · Mathematics 2007-05-23 Jason Fulman
‹ Prev 1 4 5 6 7 8 10 Next ›