Macdonald characters from a new formula for Macdonald polynomials
Abstract.
We introduce a new operator on symmetric functions, which enables us to obtain a creation formula for Macdonald polynomials. This formula provides a connection between the theory of Macdonald operators initiated by Bergeron, Garsia, Haiman and Tesler, and shifted Macdonald polynomials introduced by Knop, Lassalle, Okounkov and Sahi.
We use this formula to introduce a two-parameter generalization of Jack characters, which we call Macdonald characters. Finally, we provide a change of variables in order to formulate several positivity conjectures related to these generalized characters. Our conjectures extend some important open problems on Jack polynomials, including some famous conjectures of Goulden and Jackson.
1. Introduction
1.1. Jack and Macdonald polynomials
Jack polynomials are symmetric functions depending on one parameter which have been introduced by Jack [Jac71]. The combinatorial analysis of Jack polynomials has been initiated by Stanley [Sta89] and a first combinatorial interpretation has been given by Knop and Sahi in terms of tableaux [KS97]. A second family of combinatorial objects related to Jack polynomials is given by maps, which are roughly graphs embedded in surfaces. This connection has first been observed in the conjectures of Goulden and Jackson [GJ96a] and important progress has recently been made in this direction [CD22, BDD23] with a first “topological expansion” of Jack polynomials in terms of maps.
Macdonald polynomials are symmetric polynomials introduced by Macdonald in 1989, which depend on two parameters and . Jack polynomials can be obtained from Macdonald polynomials by taking an appropriate limit. Several combinatorial results on Jack polynomials have been generalized to the Macdonald case, in particular, an interpretation in terms of tableaux was established in [HHL05]. However, no connection between Macdonald polynomials and maps is known, even conjecturally.
While Jack polynomials were one of the original inspiration for Macdonald polynomials, the two objects have diverged a bit in recent years, with Jack polynomials being most interesting to those who study probability and maps, while Macdonald polynomials have been studied more in the context of coinvariants and related algebraic geometry (like affine Spinger fibers, Hilbert schemes of points, knot invariants, etc.).
Our hope is to “reunite” Macdonald polynomials and Jack polynomials by showing how Macdonald polynomials are directly connected back to the work of Stanley, Goulden, Jackson, Lassalle, and others on Jack polynomials and their positivity properties.
As a first step towards this “reunification”, we introduce in the present article some new tools that make the parallel between the Jack and Macdonald stories more compelling.
First, we prove a creation formula (Eqs. 4 and 3) for Macdonald polynomials, inspired from the one used in [BDD23] to connect Jack polynomials to maps. Second, we use this formula to introduce a Macdonald analog of Jack characters (Section 1.4). Finally, we formulate a Macdonald version of some Jack conjectures, including Goulden and Jackson’s Matchings-Jack and -conjectures.
1.2. Symmetric functions and plethysm
Consider the graded algebra of symmetric functions in the alphabet with coefficients in . Let and denote the power-sum and the complete symmetric functions in , respectively. We use here a variable to keep track of the degree of the functions, and an extra variable ; all the functions considered are in . Consider the Hall scalar product defined by , where is a numerical factor, see Section 2.1. Let denote the adjoint of multiplication by with respect to .
We will use the plethystic notation: if and then is the image of under the algebra morphism defined by
Set . Notice that for any . Moreover,
We consider the scalar product
In particular
(1) |
Finally, let be the operator such that
i.e. the multiplication by the plethystic exponential
(here denotes the set of integer partitions) and let
be the translation operator, so that . Note that .
1.3. A new formula for Macdonald polynomials
In [BGHT99], the authors introduced a remarkable family of diagonal operators on a modified version of Macdonald polynomials. These operators, known as nabla and delta operators (see Section 3.1), have a rich combinatorial structure and are closely related to the space of diagonal harmonics [Hai02, CM18, HRW18, DM22]. We consider an analog of these operators for the integral form of Macdonald polynomials111We use boldface symbols to distinguish these operators from their relatives from Section 3.1. (denoted ); let and be the operators on symmetric functions defined by
(2) |
where the products run over the cells of the Young diagram of , and where and are defined in Section 2.1.
We also introduce the following operator222This operator is a close relative of the Theta operator in [DR23], first introduced in [DIVW21]. on
The polynomiality of in the variable is a consequence of the Pieri rule.
We can now state our new formula for Macdonald polynomials.
Theorem 1.1.
For any partition , we have
(3) |
It turns out that 1.1 is an easy consequence of the following creation formula.
Theorem 1.2.
For any partition , we have
(4) |
where is a statistic on Young diagrams, see Section 2. In Section 3.4, we prove analogous results for modified Macdonald polynomials (cf. 3.2) from which we deduce Theorems 1.2 and 1.1.
In addition to giving a direct construction of Macdonald polynomials, 1.2 provides a dual approach to study the structure of these polynomials. Indeed, thank to Eq. 4 we can think of as a function in the partition described by the alphabet . This dual approach plays a key role in this paper and is used in Section 4 to introduce a -deformation of the characters of the symmetric group.
1.4. Shifted symmetric functions and Macdonald characters
Kerov and Olshanski have introduced in [KO94] a new approach to study the asymptotic of the characters of the symmetric group, in which the characters are thought of functions in Young diagrams. These functions are known to have a structure of shifted symmetric functions.
This approach has been generalized to the Jack case by Lassalle, who introduced Jack characters in [Las08]. The latter are directly related to the coefficients of Jack polynomials in the power-sum basis and have been useful to understand asymptotic behavior of large Young diagrams sampled with respect to a Jack deformed Plancherel measure [CDM23, DF16]. Recently, a combinatorial interpretation of Jack characters in terms of maps on non orientable surfaces has been proved in [BDD23], answering a positivity conjecture of Lassalle.
We extend here this investigation by introducing Macdonald characters. We start by recalling the definition of -shifted symmetric polynomials, due to Okounkov [Oko98].
Definition 1.3.
We say that a polynomial in variables is (q,t)-shifted symmetric (or simply shifted symmetric) if it is symmetric in the variables
A shifted symmetric function is a sequence of polynomials of bounded degrees, such that for each the function is a shifted symmetric polynomial in variables and which satisfy the following compatibility property
We now use the operator to introduce a two parameter deformation of the characters of the symmetric group.
Definition 1.4.
Fix a partition and an integer . The Macdonald character with variables associated to is the function defined by
(5) |
It turns out that these characters have a structure of shifted symmetric functions.
Theorem 1.5.
Fix a partition . For any , the character is a shifted symmetric polynomial. Moreover, the sequence defines a shifted symmetric function , which will be called the Macdonald character associated to the partition .
Taking an appropriate limit (cf. 5.4), one can recover Jack characters from Macdonald characters, and hence also the characters of the symmetric group.
It follows from 3.2 that Macdonald characters are directly related to the expansion of Macdonald polynomials in the power-sum basis. We use the creation formula of 1.2 to deduce properties of the Macdonald characters which generalize results known in the Jack case.
In particular, we prove that they form a basis of the space of shifted symmetric functions which lead us to introduce their structure coefficients , see 4.4 and Eq. 44. We also make a connection between Macdonald characters and shifted Macdonald polynomials introduced in [Las98, Oko98], see Equations (24) and (28).
Furthermore, Macdonald characters and their structure coefficients seem to have interesting positivity properties which we investigate by introducing a new parametrization for Macdonald polynomials.
1.5. A new parametrization and Macdonald version of some Jack conjectures
In Section 5.1 we introduce a new parametrization for Macdonald polynomials which is related to Jack polynomials, see Eq. 35. We show that this paremetrization gives a natural way to give a Macdonald version of some famous conjectures about Jack polynomials. In particular, we formulate two positivity conjectures about Macdonald characters (see 4) and their structure coefficients (see 9). These conjectures suggest that the characters have a combinatorial structure which generalizes the one given by maps and that we hope to investigate in future works. We also provide a Macdonald generalization of Stanley’s conjecture about the structure coefficients of Jack polynomials, see 3.
In [GJ96a], Goulden and Jackson introduced two conjectures which suggest that two families of coefficients, and , obtained from the expansion of some Jack series satisfy integrality and positivity properties. These conjectures, known as the Matching-Jack conjecture and the -conjecture, have also a combinatorial interpretation related to counting weighted maps on non-orientable surfaces.
The Matching-Jack and the -conjectures are still open despite many partial results [DF16, DF17, CD22, BD22, BD23]. These works involve various techniques including representation theory, random matrices and differential equations.
In Section 5.4, we introduce two families of coefficients and generalizing the coefficients of the Matchings-Jack and the -conjecture. These coefficients are obtained from the expansion of some Macdonald series with the parametrization , see Eqs. 41 and 42.
It turns out that the coefficients are a special case of the structure coefficients of Macdonald characters , see 5.9. We also establish in 5.10 a connection between these coefficients and the super nabla operator recently introduced in [BHIR23].
We hope that our Macdonald generalization of these conjectures could reveal new combinatorial structures of Macdonald polynomials, in particular in connection with the enumeration of maps. Moreover, generalizing the open problems about Jack polynomials (the -conjecture, Stanley’s conjecture…) to the Macdonald setting might provide a new point of view to approach these conjectures, and give the possibility to use the tools provided by the theory of Macdonald polynomials, which do not all have interesting analogues in the Jack story.
1.6. Outline of the paper
The paper is organized as follows. In Section 2, we give some preliminaries and notation related to partitions and Macdonald polynomials. We prove the main theorem in Section 3. We introduce Macdonald characters in Section 4. We introduce several conjectures related to these characters in Section 5.
1.7. Acknowledgments
The first author was partially supported by the LUE DrEAM project of Université de Lorraine. He is also grateful to Valentin Féray and Guillaume Chapuy for many enlightening discussions.
The second author was partially supported by PRIN 2022A7L229 ALTOP, INDAM research group GNSAGA, and ARC grant “From algebra to combinatorics, and back”.
The authors are happy to thank the anonymous referee of an extended abstract of the present work for useful comments.
2. Preliminaries
2.1. Partitions
A partition is a weakly decreasing sequence of positive integers . We denote by the set of all integer partitions. The integer is called the length of and is denoted . The size of is the integer If is the size of , we say that is a partition of and we write . The integers ,…, are called the parts of . For , we denote the number of parts of size in . We then set
We denote by the dominance partial ordering on partitions, defined by
where we set for .
We identify a partition with its Young diagram333One should picture as being a square box in the -entry of a matrix, as it is custom in the English notation of tableaux., defined by
The conjugate partition of , denoted , is the partition associated to the Young diagram obtained by reflecting the diagram of with respect to the line :
Fix a cell . Its arm and leg are respectively given by
Similarly, the co-arm and co-leg are defined by
Finally, let the statistic on Young diagram
2.2. Integral form of Macdonald polynomials:
Macdonald has established the following characterization theorem for Macdonald polynomials.
Theorem 2.1.
The Macdonald polynomials are the unique family of symmetric functions such that
-
•
For any ,
for some coefficients .
-
•
For any partitions and ,
where
(6)
Moreover, for every the set is a basis of .
If is a second alphabet of variables, then Cauchy identity for Macdonald polynomials reads (cf. Eq. 1)
(7) |
Moreover, we have the following plethystic substitution formula for Macdonald polynomials.
Theorem 2.2.
Let be a partition. We write if the diagram is contained in the diagram of . Moreover, we say that is a horizontal strip if and in each column there is at most one cell in and not in . In other terms, for every
Theorem 2.3 (Pieri rule).
Let be a partition and . Then,
for some coefficients , where the sum is taken over partitions such that is a horizontal strip of size . More generally, if is a symmetric function of degree then
for some coefficients , where the sum is taken over the partitions obtained by adding cells to .
3. A new creation formula for Macdonald polynomials
In this section we prove two creation formulas for modified Macdonald polynomials (Theorems 3.3 and 3.2) from which we deduce the creation formulas for the integral forms stated in the introduction.
3.1. Modified Macdonald polynomials
In [GH93], Garsia and Haiman introduced a modified version of Macdonald polynomials
The operators and are respectively defined by
(8) |
(9) |
These operators are related by the five-term relation of Garsia and Mellit [GM19]
(10) |
where . Let
and We state another fundamental identity for Macdonald polynomials, due to Garsia, Haiman and Tesler [GHT01]: for any partition
(11) |
3.2. Creation formula for modified Macdonald polynomials
We start by proving a modified version of 1.2. Set
Remark 2.
Consider the operator introduced in [DIVW21]. Then this operator is related to by
Before proving the main theorem of this subsection, we start by establishing a second expression for the operator .
Lemma 3.1.
We have
Proof.
The operator can be rewritten as follows
Using the five-term relation (10) on each one of the two factors, we obtain
We now prove the first creation formula for modified Macdonald polynomials.
Theorem 3.2.
For partition we have
(12) |
3.3. Vanishing property and second creation formula
The purpose of this subsection is to prove a version of 1.1 for modified Macdonald polynomials.
Theorem 3.3.
For any partition , we have
(14) |
where
We start by stating the Pieri rule for modified Macdonald polynomials, which can be deduced from 2.3 (see [GT96, Proposition 2.7]).
Theorem 3.4 (Pieri rule for ).
Let be a partition and . Then,
for some coefficients , where the sum is taken over partitions such that is a horizontal strip of size .
Combining 3.4 and the definition of (see Eq. 9), we deduce the following formula;
(15) |
where the second sum is taken over partitions such that is a horizontal strip of size . We now consider for each non-negative integer , the subspace of defined by
Remark 3.
Let the cell of coordinates . This cell is characterized by and . Notice that the condition is equivalent to saying that is not a cell of the Young diagram of .
We then have the following proposition.
Proposition 3.5.
Fix two integers.
-
(1)
The space is stabilized by the action of the operator .
-
(2)
If , then as operators on .
Proof.
Fix a partition such that . From Eq. 15, we know that
(16) |
where the sum is taken over horizontal strips of size . Notice that, with the notation of 3, the quantity is 0 if and only if . Moreover, if is a partition such that , then and therefore, does not contribute to the sum in Eq. 16. This proves . If then any horizontal strip of size contains necessarily the cell . This gives (2). ∎
We are now ready to prove 3.3.
Proof of 3.3.
Let and denote respectively the size and the length of . Extracting the coefficient of in Eq. 12, we get
(17) |
Hence,
(18) |
We want to prove that the only tuple which contributes to this sum is First, notice that for each tuple , we obtain by induction and using item (1) of 3.5 that for any we have
(19) |
Moreover, if for some , we have , then from 3.5 item (2) and Eq. 19 we have
(20) |
We deduce that any tuple which is different from does not contribute to the sum of Eq. 18. This completes the proof of the theorem. ∎
3.4. Proof of Theorems 1.2 and 1.1
Consider the transformation on defined by
where are the coefficients of in the power-sum basis. Notice that is invertible and
With this definition, one has
If is an operator on modified Macdonald polynomials, then we define its integral version by the composition
(21) |
In particular,
Lemma 3.6.
For every , we have
Proof.
Fix a symmetric function , where are the coefficients of the expansion of in the power-sum basis and set . Then
completing the proof. ∎
From the previous lemma and the observations above, we deduce that
(22) |
On the other hand, we have the following lemma.
Lemma 3.7.
The following holds
Proof.
Both sides of the equation are clearly homomorphisms of -algebras, hence it is enough to check the identity on the generators : we have
∎
Using this lemma and the remarks above, we deduce Eq. 4 by applying on Eq. 14. In a similar way, we obtain Eq. 3 from Eq. 14, and the following equation from Eq. 13.
(23) | ||||
4. Macdonald characters
4.1. Shifted symmetric Macdonald polynomials
We denote by the algebra of shifted symmetric functions; see 1.3. If is a shifted symmetric function, we consider its evaluation on a Young diagram defined by
It is well known that the space of shifted symmetric functions can be identified to a subspace of functions on Young diagrams through the map
Okounkov introduced a shifted-symmetric generalization of Macdonald polynomials (see also [Kno97, Sah96]).
Theorem 4.1 (Shifted Macdonald polynomials).
[Oko98] Let be a partition. There exists a unique function such that
-
(1)
is shifted symmetric of degree .
-
(2)
(normalization property)
-
(3)
(vanishing property) for any partition
Moreover, the top homogeneous part of is .
Since these polynomials are defined by their zeros, sometimes they are referred to as interpolation polynomials.
As Macdonald polynomials form a basis of , using a triangularity argument we deduce that shifted Macdonald polynomials form a basis of . As a consequence we can linearly extend the map into an isomorphism
(24) |
Remark 5.
Note that it follows from linearity that if is a homogeneous symmetric function, then the top homogeneous part of is equal to .
4.2. An explicit isomorphism between the spaces of symmetric and shifted-symmetric functions
The main purpose of this subsection is to give two explicit formulas for the isomorphism Eq. 24. The first one, Eq. 25, gives the image of a function as a shifted symmetric function while the second formula, Eq. 26, gives this image as a function on Young diagrams. The proof is based on Eq. 4. We start with the following lemma.
Lemma 4.2.
For any symmetric function , and any partition one has
Proof.
From Eq. 4, we know that for any function
Since the operator acts diagonally on the basis of Macdonald polynomials and this basis is orthogonal with respect to the scalar product , the operator is self dual with this scalar product. Moreover, the dual of is . We conclude by specializing . ∎
We have the following theorem.
Theorem 4.3.
For any symmetric function and any , we have
(25) |
Equivalently, for any Young diagram ,
(26) |
Proof.
First, notice that Eq. 25 implies Eq. 26 by 4.2. By definition of the isomorphism , we should prove that for any partition the function
(27) |
satisfies the three properties of 4.1. First, from Eq. 23, we know that for any
and that for any the coefficient
is a homogeneous symmetric function of degree in the variables , with coefficients which are shifted symmetric in This implies that for any symmetric function , the right-hand side of Eq. 25 is a well defined shifted symmetric function in the variables . All this gives property .
In order to obtain property , we use 4.2 with . We get that
Here we used Eq. 2, and the fact that . This corresponds to property . Finally, for any partitions and , one has
But from 2.3, we know that the coefficient of in is zero unless . This proves that (27) satisfies property , completing the proof of the theorem. ∎
Remark 6.
The isomorphism given in Eq. 26 has been implicitly described by Lassalle, see [Las98, Definition 1]. However, the formula of Eq. 25 seems to be new. Note that these two formulas are complementary since Eq. 25 gives the shifted symmetry property while Eq. 26 is more suitable to prove the vanishing conditions.
4.3. Macdonald characters are shifted symmetric
Recall the definition from 1.5 of Macdonald characters, i.e.
We are now ready to prove 1.5.
Proof of 1.5.
By definition, for any
In particular, defines a shifted symmetric function. ∎
We deduce the following corollary.
Corollary 4.4.
The Macdonald characters form a basis of .
Proof.
From the definition of and 4.3 we have
(28) |
We conclude using the fact is basis of and that is an isomorphism between and . ∎
From Eq. 26, we get that for any Young diagram
(29) |
This can be rewritten as
Hence,
(30) |
In particular,, when the characters are given by the power-sum expansion of :
(31) |
4.4. Characterization theorem
We give here a characterization theorem for . This characterization has been observed by Féray in the case of Jack polynomials and proved very useful in practice (see [BDD23]). It can be seen as an analog of 4.1 for characters.
Theorem 4.5.
Let be a partition. is the unique function which satisfies the following properties.
-
(1)
is shifted symmetric of degree .
-
(2)
for any partition .
-
(3)
the top homogeneous part of is
The proof is very similar. We start by the following lemma.
Lemma 4.6.
Let . If is shifted symmetric function of degree less or equal to with
(32) |
Then .
Proof.
We expand in the basis
(33) |
As the sum can be restricted to partitions of size at most . We will prove by contradiction that , i.e. that for all partitions with . Assume this is not the case and consider a partition of minimal size such that . Eq. 32 gives since . On the other hand, if does not contain (see property (3) of 4.1). Therefore the right hand side of Eq. 33 evaluated on vanishes for all partitions except for . Moreover, by the assumptions and from property (2) of 4.1. Therefore , and we have reached a contradiction. Hence, as required. ∎
We now prove the characterization theorem.
Proof of 4.5.
We start by proving that satisfies these three properties. The first property is given in 1.5, and from 5, we know that its top homogeneous part is . Moreover, is a linear combination of for of size . This gives the vanishing property.
Let us now prove the uniqueness. Let be a shifted symmetric function of degree with the same top degree part as , and such that for any . Set . Then is a shifted symmetric function of degree at most with Using 4.6 we get that hence which gives the uniqueness. ∎
4.5. Positivity conjectures about the characters
We conclude this section with some intriguing positivity conjectures about the operator .
Conjecture 1.
The operator acts positively on the basis in the variables . More precisely, if and are two partitions such that , then
is a polynomial in the variables with non-negative integer coefficients.
This conjecture has been tested for . We have the following consequence of 1 which is closely related to a conjecture about Macdonald characters we formulate in the next section; see 4.
Proposition 4.7.
1 implies that is a polynomial in the variables and the parameters and with non-negative coefficients.
Proof.
Let us assume that 1 holds. We want to prove by induction on that for any
has a positive polynomial expansion on the basis This would imply the claim of the proposition by the definition of Macdonald characters Eq. 5. For this is a direct consequence of 1. We assume now that the induction assumption holds for . We then get that
also has positive expansion. Applying on the left and using 1, we obtain that
has positive expansion on In particular this is also the case for
Since this holds true for any , we deduce the induction hypothesis for . ∎
5. Macdonald versions for some Jack conjectures
Jack polynomials are symmetric functions which depend on a deformation parameter . We briefly present here some of the most important results and conjectures related to Jack polynomials. We then introduce a new change of variables which allows us to generalize these conjectures to Macdonald polynomials.
The section is organized as follows. In Section 5.1, we recall the definition of Jack polynomials and we introduce a new parametrization of Macdonald polynomials which is directly related to Jack polynomials. We then discuss Macdonald generalizations of Stanley’s and Lassalle’s conjectures in Sections 5.2 and 5.3 respectively. The rest of the subsections are dedicated to discuss a generalization of Goulden–Jackson’s Matchings-Jack and -conjectures. In Section 5.4 we state the generalized conjectures. We then discuss in Section 5.5 the connection of the generalized Matching-Jack conjecture to the structure coefficients of Macdonald characters and we give a reformulation of this conjecture in Section 5.6 with the super nabla operator. We finally discuss some special cases of these conjectures in Section 5.7.
5.1. Jack polynomials and a new normalization of Macdonald polynomials
Jack polynomials can be obtained from the integral form of Macdonald polynomials as follows (see [Mac95, Chapter VI, eq (10.23)])
(34) |
We denote the , the scalar product defined on power-sum functions by
Jack polynomials are orthogonal with respect to this scalar product. We denote by their squared norm, i.e.
We consider the following normalization of Macdonald polynomials
In the following, the parameters will be always related to by
(35) |
Note that from Eq. 34, we get
(36) |
Unlike the functions , the normalized functions are positive in the monomial basis.
Proposition 5.1.
The coefficient of in the monomial basis are polynomial in and with non-negative integer coefficients.
Proof.
This can be easily obtained from the combinatorial interpretation given in [HHL05, Proposition 8.1] for . ∎
Our new -reparametrization of Macdonald polynomials will allow us to formulate Macdonald generalizations of Stanley, Lassalle and Goulden–Jackson’s conjectures. In the following, we recall these conjectures in the Jack case and we then state their Macdonald generalizations.
5.2. Stanley’s conjecture
5.2.1. Jack case
In his seminal work [Sta89], Stanley formulated the following positivity conjecture about the structure coefficients of Jack polynomials (see [Sta89, Conjecture 8.5]).
Conjecture 2.
This conjecture is wide open, and an analog for Shifted Jack polynomials has been proposed in [AF19].
5.2.2. Macdonald generalization
Conjecture 3 (Macdonald version of Stanley’s conjecture).
For any partitions the quantity
is a polynomial in the parameters and with non-negative integer coefficients.
This conjecture has been tested for . Stanley’s conjecture corresponds to the case of 3.
5.3. Lassalle’s conjecture
5.3.1. Jack case
Jack characters have been introduced by Lassalle [Las08] as a one parameter deformation of the characters of the symmetric group.
Definition 5.2 (Jack characters).
Fix a partition . The Jack character is the function on Young diagrams defined by
Lassalle’s conjecture, formulated in [Las08] and proved in [BDD23], suggests that the character is a positive polynomial in , and some coordinates of called multirectangular coordinates. We are here interested in a weak version of this result, which we generalize to the Macdonald case.
Theorem 5.3 ([BDD23]).
Fix a partition . The normalized Jack character is a polynomial in the variables with non-negative integer coefficients.
5.3.2. Macdonald generalization
We start by introducing a normalization of Macdonald characters which is directly related to Jack characters.
(37) |
Note that is symmetric in the variables . For any partition , we denote
(38) |
Hence,
(39) |
In particular, when the characters are given by the expansion
(40) |
The Jack normalization of Macdonald characters are related to Jack characters by the following proposition.
Proposition 5.4.
For any partitions and , we have
Proof.
Since as , and the operator acts on a homogeneous functions of degree as a multiplication by . Moreover,
Eq. 39 allows to conclude.∎
Remark 7.
Actually, coincides also as a polynomial in the variables with the Jack character . This can be shown using the previous proposition and the fact that is symmetric in the variables .
These characters seem to satisfy the following conjecture, tested for and .
Conjecture 4.
Fix and . Then, is a polynomial in with non-negative integer coefficients.
5.4. Goulden and Jackson’s conjectures
5.4.1. Jack case
We start by recalling the Matching-Jack and -conjectures formulated by Goulden and Jackson in [GJ96a] for Jack polynomials. Let and be two additional alphabets of variables. We consider the two families of coefficients and indexed by partitions of the same size and defined by
For (resp. ), the series above are known to count bipartite graphs on orientable surfaces (resp. surfaces orientable or not) called maps, see [GJ96b]. Goulden and Jackson have formulated the following two conjectures; see [GJ96a, Conjecture 3.5] and [GJ96a, Conjecture 6.2].
Conjecture 5 ( Matchings-Jack conjecture [GJ96a]).
The coefficients are polynomials in the parameter with non-negative integer coefficient.
Conjecture 6 (-conjecture [GJ96a]).
The coefficients are polynomials in the parameter with non-negative integer coefficient.
These two conjectures have combinatorial reformulations in terms of maps counted with “non-orientability” weights. As mentioned in the introduction both of the conjectures are still open. The integrality part in the Matchings-Jack conjecture has been proved in [BD23] and will be useful in the next subsection.
Theorem 5.5.
[BD23] For any partitions , the coefficient is a polynomial in with integer coefficients.
5.4.2. Macdonald generalization
We define the coefficients and for partitions and of the same size by
(41) |
Conjecture 7 (A Macdonald generalization of the Matchings-Jack conjecture).
For any positive integer and partitions of , the quantity
is a polynomial in and with non-negative integer coefficients.
Conjecture 8 (A Macdonald generalization of the -conjecture).
For any positive integer and partitions of , the quantity
is a polynomial in and with non-negative integer coefficients.
Remark 8.
In Equations 41 and Eq. 42 it seems possible to change the factor by for some and the conjectures above still hold. However, we will prove in Section 5.5 that for the specific choice of , the coefficients are a special case of the structure coefficients of the characters . This implies that in some sense these coefficients are a natural two parameters generalization of the coefficients considered by Goulden and Jackson and justifies the factor which appears in the previous definitions.
Proposition 5.6.
5.5. Connection with the Structure coefficients of Macdonald characters
In this subsection, we consider the structure coefficients of Macdonald characters, and we prove that in some sense they generalize the coefficients considered in Section 5.4.2.
Note that is obtained from by a normalization by a scalar and a change of variables (see Eq. 38), hence their structure coefficients are well defined:
(44) |
It follows from 5.4 that the coefficients are a two parameter generalization of structure coefficients of Jack characters introduced by Dołe˛ga and Féray in [DF16] (see also [Śni19]):
In the following, we will prove that in the case the coefficients coincide with the coefficients defined in Section 5.4.2. The proof is very similar to the one given in [DF16] for the Jack case. We start by proving some properties of the coefficients .
Lemma 5.7.
The coefficient is 0 unless
Proof.
The upper bound is a consequence of the fact that is a shifted symmetric function of degree and that is a basis of the space of shifted symmetric functions of degree less or equal than . On the other hand, for any partition such that , one has by the vanishing condition that , and also that
Combining these two equations with Eq. 44, we get that
But is a shifted symmetric function of degree smaller than . Using 4.6, we deduce that it is identically equal to 0, therefore for any . ∎
We deduce the following corollary.
Corollary 5.8.
Fix a positive integer and three partitions . Then
We then have the following proposition.
Proposition 5.9.
Let and be three partitions of the same size . Then
Proof.
We introduce for each the two generating series
and
We want to prove that these two series are equal. From the definition of the coefficients and Eq. 40 we have
Using 5.8, we get that
(45) |
On the other hand, using the fact that both Macdonald polynomials and the power-sum functions are orthogonal families, Eq. 40 can be inverted as follows
Hence, Eq. 45 becomes
This is precisely the series , which concludes the proof of the proposition. ∎
Let be the function defined on tuples of non-negative integers by
where
We consider the following conjecture.
Conjecture 9.
Let be three partitions. Then, the normalized coefficients
are polynomials in and with non-negative integer coefficients.
5.6. Reformulation with the super nabla operator
The super nabla operator has been recently introduced in [BHIR23]. It is defined by its action on modified Macdonald polynomials
where is a second alphabet of variables. We consider here the integral version of this operator defined by
Proposition 5.10.
Let .
Proof.
Let be a third alphabet of variables, and let and denote respectively the nabla and the super nabla operators acting on the space of symmetric functions in the alphabet . Using the fact that power-sum functions form an orthogonal basis, one has
where the scalar product is taken with respect to the alphabet . But using the Cauchy identity Eq. 7 we get
Using the fact that the nabla operators are self-dual, we get
5.7. Special cases in 7
In this subsection, we discuss some particular cases in 7, respectively related to marginals sums and to the specialization .
5.7.1. Marginal sums
We recall the usual -notation. We set
for any and . It is well known that all these quantities are polynomials in with non-negative integer coefficients. Finally, if is a parameter then
Lemma 5.11.
Let be a partition of size . Then,
Proof.
The first part of the equation is direct from the definitions. To obtain the second one we take in 2.2. ∎
For a proof of the following lemma, see [Mac95, Chapter VI, Section 8, Example 1].
Lemma 5.12.
For every ,
Proposition 5.13.
Let
Corollary 5.14.
For any and ,
is a polynomial with non-negative integer coefficients in and .
Proof.
From 5.13, we get
But Hence,
Note that is divisible by the binomial Hence, is a positive polynomial in , and by consequence in and . This finishes the proof. ∎
5.7.2. Integrality for the case
When (equivalently , Macdonald polynomials are Schur functions up to a scalar factor, (see [Mac95, Chapter VI, Remark 8.4])
where as usual, and where
is a -deformation of the hook product. Moreover, it follows from Eq. 6 and Eq. 43 that
We recall that the expansion of Schur functions in the power-sum basis are given by the irreducible characters of the symmetric group , see e.g [Mac95, Chapter I]
Hence we obtain the following formula for the coefficient of the generalized Matchings-Jack conjecture.
Proposition 5.15.
For any partitions and , one has
We deduce the integrality of the coefficients in the parameter .
Corollary 5.16.
For any partitions and of size , the normalized coefficient
is a polynomial with integer coefficients in .
Proof.
We use 5.15 and the fact that is minimal when and the corresponding minimum is ∎
References
- [AF19] Per Alexandersson and Valentin Féray, A positivity conjecture on the structure constants of shifted Jack functions, preprint arXiv:1912.05203, (2019).
- [BD22] Houcine Ben Dali, Generating series of non-oriented constellations and marginal sums in the Matching-Jack conjecture, Algebr. Comb. 5 (2022), no. 6, 1299–1336.
- [BD23] by same author, Integrality in the Matching-Jack conjecture and the Farahat-Higman algebra, Transactions of the American Mathematical Society 376 (2023), no. 05, 3641–3662.
- [BDD23] Houcine Ben Dali and Maciej Dołęga, Positive formula for Jack polynomials, Jack characters and proof of Lassalle’s conjecture, preprint arXiv:2305.07966, (2023).
- [BGHT99] François Bergeron, Adriano M Garsia, Mark Haiman, and Glenn Tesler, Identities and positivity conjectures for some remarkable operators in the theory of symmetric functions, Methods and applications of analysis 6 (1999), no. 3, 363–420.
- [BHIR23] François Bergeron, Jim Haglund, Alessandro Iraci, and Marino Romero, The super nabla operator, preprint arXiv:2303.00560, (2023).
- [CD22] Guillaume Chapuy and Maciej Dołęga, Non-orientable branched coverings, -Hurwitz numbers, and positivity for multiparametric Jack expansions, Adv. Math. 409 (2022), no. part A, Paper No. 108645, 72. MR 4477016
- [CDM23] Cesar Cuenca, Maciej Dołęga, and Alexander Moll, Universality of global asymptotics of Jack-deformed random Young diagrams at varying temperatures, Preprint arXiv:2304.04089, 2023.
- [CM18] Erik Carlsson and Anton Mellit, A proof of the shuffle conjecture, J. Amer. Math. Soc. 31 (2018), no. 3, 661–697. MR 3787405
- [DF16] Maciej Dołęga and Valentin Féray, Gaussian fluctuations of Young diagrams and structure constants of Jack characters, Duke Math. J. 165 (2016), no. 7, 1193–1282. MR 3498866
- [DF17] Maciej Dołęga and Valentin Féray, Cumulants of Jack symmetric functions and the -conjecture, Trans. Amer. Math. Soc. 369 (2017), no. 12, 9015–9039. MR 3710651
- [DIVW21] Michele D’Adderio, Alessandro Iraci, and Anna Vanden Wyngaerd, Theta operators, refined delta conjectures, and coinvariants, Adv. Math. 376 (2021), Paper No. 107447, 59. MR 4178919
- [DM22] Michele D’Adderio and Anton Mellit, A proof of the compositional Delta conjecture, Advances in Mathematics 402 (2022), 108342.
- [DR23] Michele D’Adderio and Marino Romero, New identities for Theta operators, Transactions of the American Mathematical Society 376 (2023), no. 8, 5775–5807.
- [GH93] A. Garsia and M. Haiman, A graded representation model for Macdonald’s polynomials, Proc. Nat. Acad. Sci. U.S.A. 90 (1993), no. 8, 3607–3610. MR 1214091
- [GHT01] Adriano M Garsia, Mark Haiman, and Glenn Tesler, Explicit plethystic formulas for Macdonald q, t-Kostka coefficients, The Andrews Festschrift: Seventeen Papers on Classical Number Theory and Combinatorics, Springer, 2001, pp. 253–297.
- [GJ96a] I. P. Goulden and D. M. Jackson, Connection coefficients, matchings, maps and combinatorial conjectures for Jack symmetric functions, Trans. Amer. Math. Soc. 348 (1996), no. 3, 873–892. MR 1325917 (96m:05196)
- [GJ96b] by same author, Maps in locally orientable surfaces, the double coset algebra, and zonal polynomials, Canad. J. Math. 48 (1996), no. 3, 569–584. MR 1402328 (97h:05051)
- [GM19] Adriano Garsia and Anton Mellit, Five-term relation and Macdonald polynomials, Journal of Combinatorial Theory, Series A 163 (2019), 182–194.
- [GT96] A. M. Garsia and G. Tesler, Plethystic formulas for Macdonald -Kostka coefficients, Adv. Math. 123 (1996), no. 2, 144–222. MR 1420484
- [Hai02] Mark Haiman, Vanishing theorems and character formulas for the hilbert scheme of points in the plane, Inventiones mathematicae 149 (2002), 371–407.
- [HHL05] J. Haglund, M. Haiman, and N. Loehr, A combinatorial formula for Macdonald polynomials, J. Amer. Math. Soc. 18 (2005), no. 3, 735–761. MR 2138143
- [HRW18] J. Haglund, J. B. Remmel, and A. T. Wilson, The delta conjecture, Trans. Amer. Math. Soc. 370 (2018), no. 6, 4029–4057. MR 3811519
- [Jac71] Henry Jack, A class of symmetric polynomials with a parameter, Proc. Roy. Soc. Edinburgh Sect. A 69 (1970/1971), 1–18. MR MR0289462 (44 #6652)
- [Kno97] Friedrich Knop, Symmetric and non-symmetric quantum Capelli polynomials, Comment. Math. Helv. 72 (1997), no. 1, 84–100.
- [KO94] Sergei Kerov and Grigori Olshanski, Polynomial functions on the set of Young diagrams, C. R. Acad. Sci. Paris Sér. I Math. 319 (1994), no. 2, 121–126. MR MR1288389 (95f:05116)
- [KS97] Friedrich Knop and Siddhartha Sahi, A recursion and a combinatorial formula for Jack polynomials, Invent. Math. 128 (1997), no. 1, 9–22. MR 1437493
- [Las98] Michel Lassalle, Coefficients binomiaux généralisés et polynômes de Macdonald, J. Funct. Anal. 158 (1998), no. 2, 289–324.
- [Las08] by same author, A positivity conjecture for Jack polynomials, Math. Res. Lett. 15 (2008), no. 4, 661–681. MR 2424904
- [Mac95] I. G. Macdonald, Symmetric functions and Hall polynomials, second ed., Oxford Mathematical Monographs, The Clarendon Press Oxford University Press, New York, 1995, With contributions by A. Zelevinsky, Oxford Science Publications. MR 1354144
- [Oko98] Andrei Okounkov, (Shifted) Macdonald polynomials: -integral representation and combinatorial formula, Compositio Math. 112 (1998), no. 2, 147–182. MR MR1626029 (99h:05120)
- [Sah96] Siddhartha Sahi, Interpolation, integrality, and a generalization of Macdonald’s polynomials, Internat. Math. Res. Notices 1996 (1996), no. 10, 457–471.
- [Śni19] Piotr Śniady, Asymptotics of Jack characters, J. Combin. Theory Ser. A 166 (2019), 91–143. MR 3921039
- [Sta89] Richard P. Stanley, Some combinatorial properties of Jack symmetric functions, Adv. Math. 77 (1989), no. 1, 76–115. MR 1014073 (90g:05020)