Kerov functions for composite representations and Macdonald ideal
A. Mironov, A. Morozov

TL;DR
This paper explores Kerov functions, a broad generalization of Macdonald polynomials, focusing on their behavior for conjugate and composite Young diagram representations, especially at the Macdonald locus where formulas simplify.
Contribution
It analyzes the structure of Kerov functions for composite representations and examines the special properties and simplifications at the Macdonald locus.
Findings
Simplified formulas at the Macdonald locus for conjugate and composite representations
Deviations from Schur functions highlight challenges in link hyperpolynomial theory
Complex N-dependence in Kerov functions compared to the uniformization in Macdonald case
Abstract
Kerov functions provide an infinite-parametric deformation of the set of Schur functions, which is a far-going generalization of the 2-parametric Macdonald deformation. In this paper, we concentrate on a particular subject: on Kerov functions labeled by the Young diagrams associated with the conjugate and, more generally, composite representations. Our description highlights peculiarities of the Macdonald locus (ideal) in the space of the Kerov parameters, where some formulas and relations get drastically simplified. However, even in this case, they substantially deviate from the Schur case, which illustrates the problems encountered in the theory of link hyperpolynomials. An important additional feature of the Macdonald case is uniformization, a possibility of capturing the dependence on for symmetric polynomials of variables into a single variable , while in the generic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Kerov functions for composite representations and Macdonald ideal
A.Mironova,b,c[email protected]; [email protected] and A.Morozovb,c [email protected]
Abstract
Kerov functions provide an infinite-parametric deformation of the set of Schur functions, which is a far-going generalization of the 2-parametric Macdonald deformation. In this paper, we concentrate on a particular subject: on Kerov functions labeled by the Young diagrams associated with the conjugate and, more generally, composite representations. Our description highlights peculiarities of the Macdonald locus (ideal) in the space of the Kerov parameters, where some formulas and relations get drastically simplified. However, even in this case, they substantially deviate from the Schur case, which illustrates the problems encountered in the theory of link hyperpolynomials. An important additional feature of the Macdonald case is uniformization, a possibility of capturing the dependence on for symmetric polynomials of variables into a single variable , while in the generic Kerov case the -dependence looks considerably more involved.
FIAN/TD-01/19
IITP/TH-03/19
ITEP/TH-03/19
a *Lebedev Physics Institute, Moscow 119991, Russia
b* *ITEP, Moscow 117218, Russia
c* Institute for Information Transmission Problems, Moscow 127994, Russia
1 Introduction
In this paper, we continue our study of theory of Kerov functions222The Kerov function should not be confused with much better known ”Kerov character polynomials”, also associated with the name of S.Kerov [1]: to avoid the confusion, we use the term functions throughout the present text. [2, 3, 4] and their applications. We give a brief summary of the issues already reviewed in [6] and proceed to the very important set of questions related to the Kerov functions labeled by the Young diagrams associated with the conjugate and, more generally, composite representations. Though, in the Kerov case, literal representation theory does not work, for the sake of simplicity, we refer to these Kerov functions as associated with composite representation. They are important in all applications, especially in the theory of topological vertices. As we shall see, simplicity of this story in the non-refined case, i.e. for the Schur polynomials, was actually due to a very simple conjugation rule
[TABLE]
which has a natural lifting to composite representations in the form of the Koike formula [7, 8, 9],
[TABLE]
Here is the matrix defining the -dimensional Miwa locus in the space of ordinary time variables , and are the Young diagrams, and similarly for , and is the conjugate of . The Schur polynomials are symmetric functions of the eigenvalues of the matrix [10, 11].
Our goal is to describe a Kerov version of these formulas, and the result is that the sum at the r.h.s. of (2) extends to a double sum over all the subdiagrams, and generically this is true not only for the Kerov functions, but also for the Macdonald polynomials [10], though the formulas in the latter case are much simpler. These extra terms cause problems for the refined version of [12], i.e. for constructing non-torus hyperpolynomials for the simplest link from conventional refined topological vertex of [13].
More than that, even the Kerov counterpart of (1) acquires a full-fledged sum at the r.h.s. over all the Young diagrams of the size (number of boxes) . In variance with (2), this effect disappears on the Macdonald locus, and this is an example of the situation, where the Macdonald polynomials are simpler than the generic Kerov ones. However, after a minor change of the question: how to get from (1) to (2) the simplicity disappears, at least partly. Of course, simpler-looking are also particular coefficients in the Macdonald deformation of (2). However, this may depend on the choice of notation: it is not very clear what kind of properties of these coefficients is truly simplified.
We describe only one of such properties in addition to above-mentioned nullification of some coefficients, the uniformization [14], i.e. a possibility of capturing the -dependence into a single parameter , on which the coefficients depend rationally like on all other parameters. As explained in [6], the Kerov functions can be considered as depending on two sets of variables, which in many respects are similar: . The Macdonald locus is given by the relations , where, hereafter, we use the notation , and plays for the -variables the same role as the topological locus does for the -variables, thus one can expect various factorizations to occur, and this is what really happens and leads to uniformization of the coefficients. However, an explicit description of duality is still out of reach, and a systematic conversion of -properties into -properties is not yet available.
Of course, all this requires re-thinking and insights, we just make a first step in this direction and do not pretend to put the right accents on various observations we make. We begin in sec.2 with reminding different issues relevant for our discussion. The two auxiliary sections 3 and 4 are devoted to the two important aspects of the generalizations: to denominator functions and to description of Macdonald locus as an ideal in the space of -polynomials. Then sec.5 and 6 discuss Kerov and Macdonald generalizations of the Koike formulas (1) and (2). All these results, summarized in sec.7 are largely speculative but already challenging. They call for a deep study and understanding.
2 Definitions and summaries
2.1 Kerov functions. Summary
2.1.1 Definitions
Kerov functions are symmetric functions (polynomials) of variables (eigenvalues of a matrix ), or, equivalently, of time variables , hence they are labeled by Young diagrams, the degree of the polynomial being size of the Young diagram . They are also rational functions of the infinite set of parameters and depend on the first of them.
Following [2] and [6], we define a pair of Kerov functions as triangular combinations of Schur functions in two different orderings of Young diagrams,
[TABLE]
Here we denote the transposition of the Young diagram , the sign refers to the lexicographical ordering,
[TABLE]
and the two summation rules in (6) begin to deviate from each other from level , when there is a pair of Young diagrams, , for which .
The Macdonald-Kostka coefficients in (6) are defined iteratively in and from the orthogonality conditions
[TABLE]
w.r.t. the scalar product
[TABLE]
i.e. from the Gauss decomposition of the matrix
[TABLE]
or any of its powers, positive or negative,
[TABLE]
Here are the characters of symmetric group and with the Young diagram \Delta=\big{[}\delta_{1}\geq\delta_{2}\geq\ldots\geq\delta_{l_{\Delta}}\big{]}, one associates a monomial . The variables parameterize the measure that defines the Kerov functions. The combinatorial factor is best defined in the dual parametrization of the Young diagram, \Delta=\big{[}\ldots,2^{m_{2}},1^{m_{1}}\big{]}, then . Note that the normalization of is already fixed by the choice of unit diagonal coefficient (the first term) in (6), , so that the norm is a deducible quantity.
We refer to [6] for a comprehensive collection of properties of Kerov functions (i.e. to the Kerov lifting of all the relevant properties of the Schur polynomials). In the rest of this subsection, we mention some of them in the form suited for the discussion in the present paper.
2.1.2 Denominator functions
In Kerov calculus, one associate with each Young diagram the four numbers:
[TABLE]
i.e. , , where is the number of partitions at level .
Since the Kerov functions are rational functions of , the first special functions in Kerov calculus are their denominators: and . The shape of these functions is actually controlled by the numbers (see sec.3.1 for an explicit example):
[TABLE]
Of course, differs from only when . Denominator functions are positive integer polynomials of (modulo simple factorial multipliers), the first of them are:
[TABLE]
so that
[TABLE]
As is clear from these examples, the structure of numerators is similar to the corresponding , but they depend also on -variables and thus on the shape of in order to reproduce the Schur functions when all .
The table of {\rm deg}\Big{(}\Delta_{r}^{(\nu)}\Big{)} and {\rm deg}\Big{(}\hat{\Delta}_{r}^{(\nu)}\Big{)} looks as follows (when the two numbers do not coincide we indicate {\rm deg}\Big{(}\Delta_{r}^{(\nu)}\Big{)}/{\rm deg}\Big{(}\hat{\Delta}_{r}^{(\nu)}\Big{)}):
[TABLE]
At level 8 the degree is given only for the first set of Kerov functions.
Note that these denominator polynomials have these degrees only upon most of independent: choosing just a few (for an arbitrary ) makes degree of the denominator polynomial lower. E.g. the denominator of reaches the degree 30 only at most . Adding, say, decrease the degree of the denominator. This illustrates a strong correlation between numerators and denominators of the Kerov functions.
2.1.3 Transposition rule
It is a straightforward generalization of the transposition rule for the Schur functions: , but involves inversion of the parameters and a switch between the two functions in (6):
[TABLE]
In other words, it relates Kerov functions with . Remarkably, formulas (13) in s.2.1.2 imply the existence of a far more interesting relation between the functions with , which still remains to be brought to a simple form like (20).
2.1.4 Skew Schur functions
and multiplication rule
Like the skew Schur polynomials, the skew Kerov functions for ordinary representations are defined as functions of arbitrary time-variables and can be defined from the decomposition of the functions depending on the sum of time variables:
[TABLE]
They can be obtained by linear combination from the ordinary Kerov functions:
[TABLE]
where are the -dependent Kerov Littlewood-Richardson coefficients, i.e. the structure constants in the multiplication rule of the second set of Kerov functions
[TABLE]
and the sums are rather restricted, since the Kerov Littlewood-Richardson coefficients are non-zero only in between the partitions and .
Similarly, one can define the second set of skew Kerov functions with a decomposition formula like (21). Then, (22) is replaced with the formula for the second Kerov set, where the structure constants are taken for the first Kerov set, .
Note that the dual skew Kerov functions,
[TABLE]
are decomposed with themselves:
[TABLE]
2.1.5 Cauchy summation formula
The Cauchy summation formula remains true for arbitrary Kerov functions
[TABLE]
and, more generally,
[TABLE]
where the sum over at the r.h.s. contains only finitely many terms.
2.2 Topological locus and its deformations
2.2.1 Peculiarities of the Macdonald case
If one chooses restricted to be , the Kerov functions reduces to the Macdonald polynomials, which enjoy a series of peculiar properties. The basic ones are:
- (i)
the Macdonald-Kostka coefficients between the Young diagrams with different sequence numbers in two orderings in (6) is equal to zero;
- (ii)
some generically non-zero structure constants vanish in the Macdonald case;
- (iii)
uniformization.
Property (i) means that the Macdonald polynomials do not depend on choosing the ordering in (6), i.e. the two sets of Kerov functions coincide on the Macdonald locus . In fact, one can prove that they coincide if and only if ’s are restricted to the Macdonald locus.
Property (ii) can be important for precise correspondence with representation theory of finite-dimensional Lie algebras: for example, the summation domain in multiplication rule (23) is additionally limited by the decomposition rule of the tensor product of representations of group : only on the Macdonald locus, beyond it all the Kerov Littlewood-Richardson coefficients in (23) are non-vanishing. One can again prove that this restriction to the decomposition rule for representations emerges if and only if are put on the Macdonald locus.
The third property (iii), uniformization is a possibility of capturing the dependence of polynomials in conjugate, and, more generally, in composite representations of into a single parameter , on which the coefficients depend rationally like on all other parameters. We will discuss property (iii) in detail in sec.6.
In Kerov theory, a useful look at the Macdonald choice of parameters is to notice its close relation to a very different subject, the topological locus for -variables. Among other things, and together with them this sheds some light on the factorizations and other apparent simplifications of many formulas in the Macdonald case. This also shows the way to understand what happens away of it.
2.2.2 Topological locus and Macdonald locus
Since these two loci are going to play a special in this paper, we remind them once again.
Topological locus (TL) is a specialization of the ordinary time variables
[TABLE]
and it is the two-dimensional variety in the entire infinite dimensional space of time variables where the Schur functions factorize:
[TABLE]
where is length of the hook . For , this is a well-known hook formula for the quantum dimensions of representation of . In knot theory, the quantum dimensions are interpreted as values of the unreduced colored Hopf polynomial for the unknot.
Macdonald locus (ML) is actually the same specialization, but in the space of Kerov variables :
[TABLE]
with playing the role of . Accordingly, the -dependent Schur functions, from which the Kostka coefficients and other ingredients of Kerov functions are made, factorize on this locus:
[TABLE]
The Kerov functions depend on two sets of time variables, , and when are restricted to the Macdonald locus, they turn into the Macdonald functions of only, which explicitly depend on and :
[TABLE]
An additional non-trivial fact is that, like the Schur polynomials, these are also factorized on the topological locus, provided is the same in (28) and (30), i.e. the Kerov functions factorize also on the intersection of these two loci: a 3-dimensional variety in which we call Macdonald topological locus (MTL):
[TABLE]
These quantities explicitly described by the above hook formula are often called Macdonald dimensions, and they provide expressions for the unreduced colored hyper-polynomials for the unknot. After a peculiar change of variables , , , which changes sign from minus to plus in the differences (“differentials”) , they are interpreted as (unreduced) super-polynomials for the unknot.
2.2.3 Kerov and Macdonald functions on the Miwa locus
Topological locus (28) is a 2-dimensional sub-variety of an -dimensional Miwa locus , on which the Schur, Macdonald and Kerov functions are usually studied in the theory of symmetric functions, their restrictions to Miwa locus are then denoted through
[TABLE]
It plays a very important role in the present paper, because it is the place where these functions are naturally defined in -dependent conjugate and composite representations.
Surviving on Miwa locus are only the Schur functions with . The same remains true for the Macdonald polynomials. However, this is not always true for the first set of Kerov functions: for example, already at for , at for , at for etc. Similarly, at for , at for , at for etc.
The reason for this is that the lexicographic ordering does not imply that for , and, therefore, (6) for with can include contributions from with and, in result, does not vanish on the Miwa locus for .
At the same time, the second ordering implies that for , and whenever for the second set of Kerov functions because of the corresponding property of the Schur functions.
2.2.4 Diagram-dependent deformation of topological locus
It is sometimes convenient to use a different view on the Miwa locus and a different way to way to introduce it: the discussion of the previous subsection implies a natural association of the Miwa variables with lines of a Young diagram [9]. More concretely, we define the deformation of topological locus by a Young diagram :
[TABLE]
and
[TABLE]
In fact, it can be further promoted to
[TABLE]
and
[TABLE]
since do not need to be made from exponentials of the ordered integers . Lifting (36) to composite representations is also straightforward:
[TABLE]
The factors in all these definitions correspond to using the Miwa variable formalism with
[TABLE]
The meaning of this deformed topological locus is not that immediate, however, it is the central ingredient of the character realization for the Hopf HOMFLY-PT polynomial [15]: the topological peculiarity of the Hopf link [16, 9] implies that
[TABLE]
and at is the argument of this Schur polynomial,
[TABLE]
Then (39) appears in the description of composite representations . See [9] for detailed discussion and references.
Surprisingly or not, the -deformation of deformed locus is straightforward.
2.3 Composite representations
The composite representation is the most general finite-dimensional irreducible highest weight representations of [7, 17, 19], which are associated with the -dependent Young diagram
[TABLE]
\vdots$$\vdots$$\vdots$$\ldots$$\ldots$$\ldots$$\ldots$$\bar{S}$$R$$\check{S}$$h_{S}=l_{S^{\vee}}=s_{{}_{1}}$$N$$l_{R}$$l_{\!{}_{S}}$$\ldots$$\ldots$$\ldots
The ordinary -independent representations in this notation are , there conjugate are . The simplest of non-trivial composites is the adjoint . Vogel’s universality [20], providing a unified description of representation theory of all simple Lie algebras at once (as well as of something else) is applicable precisely to the adjoint and its descendants (the “-sector”), i.e. is one of the many topics requiring knowledge of the composites. In knot theory, the composite representations appear in the study of counter-strand braids, which are one of the most convenient building blocks in the tangle calculus [21].
The basic special function associated with representation is its character expressed through the Schur functions . For composite representations, one needs their generalization, composite Schur functions [9]. Because of explicit dependence, they are not easy to define for arbitrary (generic) values of time-variable . Fortunately, in most applications we need their reductions to just -dimensional loci (of which the simplest one is the topological locus , widely used in knot theory since [22]). At these peculiar loci, the composite Schur functions can be defined by the uniformization trick of [9], and they possess a nice description as a bilinear combination of the skew Schur functions
[TABLE]
or, in more detail,
[TABLE]
This formula is due to K. Koike [7], see sec.6.
In the case of considering the Macdonald polynomials instead of the Schur functions, the uniformization still works, but it provides non-trivial expressions with additional poles in in denominators, e.g. already for the adjoin at the topological locus one gets instead of naive , it is this complicated expression that satisfies the uniformization request . Even worse, the Koike formula is not immediately deformed: a bilinear decomposition into the skew Macdonald polynomials survives only in the large- limit, but even then the single sum in (43) restricted to is lifted to a double sum with the only restriction on sizes .
3 Denominators
3.1 Example of (13)
In this section, we begin from an explicit example of what (13) means and how it works at a reasonably representative, but simple (and still not fully generic) level . The general claim of (13) is that
[TABLE]
The labeling table in the case of level is
[TABLE]
and the denominator functions satisfy:
[TABLE]
The proportionality signs appear because we omit monomial factors (powers of ) appearing in the -inversion of a polynomial. Note that, in our notation, say, , but , since the partition has different positions in two different orderings. As to , it denotes , while . These ordering/notational details are essential for validity of (13): it implies that
[TABLE]
with defined from the relation . Likewise is defined from in
[TABLE]
Actually, at level there are a few accidental (?) coincidences, i.e. additional accidental relations between the denominator functions. They follow by (13) from the coincidence between the two Kerov functions (6) in three cases: , and , when (in addition to five generic coincidences for and to the symmetry dictated ”self-duality” at ):
[TABLE]
and can disappear at other levels. Only (13) is always true.
3.2 Denominator functions
The next addition to (18) helps to reveal the structure of denominators . In the obvious abbreviated notation,
[TABLE]
[TABLE]
4 Macdonald locus as an ideal in the space of -polynomials
We now discuss the Macdonald ideal in the ring of all polynomials of the variables , i.e. those which vanish on the Macdonald locus. We first consider the ideal in the ring of all polynomials, and then concentrate on the ideal in the sub-ring of all homogeneous polynomials, since it is homogeneous polynomials that emerge within the Kerov polynomial context.
4.1 Inhomogeneous polynomials
If we parameterize the Macdonald ideal through trigonometric functions, , then all such can be easily expressed through and . To get these expressions, it is enough to
- (i)
represent and as polynomials of and respectively,
- (ii)
substitute , and, finally,
- (iii)
substitute .
Now one can use de Moivre’s formula
[TABLE]
Then, for even ,
[TABLE]
where
[TABLE]
Similarly, for even ,
[TABLE]
where
[TABLE]
The arguments of the two polynomials in the numerator and denominator are related by the simultaneous inversion of the two independent variables: . In result, the ideal relations are invariant under the inversion of all . The simplest examples are:
[TABLE]
Now we turn to the Macdonald ideal in the sub-ring of homogeneous polynomials. We will use the following notation: is a homogeneous (rightly graded) polynomial of of degree , which vanishes at the Macdonald locus; is a similar polynomial, but depending only on and . It is clear that, at given , the minimal possible not smaller the minimal possible .
4.2 Phenomenology
We start with a low degree examples in order to get feeling of the general structures. Let us proceed degree by degree.
- •
There are no functions of only, which vanish on ML.
- •
The first vanishing combination is
[TABLE]
It is of degree .
- •
The next independent ones are at level 11
[TABLE]
and
[TABLE]
Solving the latest 3 equations, we obtain
[TABLE]
- •
Let us put , it can be restored from grading, and let us present each in the form
[TABLE]
with a monomial of , and a polynomial :
[TABLE]
so that
[TABLE]
- •
The next non-trivial level is 14, where and first emerge.
Their manifest form is given by
[TABLE]
- •
At level 11, there is a set of vanishing combinations that involve , and , they are linear combinations of 4 basic elements, say, of
[TABLE]
At level 14, the structure of vanishing combinations is much similar: there are 15 basic elements which can be parted to
[TABLE]
B: any two relations giving and , e.g.,
[TABLE]
- •
This scheme further changes: emerge at level 16, , at level , at level 18, and at level 20. Hence, the odd first appears at level , while the even ones, , less regularly: emerge at levels accordingly so that
[TABLE]
- •
The solution polynomials can be compactly rewritten through the two functions
[TABLE]
in the following way:
[TABLE]
These polynomials depend on the choice of the normalization factor . We shall see in the next subsection what is the natural choice of and how to get general formulas for the polynomials . In particular, it turns out that, in the case of , it is better to make another choice of , while the choice made here for is good. This is why the polynomials have a clear structure here.
From these formulas, one can immediately read off:
[TABLE]
4.3 Systematic approach: gauge
One can parameterize the Macdonald locus through so that . Then, one can easily get that
[TABLE]
Now one can use de Moivre’s formula (72) in order to obtain formulas (• ‣ 4.2), for instance,
[TABLE]
and
[TABLE]
where \bar{K}_{1,2}:=K_{1,2}\Big{|}_{g_{2,3}\to g_{2,3}^{-1}}. Thus, in this case,
[TABLE]
These formulas agree with (• ‣ 4.2) up to inessential factor of for an exception of , which becomes
[TABLE]
upon choosing the normalization factor instead of that in formula (117), where the normalization factor was chosen .
Similarly,
[TABLE]
and
[TABLE]
where we used that
[TABLE]
Thus, we can see that, in this case, it is better to choose the normalization factor :
[TABLE]
Note that and in (117) are different, and, hence, the corresponding and in (• ‣ 4.2) differs from (130).
5 Composite Kerov and Macdonald functions
As we discussed in subsection 2.3, straightforward is the definition of Kerov/Macdonald/Schur functions for -dependent conjugate and composite representations on the Miwa locus for Miwa variables. The full-fledged functions in the composite representation are then introduced by an ”uniformization” procedure a la [14], as a kind of an analytical continuation:
[TABLE]
with the functions , yet to be defined. According to this definition, the uniform Kerov function may explicitly depend on , and, indeed, it is a non-trivial and even non-polynomial function of .
In this section, we go through particular examples on increasing complexity with the goal to illustrate the structure of at least the l.h.s. of (131), already this being a non-trivial task.
5.1 Conjugate representations
The simplest under conjugation of the Young diagram is the behaviour of the Schur functions at the Miwa locus: what is transformed is the locus itself,
[TABLE]
where .
Already in this example it is clear that a uniform will not be easy to define, because has no clear relation to on the Miwa locus (traces are not consistent with inversion).
The “-factor” in (132) can be eliminated by restriction from to , i.e. by further restricting the Miwa locus to . It is, however, useful to keep this factor, because it sheds additional light on the structure of the Kerov deformation. The power of is defined by the sum of sizes of and : the former is but the latter depends on and the number of lines in transposed , as clear from the picture in sec.2.3: . Taking the sum instead of the difference is explained by inversion of at the r.h.s. of (132).
Already the deformation of (132) is non-trivial: the r.h.s. contains several terms all with the same power of ,
[TABLE]
the sum runs over the diagrams of the size (what is denoted by ). This structure will be further inherited by formulas for generic composite representations: after the Kerov deformation, the Koike formula (43) acquires new terms as compared to the Schur case.
In the case of antisymmetric representations with and , there is just a single new term at the r.h.s., and (132) remains un-deformed:
[TABLE]
However, things change already for the symmetric representations . Before going deeper into this story in sec.5.4 and further, we consider a couple of simple composite examples, where no new structure constants emerge as compared to the Schur case.
In what follows we denote to simplify the formulas. If appears, means inversion of all .
5.2 Adjoint representation
Adjoint is the simplest of composite representations, it is described by the Young diagram . In this simplest case,
[TABLE]
Denominator here comes from , which is the second () Kerov function of the weight , and has as a denominator.
(135) can be easily promoted to
[TABLE]
but a somewhat non-trivial -dependence emerges, which is not easy to express through the uniform parameter .
However, this can be easily done on the Macdonald locus, where
[TABLE]
But even this simple expression is non-polynomial in . In result, on the intersection of topological and Macdonald loci (TML), one gets
[TABLE]
rather than just , which one could naively (but erroneously) expect.
5.3 The series
[TABLE]
In this case , which is again the second Kerov function (), but this time, of weight , thus the denominator is .
5.4 Conjugation of symmetric representation
We new return to the conjugate representations. As already mentioned, a new structure constant emerges already for the simplest symmetric representation :
[TABLE]
where , but already at
[TABLE]
The numerator in this expression is an element of the Macdonald ideal, as we explained in the previous section. For
[TABLE]
with an even more sophisticated polynomial in the numerator, which is again an element of the Macdonald ideal, etc. For general
[TABLE]
They all have zero grading.
The denominator in this formula is a product of those for and . The latter one is just , and the former one is defined from the fact that is the -th Kerov function of weight , thus it is equal to .
5.5 Conjugation of higher symmetric representation
At for all one has just , i.e.
[TABLE]
exactly like the Schur case. Note that, in the case of Kerov functions, these symmetric do not exhaust all independent representations at : as we discussed in sec.2.2.3, some of the Kerov functions labeled by Young diagrams with 3 lines are non-zero.
However, at all other the deviation from the Schur case is quite significant. At
[TABLE]
and already the denominators are slightly different in the two coefficients:
[TABLE]
with
[TABLE]
of grading , which coincides with the denominator of .
Note that one can solve, say, the condition in order to determine as a function of , then solve the two similar conditions and to determine as functions of , etc. Thus, one obtains all higher ’s as functions of three arbitrary parameters . It turns out that solving these conditions, one unambiguously led to the Macdonald polynomials with the parameters and obtained from the equations
[TABLE]
with . All other are then
[TABLE]
The parameter remains unfixed, since the transformation of measure with arbitrary does not change the symmetric polynomials. Thus, the requirement of absence additional structure constants is equivalent to the Macdonald ideal.
For generic and , the denominator of is a product . In (147), we have and . In fact, there can be partial cancellations with the denominator of , which goes into the numerator of , but they are not very essential.
5.6 Adjoint tower
To already considered
[TABLE]
with
[TABLE]
we can add
[TABLE]
with
[TABLE]
This vanishes at the Schur locus (but not in the Macdonald ideal), where all , but does not.
For , there are more terms at the r.h.s:
[TABLE]
The denominators of are proportional to and to the square of coming from the product of two , from the first term at the r.h.s. in (5.6). At , is undistinguishable from . Also and belong to the Macdonald ideal.
Generally,
[TABLE]
Moreover, the uniformization occurs at ML, but it is not simple to express the coefficients in this formula through the ratios of products of Schur functions: since, at the ML, the latter look like ratios of products of or with various and , and involve the factors like at concrete , , as we shall see in the next section.
6 Uniformization at Macdonald locus
In this section, we demonstrate what happens to Kerov functions in composite representations at the Macdonald locus, how the uniformization emerges and what explains further simplifications to the Koike formula after restriction to the Schur locus .
For the Schur functions, i.e. for , for the arbitrary composite representation made from a pair of Young diagrams and and for and with no more than elements (diagrams with no more than lines), there is the Koike formula (44)
[TABLE]
where , are calculated at , the sum goes over Young sub-diagrams . Note that in the second factor is transposed so that only contribute.
In the case of Macdonald functions, the situation gets more involved (see also [23]). There are three basic modifications of (156):
(i) The skew Macdonald polynomials instead of the skew Schur functions are expected to be sufficient only in the limit of , which is interpreted as at . This limit coincides with the limit of .
(ii) The sum turns into a double sum over arbitrary diagrams and of equal sizes, but without the requirement .
(iii) In the sum, there emerge non-unit coefficients that are functions of and . Those in front of the items with are suppressed by the factor (in fact, it is a more interesting factor measuring the distance between and ).
In other words, (156) is substituted by
[TABLE]
Note that the expansion parameter is exactly the same as in the Poincare polynomials of the Khovanov-Rozansky complexes used in the definition of superpolynomials [24].
In the remaining part of this section we provide examples of (157) for various cases, however, a general formula for the coefficients is still missed.
6.1 Conjugate representations
It turns out that the property of conjugation representations (132) is correct not only on Schur, but, for a wide class of representations , also on the whole Macdonald locus in the space of the time variables , and
[TABLE]
It remains to describe . It turns out that ** is the set of Young diagrams that consist of no more then two rectangles.**
Let us note that, at any concrete , the Young diagram is conjugate to at the same . For instance, at is the Young diagram , and its conjugate is just at . In this case, the property (158) is not satisfied. It also means that, when (158) is satisfied, i.e. for rectangular and , there is an identity
[TABLE]
For instance, it is correct for and being symmetric and antisymmetric representations. It implies that the corresponding formulas for symmetric and antisymmetric composite Macdonald polynomials in the next subsection turns to be related with each other.
6.2 Answers for symmetric and antisymmetric representations
For symmetric and antisymmetric representations, there are general formulas for the coefficients .
Representation
[TABLE]
with
[TABLE]
The ratio in front of the product in this formula substitutes the multiplier in the product by .
This formula is an illustration of (ii) and (iii): the Schur level selection rule is violated, but deviations are damped by peculiar factorials \Big{\{}\frac{q^{i-1}}{t}\Big{\}}!, not just by \Big{\{}\frac{q}{t}\Big{\}} as one could expect.
Representation
[TABLE]
with
[TABLE]
Representation
[TABLE]
with
[TABLE]
Representation
[TABLE]
with
[TABLE]
In variance with (161), this expression does not automatically vanish for . The role of the ratio in front of the product is similar to that in (161).
6.3 The case of
When , the composite Macdonald polynomials already can not be presented by a combination of the skew Macdonald polynomials. This is a new phenomenon, and we discuss it in some details.
Representation
In this case, the general expression is
[TABLE]
and the coefficients can be calculated:
[TABLE]
One can see from these formulas that the combination
[TABLE]
is not proportional to for finite . However, in the limit of small (or large) , this skew Macdonald polynomial emerges:
[TABLE]
Let us stress that the coefficient in front of is not factorized, which is not that surprising, because even in the small limit, when it is expressed through the skew Macdonald polynomials, it is a combination of and . It can be also equivalently presented in the form
[TABLE]
Representation
[TABLE]
with
[TABLE]
[TABLE]
Clearly, the combination
[TABLE]
but it is not proportional to the skew Macdonald polynomial at finite . Moreover, the deviation depends on , i.e. is not universal. Note that at this level, there is just one skew Macdonald polynomial, thus one can not cure the deviation from it by taking linear combinations.
In particular, at the last item in (173) does not contribute: vanishes.
Also at the penultimate term should be , while does not contribute. Then, since
[TABLE]
it implies the decomposition
[TABLE]
Decomposition with such a property indeed exists, but not unique. Say, one can convert in (6.3) into
[TABLE]
or into
[TABLE]
or into other similar expressions.
Representation
[TABLE]
with
[TABLE]
[TABLE]
It follows that
[TABLE]
as expected.
Note that, in this example, we first meet a new property: is not factorized even in the small limit despite it is proportional to the only skew Macdonald term . Indeed, the first and the second terms in survive in this limit. At the same time, the Schur case is clearly reproduced in (6.3): upon specialization , the second and the third terms in vanish, and one immediately gets .
6.4 The case of
This is a generalization of the subsection 6.3 from to arbitrary .
Representation
[TABLE]
with
[TABLE]
All other coefficients with are not factorized corresponding to sums of skew Macdonald polynomials in the small/large limit.
Like it happened for , the combination
[TABLE]
reproduces the skew Macdonald
[TABLE]
in the limit of small/large .
The message that follows from these examples is very clear:
(a)
what exists in general is a decomposition of the composite Macdonald polynomial into the ordinary ones, but, at finite , it can not be reduced to a decomposition into the skew Macdonald polynomials,
(b)
however, at such a skew Macdonald decomposition exists at arbitrary and ,
(c)
but at this decomposition involves the terms with arbitrary sub-diagrams, and , not restricted by the constraint , but only to , the restriction/correlation appears only at .
7 Conclusion
In this paper, we discussed the definition of Kerov functions for the composite representations . In the case of Schur functions, such a definition is provided by the Koike formula (2) of [7, 8, 9] and it is crucially important for the study of HOMFLY polynomials [12]. However, its counterpart is not known even in the Macdonald case, what is a serious obstacle for extending the results of [12] to superpolynomials. The origin of difficulties is highlighted by the study in the general setting, i.e. in the Kerov setting. Our natural conjecture in this paper is that, in the Kerov case, the formula involves a double sum over all diagrams, which precede and in the lexicographical ordering (including smaller size ones), and then some simplifications occur at the Macdonald and Schur levels:
[TABLE]
We illustrated this claim by a number of examples, which are, in fact, rather tedious calculations.
The main subjects relevant to this story, which we only introduced, and which should be developed much further seem to be:
- •
Kerov functions for conjugate and composite representations
- decomposition formulas for them
- •
Universality of denominator functions + some formulas for them
- •
The structure of Macdonald ideal
- •
Uniformization of -dependence at the Macdonald locus
Of special significance is search for other interesting loci where the Kerov functions acquire special properties and thus provide yet unknown multi-parametric generalizations of Macdonald polynomials, the obvious option are the 3-Macdonald polynomials [25], the hypothetical 3-Schur functions [26] and/or the characters of the Pagoda [27], as well as generalized characters needed in tensor models [28].
We hope that this paper, together with [6], proves that development of computer methods makes the very difficult and long neglected topic of Kerov functions available for efficient investigation, and we can expect many new results in the near future.
Acknowledgements
Our work is partly supported by the grants of the Foundation for the Advancement of Theoretical Physics BASIS, by RFBR grants 19-01-00680 (A.Mir.), 19-02-00815 (A.Mor.), by the joint grants 19-51-50008-YaF (A.Mir.), 18-51-45010-Ind, 19-51-05015-Arm, 19-51-53014-GFEN. We also acknowledge the hospitality of KITP and partial support by the National Science Foundation under Grant No. NSF PHY-1748958 at a certain stage of this project.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] P. Biane, in: Asymptotic Combinatorics with Applications to Mathematical Physics, A. Vershik (Ed.), Springer Lecture Notes in Mathematics 1815 (2003) 185-200
- 2[2] S.V. Kerov, Func.An.and Apps. 25 (1991) 78-81
- 3[3] P.G.O. Freund, A.V. Zabrodin, Phys.Lett. B 294 (1992) 347–353, hep-th/9208063
- 4[4] T.H. Baker, Symmetric functions and infinite-dimensional algebras, Ph D Thesis, 1994, Tasmania A.H. Bougourzi, L. Vinet, Letters in Mathematical Physics 39 (1997) 299–311, q-alg/9604021 A.A. Bytsenko, M. Chaichian, R.J. Szabo, A. Tureanu, ar Xiv:1308.2177 A.A. Bytsenko, M. Chaichian, R. Luna, J.Math.Phys. 58 (2017) 121701, ar Xiv:1707.01553
- 5[5] A.Morozov, Phys.Lett. B 785 (2018) 175-183, ar Xiv:1808.01059 , ar Xiv:1810.00395
- 6[6] A.Mironov and A.Morozov, ar Xiv:1811.01184
- 7[7] K. Koike, Adv. Math. 74 (1989) 57
- 8[8] H. Kanno, Nucl.Phys. B 745 (2006) 165-175, hep-th/0602179
