The top-degree part in the Matchings-Jack Conjecture
arXiv:1803.09330 · doi:10.37236/9191
Abstract
In 1996 Goulden and Jackson introduced a family of coefficients indexed by triples of partitions which arise in the power sum expansion of some Cauchy sum for Jack symmetric functions . The coefficients can be viewed as an interpolation between the structure constants of the class algebra and the double coset algebra. Goulden and Jackson suggested that the coefficients are polynomials in the variable with non-negative integer coefficients and that there is a combinatorics of matching hidden behind them. This \emph{Matchings-Jack Conjecture} remains open. Doł\oldk{e}ga and Féray showed the polynomiality of connection coefficients and gave the upper bound on the degrees. We give a necessary and sufficient condition for the polynomial to achieve this bound. We show that the leading coefficient of is a positive integer and we present it in the context of Matchings-Jack Conjecture of Goulden and Jackson.
34 pages
References in corpus (7)
- Jack polynomials and free cumulants
- The Algebra of Conjugacy Classes in Symmetric Groups and Partial Permutations
- The uses of random partitions
- Cumulants of Jack symmetric functions and -conjecture
- Structure coefficients for Jack characters: approximate factorization property
- Shifted symmetric functions and multirectangular coordinates of Young diagrams
- On the matchings-Jack and hypermap-Jack conjectures for labelled matchings and star hypermaps