Michel Lassalle
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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.
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.
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 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.
Symmetry and Pieri rules for the bisymmetric Macdonald polynomials
本文利用双仿射赫克代数研究双对称麦克唐纳多项式，证明了其赋值满足推广的对称性质，并导出了求和于竖直条带上的Pieri法则。
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.
This paper presents our proof of the "strong Macdonald constant term conjecture" of P. Hanlon and B. Feigin.
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.
A combinatorial formula for Interpolation Macdonald polynomials
本文给出了插值 Macdonald 多项式的带符号多线队列组合公式，推广了 Macdonald 多项式的多线队列公式。
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 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 an elementary proof of the development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions.
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…
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.
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 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.
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.
We investigate the connections between various noncommutative analogues of Hall-Littlewood and Macdonald polynomials, and define some new families of noncommutative symmetric functions depending on two sequences of parameters.
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 prove the classification of homomorphisms from the algebra of symmetric functions to $\mathbb{R}$ with non-negative values on Macdonald symmetric functions $P_λ$, that was conjectured by S.V. Kerov in 1992.
We give explicit $q$-difference operators acting diagonally on wreath Macdonald $P$-polynomials in finitely many variables.
The quasisymmetic Macdonald polynomials $G_γ(X; q, t)$ were recently introduced by the first and second authors with Haglund, Mason, and Williams in [3] to refine the symmetric Macdonald polynomials $P_λ(X; q, t)$ with the property that $G_γ(X; 0, 0)$ equals $QS_γ(X)$, the quasisymmetric Schur polynomial of [9]. We derive an expansion for $G_γ(X; q, t)$ in the fundamental basis of quasisymmetric functions.
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…
Macdonald polynomials are orthogonal polynomials associated to root systems, and in the type A case, the symmetric kind is a common generalization of Schur functions, Macdonald spherical functions, and Jack polynomials. We use the combinatorics of alcove walks to calculate products of monomials and intertwining operators of the double affine Hecke algebra. From this, we obtain a product formula for Macdonald polynomials of general type.
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…
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.
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.
We investigate the homogeneous symmetric Macdonald polynomials $P_λ(\X;q,t)$ for the specialization $t=q^k$. We show an identity relying the polynomials $P_λ(\X;q,q^k)$ and $P_λ(\frac{1-q}{1-q^k}\X;q,q^k)$. As a consequence, we describe an operator whose eigenvalues characterize the polynomials $P_λ(\X;q,q^k)$.
A raising operator formula for Macdonald polynomials
本文利用LLT多项式上的 $\nabla$ 公式和Haglund-Haiman-Loehr公式，得到修正Macdonald多项式的显式升算子公式，并推广提出 $1,n$-Macdonald多项式及其Schur系数正性猜想。
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.
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 hypergeometric series of type g_n. Our main results include a new q-binomial theorem, new q-Gauss sum, and several transformation formulae for g_n series.
The Macdonald polynomials expanded in terms of a modified Schur function basis have coefficients called the $q,t$-Kostka polynomials. We define operators to build standard tableaux and show that they are equivalent to creation operators that recursively build the Macdonald polynomials indexed by two part partitions. We uncover a new basis for these particular Macdonald polynomials and in doing so are able to give an explicit description of their associated $q,t$-Kostka coefficients by assigning a statistic in $q$ and $t$ to each standard tableau.
We give a new theta-function identity, a special case of which is utilised to prove Kawanaka's Macdonald polynomial conjecture. The theta-function identity further yields a transformation formula for multivariable elliptic hypergeometric series which appears to be new even in the one-variable, basic case.
The $m$-symmetric Macdonald polynomials
本文确立了$m$-对称Macdonald多项式的基本性质，包括正交性、平方范数、求值和包含公式，并得到了可特化为非对称情形的Cauchy型恒等式。
We prove that Macdonald polynomials are characters of irreducible Cherednik algebra modules.
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.
Positive expansions of permuted basement and quasisymmetric Macdonald polynomials at $t=0$
研究了排列底座和拟对称Macdonald多项式在t=0时的正扩张性质，并证明了其在Demazure原子中的正展开。
A characterization of the space of symmetric Laurent polynomials of type $(BC)_n$ which vanish on a certain set of submanifolds is given by using the Koornwinder-Macdonald polynomials. A similar characterization was given previously for symmetric polynomials of type $A_n$ by using the Macdonald polynomials. We use a new method which exploits the duality relation. The method simplifies a part of the proof in the $A_n$ case.
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.
We prove a positive combinatorial formula for the Schur expansion of LLT polynomials indexed by a 3-tuple of skew shapes. This verifies a conjecture of Haglund. The proof requires expressing a noncommutative Schur function as a positive sum of monomials in Lam's algebra of ribbon Schur operators. Combining this result with the expression of Haglund, Haiman, and Loehr for transformed Macdonald polynomials in terms of LLT polynomials then yields a positive combinatorial rule for transformed Macdonald polynomials indexed by a shape with 3 columns.
We show that the action of classical operators associated to the Macdonald polynomials on the basis of Schur functions, S_λ[X(t-1)/(q-1)], can be reduced to addition in λ-rings. This provides explicit formulas for the Macdonald polynomials expanded in this basis as well as in the ordinary Schur basis, S_λ[X], and the monomial basis, m_λ[X].
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.
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.
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 objects and properties are analyzed, such as the canonical bilinear form which pairs polynomials with those arising from reciprocals of the original parameters, and the symmetrization of the Macdonald polynomials. The main tool of the study is the Yang-Baxter graph. We show that these Macdonald polynomials can be easily computed following this graph. We give als…
In the basic representation of $U_q(\hat{sl}(2))$ realized via the algebra of symmetric functions we compare the canonical basis with the basis of Macdonald polynomials with $q=t^2$. We show that the Macdonald polynomials are invariant with respect to the bar involution defined abstractly on the representations of quantum groups. We also prove that the Macdonald scalar product coincides with the abstract Kashiwara form. This implies, in particular, that the Macdonald polynomials form an intermediate basis between the canonical basis and the dual canonical basis, and the coefficients of the tra…
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…
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,…
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…
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 extend the family non-symmetric Macdonald polynomials and define general-basement Macdonald polynomials. We show that these also satisfy a triangularity property with respect to the monomials bases and behave well under the Demazure-Lusztig operators. The symmetric Macdonald polynomials $J_λ$ are expressed as a sum of general-basement Macdonald polynomials via an explicit formula. By letting $q=0$, we obtain $t$-deformations of key polynomials and Demazure atoms and we show that the Hall--Littlewood polynomials expand positively into these. This generalizes a result by Haglund, Luoto, Mason…
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.
Tesler identities for wreath Macdonald polynomials
本研究利用量子环面代数与shuffle代数生成的圈积Macdonald多项式本征算子，给出将其映射到配分特征δ函数的算子显式公式，证明了互反性相关新结果，还开展了圈积插值Macdonald多项式研究并推导相关系数公式与双谱问题解。
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…
The Cherednik-Orr conjecture expresses the $t\to\infty$ limit of the nonsymmetric Macdonald polynomials in terms of the PBW twisted characters of the affine level one Demazure modules. We prove this conjecture in several special cases.
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 the power sum polynomials. The Markov chain has stationary distribution a new two-parameter family of measures on partitions, the inverse of the Macdonald weight (rescaled). The uniform distribution on permutations and the Ewens sampling formula are special cases. The Markov chain is a version of the auxiliary variables algorithm of statistical physics. Prop…
The Garsia--Haiman module is a bigraded $\mathfrak{S}_n$-module whose Frobenius image is a Macdonald polynomial. The method of orbit harmonics promotes an $\mathfrak{S}_n$-set $X$ to a graded polynomial ring. The orbit harmonics can be applied to prove cyclic sieving phenomena which is a notion that encapsulates the fixed-point structure of finite cyclic group action on a finite set. By applying this idea to the Garsia--Haiman module, we provide cyclic sieving results regarding the enumeration of matrices that are invariant under certain cyclic row and column rotation and translation of entrie…
We construct explicitly non-polynomial eigenfunctions of the difference operators by Macdonald in case $t=q^k$, $k\in{\mathbb Z}$. This leads to a new, more elementary proof of several Macdonald conjectures, first proved by Cherednik. We also establish the algebraic integrability of Macdonald operators at $t=q^k$ ($k\in {\mathbb Z}$), generalizing the result of Etingof and Styrkas. Our approach works uniformly for all root systems including $BC_n$ case and related Koornwinder polynomials. Moreover, we apply it for a certain deformation of $A_n$ root system where the previously known methods do…
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.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。