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

DOI10.1007/S10801-014-0573-YzbMATH Open1327.05335arXiv1312.0120OpenAlexW1969799165MaRDI QIDQ894239FDOQ894239

Ekaterina A. Vassilieva

Publication date: 30 November 2015

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

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.

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some combinatorial properties of Jack symmetric functions
• Transitive factorisations into transpositions and holomorphic mappings on the sphere
• Jack polynomials and free cumulants
• Jack symmetric functions and some combinatorial properties of Young symmetrizers
• A Markov chain on the symmetric group and Jack symmetric functions
• The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
• Factoring \(n\)-cycles and counting maps of given genus
• A recursion and a combinatorial formula for Jack polynomials
• Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle)
• Factorizations of large cycles in the symmetric group
• Some combinatorial problems associated with products of conjugacy classes of the symmetric group
• Jack polynomials and orientability generating series of maps
• A positivity conjecture for Jack polynomials
• Gaussian fluctuations of Young diagrams and structure constants of Jack characters
• Bijective evaluation of the connection coefficients of the double coset algebra
• Connection coefficients, matchings, maps and combinatorial conjectures for Jack symmetric functions
• The Poset of Conjugacy Classes and Decomposition of Products in the Symmetric Group
• On Kerov polynomials for Jack characters
• Long Cycle Factorizations : Bijective Computation in the General Case
• On the number of factorizations of a full cycle
• A Short Proof of Cayley's Tree Formula

Cited In (8)

• On the matchings-Jack conjecture for Jack connection coefficients indexed by two single part partitions
• Gaussian fluctuations of Young diagrams and structure constants of Jack characters
• 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
• Moments of the eigenvalue densities and of the secular coefficients ofβ-ensembles
• On the matchings-Jack and hypermap-Jack conjectures for labelled matchings and star maps
• A labelled variant of the matchings-Jack and hypermap-Jack conjectures
• Connections between vector-valued and highest weight Jack and Macdonald polynomials

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)