Polynomial properties of Jack connection coefficients and generalization of a result by Dénes

DOI10.1007/S10801-014-0573-YMaRDI QIDQ894239zbMATH OpenOpenAlexFDO

Authors Ekaterina A. Vassilieva

Publication date 30 November 2015

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1312.0120

zbMATH Keywords

Laplace-Beltrami operatorJack symmetric functionsconnection coefficientsJack characters

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Symmetric groups (20B30)

Abstract: This article is devoted to the computation of Jack connection coefficients, a generalization of the connection coefficients of two classical commutative subalgebras of the group algebra of the symmetric group: the class algebra and the double coset algebra. The connection coefficients of these two algebraic structures are of significant interest in the study of Schur and zonal polynomials as well as the irreducible characters of the symmetric group and the zonal spherical functions. Furthermore they play an important role in combinatorics as they give the number of factorizations of a permutation into a product of permutations with given cyclic properties. Usually studied separately, these two families of coefficients share strong similar properties. First (partially) introduced by Goulden and Jackson in 1996, Jack connection coefficients provide a natural unified approach closely related to the theory of Jack polynomials, a family of bases in the ring of symmetric functions indexed by a parameter alpha that generalizes both Schur (case alpha = 1) and zonal polynomials (case alpha = 2). Jack connection coefficients are also directly linked to Jack characters, a general view of the characters of the symmetric group and the zonal spherical functions. Goulden and Jackson conjectured that these coefficients are polynomials in alpha with nice combinatorial properties, the so-called Matchings-Jack conjecture. In this paper, we use the theory of Jack symmetric functions and the Laplace Beltrami operator to show the polynomial properties of Jack connection coefficients in some important cases. We also provide explicit formulations including notably a generalization of a classical formula of D'enes for the number of minimal factorizations of a permutation into transpositions.

Recommendations

• On Jack's connection coefficients and their computation
• On the matchings-Jack conjecture for Jack connection coefficients indexed by two single part partitions
• Connection coefficients, matchings, maps and combinatorial conjectures for Jack symmetric functions
• The top-degree part in the matchings-Jack conjecture
• Some combinatorial properties of Jack symmetric functions

Cites work

• scientific article; zbMATH DE number 431552 (Why is no real title available?)
• scientific article; zbMATH DE number 6909301 (Why is no real title available?)
• scientific article; zbMATH DE number 3149991 (Why is no real title available?)
• scientific article; zbMATH DE number 4023973 (Why is no real title available?)
• scientific article; zbMATH DE number 3766017 (Why is no real title available?)
• scientific article; zbMATH DE number 1066473 (Why is no real title available?)
• scientific article; zbMATH DE number 846184 (Why is no real title available?)
• scientific article; zbMATH DE number 3315265 (Why is no real title available?)
• A Markov chain on the symmetric group and Jack symmetric functions
• A positivity conjecture for Jack polynomials
• A recursion and a combinatorial formula for Jack polynomials
• A short proof of Cayley's tree formula
• Bijective evaluation of the connection coefficients of the double coset algebra
• Connection coefficients, matchings, maps and combinatorial conjectures for Jack symmetric functions
• Explicit generating series for connection coefficients
• Factoring \(n\)-cycles and counting maps of given genus
• Factorizations of large cycles in the symmetric group
• Gaussian fluctuations of Young diagrams and structure constants of Jack characters
• Jack polynomials and free cumulants
• Jack polynomials and orientability generating series of maps
• Jack symmetric functions and some combinatorial properties of Young symmetrizers
• Long cycle factorizations: bijective computation in the general case
• Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle)
• On Kerov polynomials for Jack characters
• On the number of factorizations of a full cycle
• Some combinatorial problems associated with products of conjugacy classes of the symmetric group
• Some combinatorial properties of Jack symmetric functions
• The Poset of Conjugacy Classes and Decomposition of Products in the Symmetric Group
• The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
• Transitive factorisations into transpositions and holomorphic mappings on the sphere

Cited in

(9)

• On Jack's connection coefficients and their computation
• On the matchings-Jack conjecture for Jack connection coefficients indexed by two single part partitions
• Connections between vector-valued and highest weight Jack and Macdonald polynomials
• Moments of the eigenvalue densities and of the secular coefficients of \(\beta\)-ensembles
• Gaussian fluctuations of Young diagrams and structure constants of Jack characters
• On the matchings-Jack and hypermap-Jack conjectures for labelled matchings and star maps
• Energy-dependent correlations in the S-matrix of chaotic systems
• Moments of the position of the maximum for GUE characteristic polynomials and for log-correlated Gaussian processes
• A labelled variant of the matchings-Jack and hypermap-Jack conjectures

This page was built for publication: Polynomial properties of Jack connection coefficients and generalization of a result by Dénes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894239)