Francois Descouens, Hideaki Morita
The aim of this note is to give some factorization formulas for different versions of the Macdonald polynomials when the parameter t is specialized at roots of unity, generalizing those existing for Hall-Littlewood functions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We prove a strong factorization property of interpolation Macdonald polynomials when $q$ tends to $1$. As a consequence, we show that Macdonald polynomials have a strong factorization property when $q$ tends to $1$, which was posed as an open question in our previous paper with Féray. Furthermore, we introduce multivariate $q,t$-Kostka numbers and we show that they are polynomials in $q,t$ with integer coefficients by using the strong factorization property of Macdonald polynomials. We conjecture that multivariate $q,t$-Kostka numbers are in fact polynomials in $q,t$ with nonnegative integer c…
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 mainly use the combinatorial interpretation of Haglund, Haiman and Loehr giving the expansion of the modified Macdonald polynomials on the monomial basis.
We find and prove a factorization formula for certain Macdonald Littlewood-Richardson coefficients $c_{λμ}^ν(q,t)$. Namely, we consider the case that the Kostka number $K_{μ, ν-λ}$ is $1$. This settles a particular case of a more general conjecture of Richard Stanely. This conjecture proposes that a factorization formula exists whenever the corresponding regular Littlewood-Richardson coefficient $c^ν_{λμ}$ is $1$.
We prove many factorization formulas for highest weight Macdonald polynomials indexed by particular partitions called quasistaircases. As a consequence we prove a conjecture of Bernevig and Haldane stated in the context of the fractional quantum Hall theory.
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 factorization property of Macdonald polynomials proven recently by the author of this paper. Moreover it proves that Macdonald cumulants are $q,t$--positive in the monomial and in the fundamental quasisymmetric bases. Furthermore, we use our formula to prove the recent higher-order Macdonald positivity conjecture for the coefficients of the Schur polynomials…
We present several new and compact formulas for the modified and integral form of the Macdonald polynomials, building on the compact "multiline queue" formula for Macdonald polynomials due to Corteel, Mandelshtam, and Williams. We also introduce a new quasisymmetric analogue of Macdonald polynomials. These "quasisymmetric Macdonald polynomials" refine the (symmetric) Macdonald polynomials and specialize to the quasisymmetric Schur polynomials defined by Haglund, Luoto, Mason, and van Willigenburg.
We present several new and compact formulas for the modified and integral form of the Macdonald polynomials, building on the compact "multiline queue" formula for Macdonald polynomials due to Corteel, Mandelshtam and Williams. We also introduce a new quasisymmetric analogue of Macdonald polynomials. These quasisymmetric Macdonald polynomials refine the (symmetric) Macdonald polynomials and specialize at $q=t=0$ to the quasisymmetric Schur polynomials defined by Haglund, Luoto, Mason, and van Willigenburg. This is an extended abstract.
Macdonald characters from a new formula for Macdonald polynomials
本文引入了一个新的算子Γ，用于获得Macdonald多项式生成公式，连接了Macdonald算子理论与移位Macdonald多项式，并提出关于广义特征的正性猜想。
We present an explicit branching formula for the six-parameter Macdonald-Koornwinder polynomials with hyperoctahedral symmetry.
Set-valued tableaux formulas play an important role in Schubert calculus. Using the box greedy reduced word for the construction of the Macdonald polynomials, we convert the alcove walk formula for Macdonald polynomials to a set-valued tableaux formula for Macdonald polynomials. Our hope is that providing set-valued tableaux formulas for Macdonald polynomials will help to strengthen the analogies and possible connections between the calculus of Macdonald polynomials and Schubert calculus.
A combinatorial formula for Interpolation Macdonald polynomials
本文给出了插值 Macdonald 多项式的带符号多线队列组合公式，推广了 Macdonald 多项式的多线队列公式。
A raising operator formula for Macdonald polynomials
本文利用LLT多项式上的 $\nabla$ 公式和Haglund-Haiman-Loehr公式，得到修正Macdonald多项式的显式升算子公式，并推广提出 $1,n$-Macdonald多项式及其Schur系数正性猜想。
We present explicit formulas for the Macdonald polynomials of types $C_n$ and $D_n$ in the one-row case. In view of the combinatorial structure, we call them "tableau formulas". For the construction of the tableau formulas, we apply some transformation formulas for the basic hypergeometric series involving very well-poised balanced ${}_{12}W_{11}$ series. We remark that the correlation functions of the deformed $\mathcal{W}$ algebra generators automatically give rise to the tableau formulas when we principally specialize the coordinate variables.
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 power sum symmetric functions to provide Schur and power sum formulas for the integral form Macdonald polynomials. Since the (integral form) Jack polynomials are a specialization of integral form Macdonald polynomials, we obtain analogous formulas for Jack polynomials as corollaries.
We present a fourfold series expansion representing the Askey-Wilson polynomials. To obtain the result, a sequential use is made of several summation and transformation formulas for the basic hypergeometric series, including the Verma's q-extension of the Field and Wimp expansion, Andrews' terminating q-analogue of Watson's 3F2 sum, Singh's quadratic transformation. As an application, we present an explicit formula for the Koornwinder polynomial of type BCn (n in Z_>0) with one row diagram. When the parameters are specialized, we recover Lassalle's formula for Macdonald polynomials of type Bn,…
Jack polynomials generalize several classical families of symmetric polynomials, including Schur polynomials, and are further generalized by Macdonald polynomials. In 1989, Richard Stanley conjectured that if the Littlewood-Richardson coefficient for a triple of Schur polynomials is 1, then the corresponding coefficient for Jack polynomials can be expressed as a product of weighted hooks of the Young diagrams associated to the partitions indexing the coefficient. We prove a special case of this conjecture in which the partitions indexing the Littlewood-Richardson coefficient have at most 3 par…
We give a bijective proof of Macdonald's reduced word identity using pipe dreams and Little's bumping algorithm. This proof extends to a principal specialization due to Fomin and Stanley. Such a proof has been sought for over 20 years. Our bijective tools also allow us to solve a problem posed by Fomin and Kirillov from 1997 using work of Wachs, Lenart, Serrano and Stump. These results extend earlier work by the third author on a Markov process for reduced words of the longest permutation.
We introduce Macdonald polynomials indexed by $n$-tuples of partitions and characterized by certain orthogonality and triangularity relations. We prove that they can be explicitly given as products of ordinary Macdonald polynomials depending on special alphabets. With this factorization in hand, we establish their most basic properties, such as explicit formulas for their norm-squared, evaluation and reproducing kernel. Moreover, we show that the $q,t$-Kostka coefficients associated to the multi-Macdonald polynomials are positive and correspond to $q,t$-analogs of the dimensions of the irreduc…
We give an explicit combinatorial formula for the Schur expansion of Macdonald polynomials indexed by partitions with second part at most two. This gives a uniform formula for both hook and two column partitions. The proof comes as a corollary to the result that generalized dual equivalence classes of permutations are unions of standard dual equivalence classes of permutations for certain cases, establishing an earlier conjecture of the author.
Recently James Martin introduced multiline queues, and used them to give a combinatorial formula for the stationary distribution of the multispecies asymmetric simple exclusion exclusion process (ASEP) on a circle. The ASEP is a model of particles hopping on a one-dimensional lattice, which was introduced around 1970, and has been extensively studied in statistical mechanics, probability, and combinatorics. In this article we give an independent proof of Martin's result, and we show that by introducing additional statistics on multiline queues, we can use them to give a new combinatorial formu…
The clustering properties of Jack polynomials are relevant in the theoretical study of the fractional Hall states. In this context, some factorization properties have been conjectured for the $(q,t)$-deformed problem involving Macdonald polynomials. The present paper is devoted to the proof of this formula. To this aim we use four families of Jack/Macdonald polynomials: symmetric homogeneous, nonsymmetric homogeneous, shifted symmetric and shifted nonsymmetric.
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 Pieri formulas recover the well-known Pieri formulas for the Hall-Littlewood and Macdonald symmetric functions due to Morris and Macdonald as special cases.
We demonstrate the validity of previously conjectured explicit expressions for the norm and the evaluation of the Macdonald polynomials in superspace. These expressions, which involve the arm-lengths and leg-lengths of the cells in certain Young diagrams, specialize to the well known formulas for the norm and the evaluation of the usual Macdonald polynomials.
Macdonald superpolynomials provide a remarkably rich generalization of the usual Macdonald polynomials. The starting point of this work is the observation of a previously unnoticed stability property of the Macdonald superpolynomials when the fermionic sector m is sufficiently large: their decomposition in the monomial basis is then independent of m. These stable superpolynomials are readily mapped into bisymmetric polynomials, an operation that spoils the ring structure but drastically simplifies the associated vector space. Our main result is a factorization of the (stable) bisymmetric Macdo…
This is a paper about $c$-functions and Macdonald polynomials. There are $c$-function formulas for $E$-expansions of $P_λ$ and $A_{λ+ρ}$, principal specializations of $P_λ$ and $E_μ$, for Macdonald's constant term formulas, and for the norms of Macdonald polynomials. Most of these follow from the creation formulas for Macdonald polynomials, providing alternative proofs to several results from Macdonald (2003). In addition, we prove the Boson-Fermion correspondence in the Macdonald polynomial setting and the Weyl character formula for Macdonald polynomials.
We give a combinatorial formula for the non-symmetric Macdonald polynomials E_μ(x;q,t). The formula generalizes our previous combinatorial interpretation of the integral form symmetric Macdonald polynomials J_μ(x;q,t). We prove the new formula by verifying that it satisfies a recurrence, due to Knop, that characterizes the non-symmetric Macdonald polynomials.
In this paper we prove a new combinatorial formula for the modified Macdonald polynomials $\widetilde{H}_λ(X;q,t)$, motivated by connections to the theory of interacting particle systems from statistical mechanics. The formula involves a new statistic called queue inversions on fillings of tableaux. This statistic is closely related to the multiline queues which were recently used to give a formula for the Macdonald polynomials $P_λ(X;q,t)$. In the case $q=1$ and $X=(1,1,\dots,1)$, that formula had also been shown to compute stationary probabilities for a particle system known as the multispec…
This paper gives bijective proofs of some novel coinversion identities first discovered by Ayyer, Mandelshtam, and Martin (arxiv:2011.06117) as part of their proof of a new combinatorial formula for the modified Macdonald polynomials $\tilde{H}_μ$. Those authors used intricate algebraic manipulations of $q$-binomial coefficients to prove these identities, which imply the existence of certain bijections needed in their proof that their formula satisfies the axioms characterizing $\tilde{H}_μ$. They posed the open problem of constructing such bijections explicitly. We resolve that problem here.
In this paper we use the combinatorics of alcove walks to give a uniform combinatorial formula for Macdonald polynomials for all Lie types. These formulas are generalizations of the formulas of Haglund-Haiman-Loehr for Macdonald polynoimals of type GL(n). At q=0 these formulas specialize to the formula of Schwer for the Macdonald spherical function in terms of positively folded alcove walks and at q=t=0 these formulas specialize to the formula for the Weyl character in terms of the Littelmann path model (in the positively folded gallery form of Gaussent-Littelmann).
We give an explicit Pieri formula for Macdonald polynomials attached to the root system C_n (with equal multiplicities). By inversion we obtain an explicit expansion for two-row Macdonald polynomials of type C.
Combinatorial formulas for Macdonald polynomials by superizations
本文通过超填充上的新统计量，推导了对称和非对称Macdonald多项式的最简组合公式，给出了单项式展开系数的显式(q,t)-公式，并推广了Corteel等人的结果。
We give a concise direct proof of the orthogonality of interpolation Macdonald polynomials with respect to the Fourier pairing and briefly discuss some immediate applications of this orthogonality, such as the symmetry of the Fourier pairing and the binomial formula.
The purpose of this note is to give a refinement of the product formula proved in [1] for the Poincare polynomial of a smooth Schubert variety in the flag variety of an algebraic group G over C. This yields a factorization of the number of elements in a Bruhat interval [e,w] in the Weyl group W of G provided the Schubert variety associated to w is smooth. This gives an elementary necessary condition for a Schubert variety in the flag variety to be smooth.
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 polynomials of degree $d$. The form of these generic polynomials is that of a Bethe eigenfunction and they imitate, on a more elementary level, the $R$-matrix construction of quantum immanants.
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 for monomial, Jack and Hall-Littlewood symmetric functions.
New formulas for Macdonald polynomials via the multispecies exclusion and zero range processes
本文通过环上多物种ASEP和TAZRP的配分函数，分别导出Macdonald多项式$P_\lambda$和修正Macdonald多项式$\widetilde{H}_\lambda$的新公式，并揭示多线队列与队列反转表格间的plethystic联系。
In 2008, Han rediscovered an expansion of powers of Dedekind $η$ function due to Nekrasov and Okounkov by using Macdonald's identity in type $\widetilde{A}$. In this paper, we obtain new combinatorial expansions of powers of $η$, in terms of partition hook lengths, by using Macdonald's identity in type $\widetilde{C}$ and a new bijection. As applications, we derive a symplectic hook formula and a relation between Macdonald's identities in types $\widetilde{C}$, $\widetilde{B}$, and $\widetilde{BC}$.
We give the explicit analytic development of any Jack or Macdonald polynomial in terms of elementary (resp. modified complete) symmetric functions. These two developments are obtained by inverting the Pieri formula.
We prove a combinatorial formula for the Macdonald polynomial H_mu(x;q,t) which had been conjectured by the first author. Corollaries to our main theorem include the expansion of H_mu(x;q,t) in terms of LLT polynomials, a new proof of the charge formula of Lascoux and Schutzenberger for Hall-Littlewood polynomials, a new proof of Knop and Sahi's combinatorial formula for Jack polynomials as well as a lifting of their formula to integral form Macdonald polynomials, and a new combinatorial rule for the Kostka-Macdonald coefficients K_{lambda,mu}(q,t) in the case that mu is a partition with parts…
A 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 fillings of Young diagrams. Recently, Ram and Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of the corresponding affine Weyl group. In this paper, we show that a Haglund-Haiman-Loehr type formula follows naturally from the more general Ram-Yip formula, via compression. Then we extend this approach to the Hall-Littlewood polynomials of type C, which are specializations of the corresponding Macdon…
We consider products of two Macdonald polynomials of type A, indexed by dominant weights which are respectively a multiple of the first fundamental weight and a weight having zero component on the k-th fundamental weight. We give the explicit decomposition of any Macdonald polynomial of type A in terms of this basis.
We study the Gaussent-Littelmann formula for Hall-Littlewood polynomials and we develop combinatorial tools to describe the formula in a purely combinatorial way for type A_n, B_n and C_n. This description is in terms of Young tableaux and arises from identifying one-skeleton galleries that appear in the Gaussent-Littelmann formula with Young tableaux. Furthermore, we show by using these tools that the Gaussent-Littelmann formula and the well-known Macdonald formula for Hall-Littlewood polynomials for type A_n are the same.
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 Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of so-called alcove walks; these originate in the work of Gaussent-Littelmann and of the author with Postnikov on discrete counterparts to the Littelmann path model. In this paper, we relate the above developments, by explaining how the Ram-Yip formula compresses to a new formula, whi…
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 combinatorial formulas for the well poised Macdonald functions, the multiple binomial coefficients, the multiple bracket function, and the multiple Catalan and Lah numbers.
A multivariable hypergeometric-type formula for raising operators of the Macdonald polynomials is conjectured. It is proved that this agrees with Jing and Jozefiak's expression for the two-row Macdonald polynomials, and also with Lassalle and Schlosser's formula for partitions with length three.
This paper is a supplement to Guo-Ram arXiv:2104.02942, containing examples, remarks and additional material that could be useful to researchers working with Type $GL_n$ Macdonald polynomials. In the course of our comparison of the alcove walk formula and the nonattacking fillings formulas for type $GL_n$ Macdonald polynomials we did many examples and significant analysis of the literature. In the preparation of Guo-Ram arXiv:2104.02942 it seemed sensible to produce a document with focus and this material was removed. This is paper resurrects and organizes that material, in hopes that others m…
Probabilistic operators for non-attacking tableaux and a compact formula for the symmetric Macdonald polynomials
本文通过对非攻击表引入概率算子，证明了对称 Macdonald 多项式的一个项数更少、权重更简的紧凑公式，并建立了与多行队列的双射，同时恢复了 Jack 多项式的经典公式。
There is a striking similarity between Macdonald's reduced word formula and the image of the Schubert class in the cohomology ring of the permutahedral variety $\mathrm{Perm}_n$ as computed by Klyachko. Toward understanding this better, we undertake an in-depth study of a $q$-deformation of the $\mathbb{S}_n$-invariant part of the rational cohomology ring of $\mathrm{Perm}_n$, which we call the $q$-Klyachko algebra. We uncover intimate links between expansions in the basis of squarefree monomials in this algebra and various notions in algebraic combinatorics, thereby connecting seemingly unrel…
We present an explicit difference operator diagonalized by the Macdonald polynomials associated with an (arbitrary) admissible pair of irreducible reduced crystallographic root systems. By the duality symmetry, this gives rise to an explicit Pieri formula for the Macdonald polynomials in question. The simplest examples of our construction recover Macdonald's celebrated difference operators and associated Pieri formulas pertaining to the minuscule and quasi-minuscule weights. As further by-products, explicit expansions and Littlewood-Richardson type formulas are obtained for the Macdonald polyn…
The paper compares (and reproves) the alcove walk and the nonattacking fillings formulas for type $GL_n$ Macdonald polynomials which were given in Haglund-Haiman-Loehr arXiv:math.CO/0601693, Alexandersson arXiv:1602.05153 and Ram-Yip arXiv:0803.1146. The "compression" relating the two formulas in this paper is the same as that of Lenart arXiv:0804.4716. We have reformulated it so that it holds without conditions and so that the proofs of the alcove walk formula and the nonattacking fillings formula are parallel. This reformulation highlights the role of the double affine Hecke algebra and Cher…
We give a Littlewood-Richardson type rule for expanding the product of a row-strict quasisymmetric Schur function and a symmetric Schur function in terms of row-strict quasisymmetric Schur functions. We then discuss a family of polynomials called Demazure atoms. We review the known characterizations of these polynomials and then present two new characterizations. Finally, we consider a family of polynomials called permuted basement nonsymmetric Macdonald polynomials which are obtained by permuting the basement of the combinatorial formula of Haglund, Haiman, and Loehr for nonsymmetric Macdonal…
A one-parameter generalisation R_λ(X;b) of the symmetric Macdonald polynomials and interpolations Macdonald polynomials is studied from the point of view of branching rules. We establish a Pieri formula, evaluation symmetry, principal specialisation formula and q-difference equation for R_λ(X;b). We also prove a new multiple q-Gauss summation formula and several further results for sl_n basic hypergeometric series based on R_λ(X;b).
We give a direct geometric interpretation of the path model using galleries in the $1-$skeleton of the Bruhat-Tits building associated to a semi-simple algebraic group. This interpretation allows us to compute the coefficients of the expansion of the Hall-Littlewood polynomials in the monomial basis. The formula we obtain is a "geometric compression" of the one proved by Schwer, its specialization to the case ${\tt A}_n$ turns out to be equivalent to Macdonald's formula.
Five-Term Relations for wreath Macdonald polynomials and tableau formulas for Pieri coefficients
本文提出了wreath Macdonald多项式理论中算子的新恒等式，特别是类似于Garsia和Mellit的五项关系，并由此推导出能快速计算单项式展开的wreath Macdonald Pieri系数表公式。
In this paper we give Monk rules for Macdonald polynomials which are analogous to the Monk rules for Schubert polynomials. These formulas are similar to the formulas given by Baratta (2008), but our method of derivation is to use Cherednik's interwiners. Deriving Monk rules by this technique addresses the relationship between the work of Baratta and the product formulas of Yip (2010). Specializations of the Monk formula's at $q=0$ and/or $t=0$ provide Monk rules for Iwahori-spherical polynomials and for finite and affine key polynomials.
This paper surveys eight classes of polynomials associated with $A$-type and $BC$-type root systems: Jack, Jacobi, Macdonald and Koornwinder polynomials and interpolation (or shifted) Jack and Macdonald polynomials and their $BC$-type extensions. Among these the $BC$-type interpolation Jack polynomials were probably unobserved until now. Much emphasis is put on combinatorial formulas and binomial formulas for (most of) these polynomials. Possibly new results derived from these formulas are a limit from Koornwinder to Macdonald polynomials, an explicit formula for Koornwinder polynomials in two…
The $m$-symmetric Macdonald polynomials
本文确立了$m$-对称Macdonald多项式的基本性质，包括正交性、平方范数、求值和包含公式，并得到了可特化为非对称情形的Cauchy型恒等式。
It is shown that the deformed Macdonald-Ruijsenaars operators can be described as the restrictions on certain affine subvarieties of the usual Macdonald-Ruijsenaars operator in infinite number of variables. The ideals of these varieties are shown to be generated by the Macdonald polynomials related to Young diagrams with special geometry. The super Macdonald polynomials and their shifted version are introduced, the combinatorial formulas for them are given.
We give an explicit, nonnegative formula for the expansion of nonsymmetric Macdonald polynomials specialized at $t=0$ in terms of Demazure characters. Our formula results from constructing Demazure crystals whose characters are the nonsymmetric Macdonald polynomials, which also gives a new proof that these specialized nonsymmetric Macdonald polynomials are positive graded sums of Demazure characters. Demazure crystals are certain truncations of classical crystals that give a combinatorial skeleton for Demazure modules. To prove our construction, we develop further properties of Demazure crysta…
On conjectural fermionic formulas for the Macdonald index in Argyres-Douglas theories
通过构造新的共轭Bailey对，证明了$(A_1, D_{2k+1})$型Argyres-Douglas理论中Macdonald指标的费米子-玻色子对偶关系，从而证实了Andrews等人的猜想费米子公式。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。