scholarly journals Toward the Schur Expansion of Macdonald Polynomials

10.37236/7419 ◽  
2018 ◽  
Vol 25 (2) ◽  
Author(s):  
Sami Assaf
Keyword(s):  
Macdonald Polynomials ◽  
Equivalence Classes ◽  
Combinatorial Formula ◽  
Dual Equivalence

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 in explicit bijection with unions of standard dual equivalence classes of permutations for certain cases, establishing an earlier conjecture of the author, and suggesting that this result might be generalized to arbitrary partitions.

scholarly journals A combinatorial formula for nonsymmetric Macdonald polynomials

2008 ◽  
Vol 130 (2) ◽  
pp. 359-383 ◽  
Author(s):  
James. Haglund ◽  
Mark D. Haiman ◽  
N. Loehr
Keyword(s):  
Macdonald Polynomials ◽  
Combinatorial Formula

scholarly journals A Combinatorial Approach to the $q,t$-Symmetry Relation in Macdonald Polynomials

10.37236/5350 ◽  
2016 ◽  
Vol 23 (2) ◽  
Author(s):  
Maria Monks Gillespie
Keyword(s):  
Macdonald Polynomials ◽  
Combinatorial Proof ◽  
Symmetry Relation ◽  
Combinatorial Approach ◽  
Combinatorial Formula ◽  
Recursive Structure ◽  
Littlewood Polynomials

Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Loehr, we investigate the combinatorics of the symmetry relation $\widetilde{H}_\mu(\mathbf{x};q,t)=\widetilde{H}_{\mu^\ast}(\mathbf{x};t,q)$. We provide a purely combinatorial proof of the relation in the case of Hall-Littlewood polynomials ($q=0$) when $\mu$ is a partition with at most three rows, and for the coefficients of the square-free monomials in $\mathbf{x}$ for all shapes $\mu$. We also provide a proof for the full relation in the case when $\mu$ is a hook shape, and for all shapes at the specialization $t=1$. Our work in the Hall-Littlewood case reveals a new recursive structure for the cocharge statistic on words.

scholarly journals A combinatorial formula for Macdonald polynomials

2011 ◽  
Vol 226 (1) ◽  
pp. 309-331 ◽  
Author(s):  
Arun Ram ◽  
Martha Yip
Keyword(s):  
Macdonald Polynomials ◽  
Combinatorial Formula

scholarly journals On the Schur Expansion of Hall-Littlewood and Related Polynomials via Yamanouchi Words

10.37236/6732 ◽  
2017 ◽  
Vol 24 (1) ◽  
Author(s):  
Austin Roberts
Keyword(s):  
Symmetric Function ◽  
Symmetric Functions ◽  
Macdonald Polynomials ◽  
Macdonald Polynomial ◽  
Gamma Delta ◽  
Colored Graph ◽  
Littlewood Polynomials ◽  
Dual Equivalence ◽  
Leading Term ◽  
Definition Of

This paper uses the theory of dual equivalence graphs to give explicit Schur expansions for several families of symmetric functions. We begin by giving a combinatorial definition of the modified Macdonald polynomials and modified Hall-Littlewood polynomials indexed by any diagram $\delta \subset {\mathbb Z} \times {\mathbb Z}$, written as $\widetilde H_{\delta}(X;q,t)$ and $\widetilde H_{\delta}(X;0,t)$, respectively. We then give an explicit Schur expansion of $\widetilde H_{\delta}(X;0,t)$ as a sum over a subset of the Yamanouchi words, as opposed to the expansion using the charge statistic given in 1978 by Lascoux and Schüztenberger. We further define the symmetric function $R_{\gamma,\delta}(X)$ as a refinement of $\widetilde H_{\delta}(X;0,t)$ and similarly describe its Schur expansion. We then analyze $R_{\gamma,\delta}(X)$ to determine the leading term of its Schur expansion. We also provide a conjecture towards the Schur expansion of $\widetilde H_{\delta}(X;q,t)$. To gain these results, we use a construction from the 2007 work of Sami Assaf to associate each Macdonald polynomial with a signed colored graph $\mathcal{H}_\delta$. In the case where a subgraph of $\mathcal{H}_\delta$ is a dual equivalence graph, we provide the Schur expansion of its associated symmetric function, yielding several corollaries.

scholarly journals Combinatorial Formulas for Macdonald and Hall-Littlewood Polynomials

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Cristian Lenart
Keyword(s):  
Weyl Group ◽  
Type A ◽  
Macdonald Polynomials ◽  
Combinatorial Formula ◽  
Young Diagrams ◽  
Affine Weyl Group ◽  
Littlewood Polynomials ◽  
Combinatorial Formulas ◽  
International Audience ◽  
Type C

International audience 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 Macdonald polynomials at $q=0$. We note that no analog of the Haglund-Haiman-Loehr formula exists beyond type $A$, so our work is a first step towards finding such a formula.

scholarly journals Combinatorial Formula for the Hilbert Series of bigraded $S_n$-modules

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Meesue Yoo
Keyword(s):  
Hilbert Series ◽  
Macdonald Polynomials ◽  
Weighted Sum ◽  
Young Tableaux ◽  
Combinatorial Formula ◽  
Nous Proposons ◽  
International Audience ◽  
Standard Young Tableaux ◽  
Littlewood Polynomial ◽  
The Way

International audience We introduce a combinatorial way of calculating the Hilbert series of bigraded $S_n$-modules as a weighted sum over standard Young tableaux in the hook shape case. This method is based on Macdonald formula for Hall-Littlewood polynomial and extends the result of $A$. Garsia and $C$. Procesi for the Hilbert series when $q=0$. Moreover, we give the way of associating the fillings giving the monomial terms of Macdonald polynomials to the standard Young tableaux. Nous introduisons une méthode combinatoire pour calculer la série de Hilbert de modules bigradués de $S_n$ comme une somme pondérée sur les tableaux de Young standards à la forme crochet. Cette méthode se fonde sur la formule Macdonald pour les polynômes Hall-Littlewood et généralise un résultat de $A$. Garsia et $C$. Procesi pour la série de Hilbert dans le cas $q=0$. De plus, nous proposons une méthode pour associer aux tableaux de Young standards les remplissages des monômes des polynômes de Macdonald.

scholarly journals A combinatorial approach to Macdonald q, t-symmetry via the Carlitz bijection

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Maria Monks Gillespie
Keyword(s):  
Young Diagram ◽  
Macdonald Polynomials ◽  
Point Of View ◽  
Combinatorial Proof ◽  
Symmetry Relation ◽  
Combinatorial Approach ◽  
Combinatorial Formula ◽  
Monomial Basis ◽  
Littlewood Polynomials ◽  
International Audience

International audience We investigate the combinatorics of the symmetry relation H μ(x; q, t) = H μ∗ (x; t, q) on the transformed Macdonald polynomials, from the point of view of the combinatorial formula of Haglund, Haiman, and Loehr in terms of the inv and maj statistics on Young diagram fillings. By generalizing the Carlitz bijection on permutations, we provide a purely combinatorial proof of the relation in the case of Hall-Littlewood polynomials (q = 0) for the coefficients of the square-free monomials in the variables x. Our work in this case relates the Macdonald inv and maj statistics to the monomial basis of the modules Rμ studied by Garsia and Procesi. We also provide a new proof for the full Macdonald relation in the case when μ is a hook shape.

Sign in / Sign up

Export Citation Format

Share Document