Valentin Féray ; Piotr Sniady - Dual combinatorics of zonal polynomials

dmtcs:2913 - Discrete Mathematics & Theoretical Computer Science, January 1, 2011, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) - https://doi.org/10.46298/dmtcs.2913
Dual combinatorics of zonal polynomials

Authors: Valentin Féray 1; Piotr Sniady 2,3

  • 1 Laboratoire Bordelais de Recherche en Informatique
  • 2 Instytut Matematyczny PAN
  • 3 Instytut Matematyczny

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.


Volume: DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
Section: Proceedings
Published on: January 1, 2011
Imported on: January 31, 2017
Keywords: zonal polynomials,zonal characters,Jack polynomials,Kerov polynomials,Stanley polynomials,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo ARXIV 0810.3209
Source : ScholeXplorer IsRelatedTo DOI 10.1016/j.aim.2010.02.011
Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.0810.3209
  • 10.48550/arxiv.0810.3209
  • 10.1016/j.aim.2010.02.011
  • 0810.3209
Explicit combinatorial interpretation of Kerov character polynomials as numbers of permutation factorizations

Consultation statistics

This page has been seen 158 times.
This article's PDF has been downloaded 143 times.