scholarly journals Macdonald Polynomials and Chromatic Quasisymmetric Functions

10.37236/9011 ◽  
2020 ◽  
Vol 27 (3) ◽  
Author(s):  
James Haglund ◽  
Andrew Timothy Wilson

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. 

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Valentin Féray ◽  
Maciej Dołęga

International audience We consider a deformation of Kerov character polynomials, linked to Jack symmetric functions. It has been introduced recently by M. Lassalle, who formulated several conjectures on these objects, suggesting some underlying combinatorics. We give a partial result in this direction, showing that some quantities are polynomials in the Jack parameter $\alpha$ with prescribed degree. Our result has several interesting consequences in various directions. Firstly, we give a new proof of the fact that the coefficients of Jack polynomials expanded in the monomial or power-sum basis depend polynomially in $\alpha$. Secondly, we describe asymptotically the shape of random Young diagrams under some deformation of Plancherel measure.


10.37236/1547 ◽  
2000 ◽  
Vol 8 (1) ◽  
Author(s):  
Leigh Roberts

Recently Lapointe et. al. [3] have expressed Jack Polynomials as determinants in monomial symmetric functions $m_\lambda$. We express these polynomials as determinants in elementary symmetric functions $e_\lambda$, showing a fundamental symmetry between these two expansions. Moreover, both expansions are obtained indifferently by applying the Calogero-Sutherland operator in physics or quasi Laplace Beltrami operators arising from differential geometry and statistics. Examples are given, and comments on the sparseness of the determinants so obtained conclude the paper.


10.37236/468 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Matt Szczesny

Let ${\cal CRF}_S$ denote the category of $S$-colored rooted forests, and H$_{{\cal CRF}_S}$ denote its Ringel-Hall algebra as introduced by Kremnizer and Szczesny. We construct a homomorphism from a $K^+_0({\cal CRF}_S)$–graded version of the Hopf algebra of noncommutative symmetric functions to H$_{{\cal CRF}_S}$. Dualizing, we obtain a homomorphism from the Connes-Kreimer Hopf algebra to a $K^+_0({\cal CRF}_S)$–graded version of the algebra of quasisymmetric functions. This homomorphism is a refinement of one considered by W. Zhao.


10.37236/5949 ◽  
2016 ◽  
Vol 23 (4) ◽  
Author(s):  
Rebecca Patrias

Motivated by work of Buch on set-valued tableaux in relation to the K-theory of the Grassmannian, Lam and Pylyavskyy studied six combinatorial Hopf algebras that can be thought of as K-theoretic analogues of the Hopf algebras of symmetric functions, quasisymmetric functions, noncommutative symmetric functions, and of the Malvenuto-Reutenauer Hopf algebra of permutations. They described the bialgebra structure in all cases that were not yet known but left open the question of finding explicit formulas for the antipode maps. We give combinatorial formulas for the antipode map for the K-theoretic analogues of the symmetric functions, quasisymmetric functions, and noncommutative symmetric functions.


2021 ◽  
Author(s):  
◽  
Leigh Alan Roberts

<p>Jack polynomials are useful in mathematical statistics, but they are awkward to calculate, and their uses have chiefly been theoretical. In this thesis a determinantal expansion of Jack polynomials in elementary symmetric polynomials is found, complementing a recent result in the literature on expansions as determinants in monomial symmetric functions. These results offer enhanced possibilities for the calculation of these polynomials, and for finding workable approximations to them. The thesis investigates the structure of the determinants concerned, finding which terms can be expected to dominate, and quantifying the sparsity of the matrices involved. Expressions are found for the elementary and monomial symmetric polynomials when the variates involved assume the form of arithmetic and geometric progressions. The latter case in particular is expected to facilitate the construction of algorithms suitable for approximating Jack polynomials.</p>


10.37236/4761 ◽  
2015 ◽  
Vol 22 (2) ◽  
Author(s):  
Christos A. Athanasiadis

The chromatic quasisymmetric function of a graph was introduced by Shareshian and Wachs as a refinement of Stanley's chromatic symmetric function. An explicit combinatorial formula, conjectured by Shareshian and Wachs, expressing the chromatic quasisymmetric function of the incomparability graph of a natural unit interval order in terms of power sum symmetric functions, is proven. The proof uses a formula of Roichman for the irreducible characters of the symmetric group.


2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Maciej Dolega ◽  
Valentin Féray

International audience Goulden and Jackson (1996) introduced, using Jack symmetric functions, some multivariate generating series ψ(x, y, z; t, 1 + β) that might be interpreted as a continuous deformation of the rooted hypermap generating series. They made the following conjecture: coefficients of ψ(x, y, z; t, 1+β) are polynomials in β with nonnegative integer coefficients. We prove partially this conjecture, nowadays called b-conjecture, by showing that coefficients of ψ(x, y, z; t, 1 + β) are polynomials in β with rational coefficients. Until now, it was only known that they are rational functions of β. A key step of the proof is a strong factorization property of Jack polynomials when α → 0 that may be of independent interest.


10.37236/5085 ◽  
2016 ◽  
Vol 23 (1) ◽  
Author(s):  
Andrei L. Kanunnikov ◽  
Ekaterina A. Vassilieva

This article is devoted to the study of Jack connection coefficients, a generalization of the connection coefficients of the classical commutative subalgebras of the group algebra of the symmetric group closely related to the theory of Jack symmetric functions. First introduced by Goulden and Jackson (1996) these numbers indexed by three partitions of a given integer $n$ and the Jack parameter $\alpha$ are defined as the coefficients in the power sum expansion of some Cauchy sum for Jack symmetric functions. Goulden and Jackson conjectured that they are polynomials in $\beta = \alpha-1$ with non negative integer coefficients of combinatorial significance, the Matchings-Jack conjecture.In this paper we look at the case when two of the integer partitions are equal to the single part $(n)$. We use an algebraic framework of Lasalle (2008) for Jack symmetric functions and a bijective construction in order to show that the coefficients satisfy a simple recurrence formula and prove the Matchings-Jack conjecture in this case. Furthermore we exhibit the polynomial properties of more general coefficients where the two single part partitions are replaced by an arbitrary number of integer partitions either equal to $(n)$ or $[1^{n-2}2]$.


2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Valentin Féray ◽  
Piotr Sniady

International audience In this paper we establish a new combinatorial formula for zonal polynomials in terms of power-sums. The proof relies on the sign-reversing involution principle. We deduce from it formulas for zonal characters, which are defined as suitably normalized coefficients in the expansion of zonal polynomials in terms of power-sum symmetric functions. These formulas are analogs of recent developments on irreducible character values of symmetric groups. The existence of such formulas could have been predicted from the work of M. Lassalle who formulated two positivity conjectures for Jack characters, which we prove in the special case of zonal polynomials. Dans cet article, nous établissons une nouvelle formule combinatoire pour les polynômes zonaux en fonction des fonctions puissance. La preuve utilise le principe de l'involution changeant les signes. Nous en déduisons des formules pour les caractères zonaux, qui sont définis comme les coefficients des polynômes zonaux écrits sur la base des fonctions puissance, normalisés de manière appropriée. Ces formules sont des analogues de développements récents sur les caractères du groupe symétrique. L'existence de telles formules aurait pu être prédite à partir des travaux de M. Lassalle, qui a proposé deux conjectures de positivité sur les caractères de Jack, que nous prouvons dans le cas particulier des polynômes zonaux.


Sign in / Sign up

Export Citation Format

Share Document