Abstract
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]$.
Highlights
1.1 Integer partitionsFor any integer n we denote [n] = {1, . . . , n}, Sn the symmetric group on n elements and λ = (λ1, λ2, . . . , λp) n an integer partition of |λ| = n with (λ) = p parts sorted in decreasing order
We use an algebraic framework of Lassalle (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
A partition λ is usually represented as a Young diagram of |λ| boxes arranged in (λ) lines so that the i-th line contains λi the electronic journal of combinatorics 23(1) (2016), #P1.53 boxes
Summary
Given a box s in the diagram of λ, let l (s), l(s), a(s), a (s) be the number of boxes to the north, south, east, west of s respectively. These statistics are called co-leglength, leglength, armlength, co-armlength respectively. If λ contains a part k and a part l we denote λ↓(k,l) the partition obtained from λ by removing a part k and a part l and adding a part k + l − 1. If λ contains a part k + l + 1 we denote λ↑(k,l) the partition obtained from λ by adding a part k and a part l and removing a part k + l + 1.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.