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 Hall-Littlewood Polynomials in terms of Yamanouchi words

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Austin Roberts
Keyword(s):  
Symmetric Function ◽  
Symmetric Functions ◽  
Macdonald Polynomials ◽  
Macdonald Polynomial ◽  
Colored Graph ◽  
Littlewood Polynomials ◽  
Dual Equivalence ◽  
International Audience ◽  
Leading Term ◽  
Definition Of

International audience This paper uses the theory of dual equivalence graphs to give explicit Schur expansions to 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 $δ ⊂ \mathbb{Z} \times \mathbb{Z}$, written as $\widetilde H_δ (X;q,t)$ and $\widetilde P_δ (X;t)$, respectively. We then give an explicit Schur expansion of $\widetilde P_δ (X;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_γ ,δ (X)$ as a refinement of $\widetilde P_δ$ and similarly describe its Schur expansion. We then analysize $R_γ ,δ (X)$ to determine the leading term of its Schur expansion. To gain these results, we associate each Macdonald polynomial with a signed colored graph $\mathcal{H}_δ$ . In the case where a subgraph of $\mathcal{H}_δ$ is a dual equivalence graph, we provide the Schur expansion of its associated symmetric function, yielding several corollaries.

scholarly journals A Two Parameter Chromatic Symmetric Function

10.37236/940 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
Ellison-Anne Williams
Keyword(s):  
Complete Graph ◽  
Symmetric Function ◽  
Symmetric Functions ◽  
Rational Functions ◽  
Macdonald Polynomials ◽  
Simple Graph ◽  
Macdonald Polynomial ◽  
Chromatic Symmetric Function ◽  
Correlation Properties ◽  
Two Parameter

We introduce and develop a two-parameter chromatic symmetric function for a simple graph $G$ over the field of rational functions in $q$ and $t,\,{\Bbb Q}(q,t)$. We derive its expansion in terms of the monomial symmetric functions, $m_{\lambda}$, and present various correlation properties which exist between the two-parameter chromatic symmetric function and its corresponding graph. Additionally, for the complete graph $G$ of order $n$, its corresponding two-parameter chromatic symmetric function is the Macdonald polynomial $Q_{(n)}$. Using this, we develop graphical analogues for the expansion formulas of the two-row Macdonald polynomials and the two-row Jack symmetric functions. Finally, we introduce the "complement" of this new function and explore some of its properties.

scholarly journals Flag-symmetric and Locally Rank-symmetric Partially Ordered Sets

10.37236/1264 ◽  
1995 ◽  
Vol 3 (2) ◽  
Author(s):  
Richard P. Stanley
Keyword(s):  
Symmetric Function ◽  
Symmetric Functions ◽  
Partially Ordered Sets ◽  
Schur Function ◽  
Ordered Sets ◽  
Graded Poset ◽  
Kostka Polynomials ◽  
Relative Version ◽  
Definition Of ◽  
Formal Power

For every finite graded poset $P$ with $\hat{0}$ and $\hat{1}$ we associate a certain formal power series $F_P(x) = F_P(x_1,x_2,\dots)$ which encodes the flag $f$-vector (or flag $h$-vector) of $P$. A relative version $F_{P/\Gamma}$ is also defined, where $\Gamma$ is a subcomplex of the order complex of $P$. We are interested in the situation where $F_P$ or $F_{P/\Gamma}$ is a symmetric function of $x_1,x_2,\dots$. When $F_P$ or $F_{P/\Gamma}$ is symmetric we consider its expansion in terms of various symmetric function bases, especially the Schur functions. For a class of lattices called $q$-primary lattices the Schur function coefficients are just values of Kostka polynomials at the prime power $q$, thus giving in effect a simple new definition of Kostka polynomials in terms of symmetric functions. We extend the theory of lexicographically shellable posets to the relative case in order to show that some examples $(P,\Gamma)$ are relative Cohen-Macaulay complexes. Some connections with the representation theory of the symmetric group and its Hecke algebra are also discussed.

scholarly journals On the expression of a symmetric function in terms of the elementary symmetric functions

1888 ◽  
Vol 7 ◽  
pp. 41-42
Author(s):  
R. E. Allardice
Keyword(s):  
Rational Function ◽  
Symmetric Function ◽  
Symmetric Functions ◽  
Elementary Proof ◽  
Elementary Symmetric Functions ◽  
Definition Of

The theorem that any rational symmetric function of n variables x1, x2, … xn is expressible as a rational function of the n elementary symmetric functions, Σx1, Σx1x2, Σx1x2x3, etc., is usually proved by means of the properties of the roots of an equation. It is obvious, however, that the theorem has no necessary connection with the properties of equations; and the object of this paper is to give an elementary proof of the theorem, based solely on the definition of a symmetric function.

scholarly journals Staircase Macdonald polynomials and the $q$-Discriminant

2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
Adrien Boussicault ◽  
Jean-Gabriel Luque
Keyword(s):  
Symmetric Functions ◽  
Macdonald Polynomials ◽  
Macdonald Polynomial ◽  
Monomial Basis ◽  
Nous Montrons ◽  
International Audience ◽  
Nous Examinons

International audience We prove that a $q$-deformation $\mathfrak{D}_k(\mathbb{X};q)$ of the powers of the discriminant is equal, up to a normalization, to a specialization of a Macdonald polynomial indexed by a staircase partition. We investigate the expansion of $\mathfrak{D}_k(\mathbb{X};q)$ on different bases of symmetric functions. In particular, we show that its expansion on the monomial basis can be explicitly described in terms of standard tableaux and we generalize a result of King-Toumazet-Wybourne about the expansion of the $q$-discriminant on the Schur basis. Nous montrons qu’une $q$-déformation $\mathfrak{D}_k(\mathbb{X};q)$ des puissances du discriminant est égale, à un coefficient de normalisation près, à un polynôme de Macdonald indexé par une partition escalier pour une certaine spécialisation des paramètres. Nous examinons les développements de $\mathfrak{D}_k(\mathbb{X};q)$ dans différentes bases de fonctions symétriques. En particulier, nous montrons que son écriture dans la base des fonctions monomiales peut être explicitement décrite en terme de tableaux standard et nous généralisons un résultat de King-Toumazet-Wybourne sur le développement du $q$-discriminant dans la base de Schur.

scholarly journals Combinatorial Expansions in $K$-Theoretic Bases

10.37236/2320 ◽  
2012 ◽  
Vol 19 (4) ◽  
Author(s):  
Jason Bandlow ◽  
Jennifer Morse
Keyword(s):  
Generating Functions ◽  
Symmetric Functions ◽  
Schur Functions ◽  
Geometric Information ◽  
Combinatorial Description ◽  
Littlewood Polynomials ◽  
Stanley Symmetric Functions ◽  
K Theory ◽  
Combinatorial Representation

We study the class $\mathcal C$ of symmetric functions whose coefficients in the Schur basis can be described by generating functions for sets of tableaux with fixed shape.  Included in this class are the Hall-Littlewood polynomials, $k$-Schur functions, and Stanley symmetric functions; functions whose Schur coefficients encode combinatorial, representation theoretic and geometric information. While Schur functions represent the cohomology of the Grassmannian variety of $GL_n$, Grothendieck functions $\{G_\lambda\}$ represent the $K$-theory of the same space.  In this paper, we give a combinatorial description of the coefficients when any element of $\mathcal C$ is expanded in the $G$-basis or the basis dual to $\{G_\lambda\}$.

scholarly journals How to get the weak order out of a digraph ?

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Francois Viard
Keyword(s):  
Wreath Product ◽  
Symmetric Function ◽  
Coxeter Groups ◽  
Symmetric Functions ◽  
Weak Order ◽  
Möbius Function ◽  
Mobius Function ◽  
Acyclic Digraph ◽  
International Audience

International audience We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its Möbius function. We show that the weak order on Coxeter groups $A$<sub>$n-1$</sub>, $B$<sub>$n$</sub>, $Ã$<sub>$n$</sub>, and the flag weak order on the wreath product &#8484;<sub>$r$</sub> &#8768; $S$<sub>$n$</sub> introduced by Adin, Brenti and Roichman (2012), are special instances of our construction. We conclude by briefly explaining how to use our work to define quasi-symmetric functions, with a special emphasis on the $A$<sub>$n-1$</sub> case, in which case we obtain the classical Stanley symmetric function. On construit une famille d’ensembles ordonnés à partir d’un graphe orienté, simple et acyclique munit d’une valuation sur ses sommets, puis on calcule les valeurs de leur fonction de Möbius respective. On montre que l’ordre faible sur les groupes de Coxeter $A$<sub>$n-1$</sub>, $B$<sub>$n$</sub>, $Ã$<sub>$n$</sub>, ainsi qu’une variante de l’ordre faible sur les produits en couronne &#8484;<sub>$r$</sub> &#8768; $S$<sub>$n$</sub> introduit par Adin, Brenti et Roichman (2012), sont des cas particuliers de cette construction. On conclura en expliquant brièvement comment ce travail peut-être utilisé pour définir des fonction quasi-symétriques, en insistant sur l’exemple de l’ordre faible sur $A$<sub>$n-1$</sub> où l’on obtient les séries de Stanley classiques.

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.

Inequalities for Generalized Symmetric Functions

1969 ◽  
Vol 12 (5) ◽  
pp. 615-623 ◽  
Author(s):  
K.V. Menon
Keyword(s):  
Symmetric Function ◽  
Symmetric Functions ◽  
Elementary Symmetric Function ◽  
Generating Series ◽  
Image Position ◽  
Complete Symmetric Function

The generating series for the elementary symmetric function Er, the complete symmetric function Hr, are defined byrespectively.

scholarly journals Schur-Power Convexity of a Completely Symmetric Function Dual

Symmetry ◽  
2019 ◽  
Vol 11 (7) ◽  
pp. 897 ◽  
Author(s):  
Huan-Nan Shi ◽  
Wei-Shih Du
Keyword(s):  
Convex Function ◽  
Symmetric Function ◽  
Symmetric Functions ◽  
New Inequalities

In this paper, by applying the decision theorem of the Schur-power convex function, the Schur-power convexity of a class of complete symmetric functions are studied. As applications, some new inequalities are established.

Sign in / Sign up

Export Citation Format

Share Document