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]$.
Introduced by Goulden and Jackson in their 1996 paper, the matchings-Jack conjecture and the hypermap-Jack conjecture (also known as the b-conjecture) are two major open questions relating Jack symmetric functions, the representation theory of the symmetric groups and combinatorial maps. They show that the coefficients in the power sum expansion of some Cauchy sum for Jack symmetric functions and in the logarithm of the same sum interpolate respectively between the structure constants of the class algebra and the double coset algebra of the symmetric group and between the numbers of orientable and locally orientable hypermaps. They further provide some evidence that these two families of coefficients indexed by three partitions of a given integer n and the Jack parameter α are polynomials in β = α−1 with non negative integer coefficients of combinatorial significance. This paper is devoted to the case when one of the three partitions is equal to (n). We exhibit some polynomial properties of both families of coefficients and prove a variation of the hypermap-Jack conjecture and the matchings-Jack conjecture involving labelled hypermaps and matchings in some important cases.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.