Cut-and-join structure and integrability for spin Hurwitz numbers

Spin Hurwitz numbers are related to characters of the Sergeev group, which are the expansion coefficients of the Q Schur functions, depending on odd times and on a subset of all Young diagrams. These characters involve two dual subsets: the odd partitions (OP) and the strict partitions (SP). The Q Schur functions QR\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$Q_R$$\end{document} with R∈SP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$R\in \hbox {SP}$$\end{document} are common eigenfunctions of cut-and-join operators WΔ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W_\Delta $$\end{document} with Δ∈OP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Delta \in \hbox {OP}$$\end{document}. The eigenvalues of these operators are the generalized Sergeev characters, their algebra is isomorphic to the algebra of Q Schur functions. Similarly to the case of the ordinary Hurwitz numbers, the generating function of spin Hurwitz numbers is a τ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}-function of an integrable hierarchy, that is, of the BKP type. At last, we discuss relations of the Sergeev characters with matrix models.


Introduction
This month it is exactly ten years from the publication of [1,2] which introduced the commutative ring of general cutand-join operators with linear group characters as common eigenfunctions and symmetric group characters as the corresponding eigenvalues. Since then, these operators have found a lot of applications in mathematical physics, from matrix models to knot theory, and led to a crucially important and still difficult notion of Hurwitz τ -functions. A variety of further generalizations was considered, from q, t-deformations [3,4] to the Ooguri-Vafa partition functions [5][6][7][8][9][10][11] and various non-commutative extensions [12,13]. One of the most important generalizations is a construction of open Hurwitz numbers [14][15][16]: an infinite-dimensional counterpart of the Note that the original construction essentially involves the characters of linear groups and symmetric groups (another manifestation of the Schur-Weyl duality) understood as embedded into the linear group G L(∞) and the symmetric group S ∞ . However, an obvious direction of changing this group set-up remained poorly explored. In the present paper, we discuss this interesting subject with the hope that it would add essential new colors to the picture and give rise to many new applications. That is, instead of the Schur polynomials (characters of linear groups) we deal with the Q Schur functions, and instead of the symmetric groups we deal with the Sergeev groups. Immediate subjects to address within this context are now more or less standard, we list them in the table below indicating where they are discussed in this paper:

Definitions
The central role in this paper will be played by somewhat mysterious Q Schur polynomials Q R { p}, which depend only on odd time-variables p 2k+1 and only on strict Young diagrams R = {r 1 > r 2 > · · · > r l R > 0} ∈ SP (for ordinary diagrams some lines can have equal lengths, i.e. there is ≥ rather than >). These polynomials have two complementary origins: (a) They were introduced by Schur [17] in the study of projective representations of symmetric groups (b) They were identified by Macdonald [18] with the Hall-Littlewood polynomials HL R at t 2 = −1: where M R is the Macdonald polynomial (the tilde in HL denotes restriction to t 2 = −1, while the tilde over Q refers to the normalization factor, which will be changed in the main part of the paper, see (16) at the end of this section). Hereafter, we replace the parameters in the Macdonald book [18] (q, t) → (q 2 , t 2 ). (c) Their coefficients are expressed through the characters of the Sergeev group [19][20][21].
The formal definition of the Q Schur polynomials can be found in s.4.2.

Immediate corollaries
Definition (A) implies various determinant (actually, Pfaffian) formulas, definition (B) implies connection to representation theory, in particular, the ring structure: A peculiar property of symmetric polynomials from Macdonald family is that the sum at the r.h.s is restricted from the naive R 1 + R 2 ≤ R ≤ R 1 ∪ R 2 in the lexicographical ordering to a narrower sum of irreducible representations of SL N emerging in the tensor product of representations associated with the Young diagrams R 1 and R 2 : R ∈ R 1 ⊗ R 2 (for example, [2] ⊗ [1,1] does not contain [2,1], see [22,23] for definitions and details). Macdonald's observations were that (B2) HL R { p} for R ∈ SP depend only on odd time-variables p 2k+1 (B3) HL R { p} for R ∈ SP form a sub-ring, i.e. N R R 1 ,R 2 vanish for R / ∈ SP, provided q = 0, t = i and R 1 , R 2 ∈ SP.
Note that HL R { p} do not vanish for R / ∈ SP, and then they can also depend on even p 2k , thus the set of Q R { p} is not the same as the set of HL R , it is a sub-set, and a sub-ring.
One more important observation is that (B4) after a peculiar rescaling of the Macdonald scalar product [18], the restricted HL polynomials for R ∈ SP acquire a very simple norm: Actually relevant for the Q Schur polynomials is the restriction to odd times, i.e. the Young diagram in (3), which defines the monomial p = l i p i should have all the lines of odd length: ∈ OP. Therefore of crucial importance is the celebrated one-to-one correspondence between the sets of SP and OP . For example, coinciding are the generating functions = 1 + q + q 2 + 2q 3 + 2q 4 + 3q 5 + 4q 6 + 5q 7 + 6q 8 + 8q 9 + 10q 10 + · · · (5) (this is Sylvester theorem, which is a well known supersymmetric identity).

Properties: comparative list
In this paper, we extend the parallelism between Q and Schur-Macdonald calculus much further: to the modern fields of integrability and cut-and-join W -operators. Surprisingly or not, the next step, towards Virasoro-like constraints and matrix/network models fails, at least at the naive level. This happens even if we do not insist on eigenvalue integrals with Vandermonde-like measures, but use a "softer" definition of [24][25][26], making partition function Z directly of characters. The reason for this is a puzzling at the moment. A comparison table of properties looks as follows: note that the Schur and Hall-Littlewood polynomials are two unrelated subsets in the Macdonald family. The Q polynomials belong to the second subset, but are the ones that look most similar to the first one. For reader's convenience, we provide a short list of the first restricted HL polynomials in the Appendix. An additional mystery comes from the apparent relevance of the shift Shift : r i − i −→ r i (6) in many formulas for Schur polynomials: it helps to convert them into formulas for Q. However, it is not just this substitution, some other things should also be adjusted, their is no a universal conversion rule. In fact, the shift a sort of converts the ordinary Young diagrams into the strict ones, but again not quite: the image is not always a Young diagram. Still, when it is, the shifted diagram belongs to SP.
The difficulties with matrix model formulation seem related to the old problem of finding a matrix model with only odd time-variables. Originally it was related to the matrix model solutions of KdV (rather than KP) hierarchy, and a possible solution was provided by the Kontsevich model, at the price of making an a priori non-obvious "Fourier/Miwa transform" from time-variables to "the external field". We are still lacking a clear understanding of this procedure, which remains a piece of art, and problems with the Q Schur polynomials seem to be a manifestation of this lacuna in our knowledge. There are numerous claims that the BKP hierarchy, in variance with the KdV one, is easier to describe by matrix models, but we did not manage to find a Q-based matrix model on this way.

Hamiltonians
As the Macdonald polynomials, HL R are eigenfunctions of the Calogero-Ruijsenaars-like Hamiltonian 1 (S R { p k } denotes here the Schur polynomial, which is a symmetric function of variables x i , as a function of power sums which, for q = 0 and t 2 = −1, reduces tô where the first Schur polynomial depends on odd times only, while the second one involves derivatives w.r.t. all times. All eigenvalues trivialize to The Hamiltonian (7) is actually a difference operator, since it involves shifts of p-variables, but the Macdonald polynomials are also eigenfunctions of differential W -operators, which, however, look more involved [28]. The operators (8) are nicely acting on Q R , which depend only on odd times. However, there is a conspiracy allowing them to act properly also on the other HL R , with R / ∈ SP. In fact, the Hamiltonian (7) becomes the Ruijsenaars one in terms of the Miwa variables, p k = n i x k i . Moreover, one can write down a set of n integrable Ruijsenaars Hamiltoni-ans in these variables as difference operators acting on the functions of n variables x i aŝ where In particular, where λ R is given in (7). Note that the Hamiltonians (10) still depend on the parameter q even at the point t = q, while the eigenfunctions, which are the Schur polynomials, do not. This allows one to bring q to zero, obtaining from the difference Hamiltonians the differential ones, which are nothing but the Calogero Hamiltonians. 2 In the Hall-Littlewood case q = 0, the Hamiltonians reduce tô which means that the corresponding x i at the r.h.s are just put zero. The generating function of the eigenvalues is, in this case, In particular, upon putting t 2 = −1, one obtains Similarly, in order to obtain the Jack polynomials from the Macdonald ones, one can bring both t and q to zero together, keeping β := log t/ log q finite. In this case, one still obtains the Calogero Hamiltonians with β being the coupling constant.
where ξ R := n − l R 2 (15) and [. . .] denotes the integer part. As soon as these eigenvalues depend only on the number of lines in the Young diagram R, they essentially differ from the cut-and-join operators of s.5.

Application to Hurwitz numbers
This will be the main topic of the text below, and the final summary will be given as a comparative table in Sect. 9.
Here we enumerate the main technical statements, which are discussed in the middle part of the text.
1. Interplay between the skew symmetric functions and finite group characters. 2. An equivalence of the two definitions of the Hurwitz numbers: through the enumeration of ramified coverings ("a geometric definition") and through the Frobenius formula via the symmetric or Sergeev group characters and Schur functions ("an algebraic definition"). 3. An expression for the skew counterpart of d R in (30) through the (shifted) symmetric functions. 4. A relation of integrability with the theory of symmetric functions. 5. The theory of cut-and-join operators W .
In Sect. 3 we remind all these issues for the ordinary Hurwitz numbers, and the remaining sections describe their direct counterparts in the spin Hurwitz case.

Notation
Below in the text we use the normalization so that the polynomials Q R below have unit norm w.r.t. (3).

Geometric set-up
The Hurwitz number [29][30][31][32] is a weighted number of globally topologically different branched coverings with the same topological behavior in neighborhoods of critical values. We will consider only coverings over sphere S 2 . Then a branched covering is given by a continuous map ϕ : P → S 2 , where P is a (not obligatory connected) compact surface. There exists only a finite number |Aut(ϕ)| of homeomorphisms f : P → P such that ϕ f = ϕ. At almost every point s ∈ S 2 , there are mapped exactly d points from P. The number d is called degree of ϕ. The remaining points are called critical values. There exists only a finite number of critical values. Let x 1 , . . . , x l be all points of P that map to a critical value s ∈ S 2 . Running round x i singly is mapped by ϕ to running round s δ i times. Moreover, δ 1 +· · ·+δ l = d. The ordered integers δ i represent a partition of d, which gives rise to the Young diagram s = [δ 1 , . . . , δ l ] of degree d. The diagram s is called to be of a topological type s.
Consider now the set V ( 1 , . . . , k ) of all branched coverings with critical values s 1 , . . . , s k ∈ S 2 of topological types 1 , . . . , k . We call the coverings ϕ 1 : P 1 → S 2 and ϕ 2 : the sum being taken over a maximal set of essentially differ- It is possible to prove that this number depends only on the Young diagrams 1 , . . . , k . The classical Frobenius formula gives a combinatorial expression for the Hurwitz numbers [29][30][31][32], where [ ] is the number of permutations of the cyclic type , i.e. the number of elements in the conjugacy class of the symmetric group S d given by the Young diagram , | | = d; ψ R ( ) is value of the character ψ R of the representation R of the symmetric group S d on the permutation of cyclic type , ψ R (1) is the value on the permutation with all unit cycles, , and the sum is taken over all characters of irreducible representations of S d . A definition of more general Hurwitz numbers can be found in [33,34].

Schur functions and their properties
The main tool to deal with the Hurwitz numbers and their generating functions is the symmetric functions, that is, the Schur polynomials, and the characters of symmetric groups [18,35].
The Schur polynomials are constructed in the following way. First of all, let us define a set of functions P n by the generating function n P n z n := e k p k k z k (19) Now we define the Schur symmetric function for any Young diagram R with l R lines: The Schur functions are orthogonal with the scalar product The Schur functions also satisfy the Cauchy formula S R { p} form a full basis in the space of polynomials of p k and thus form a closed ring. Let us introduce the Littlewood-Richardson coefficients N R 3 Then, the skew Schur functions S R/P , defined as are given by The following formulas involving the skew functions are also correct: • the Cauchy formula • the expansion formula

Frobenius formula
Now we can discuss a combinatorial formula for the Hurwitz numbers [29][30][31][32]. First of all, we need the character of symmetric group in the representation R, which value on the element from the conjugacy class , ψ R ( ) is the coefficient of the Schur functions [35] where we denote n = |R|, p := i p i = k p m k k , i.e. m k is the number of lines of length k. The number of elements in the conjugacy class of is | |!/z , where z := k k m k m k ! is the standard symmetric factor of the Young diagram (order of the automorphism) [35], while the dimension of the representation R of the symmetric group As any characters, ψ R ( ) satisfy the orthogonality conditions: Note that the Littlewood-Richardson coefficients are expressed through the characters ψ R ( ) as where 1 + 2 denotes the reordered union of all lines of the two diagrams. Now the Hurwitz numbers are given as follows (g is the genus of the base, | i | = d) [29][30][31][32] where following Frobenius we introduce φ R, : . This formula at g = 0 agrees with (18), since 3.3 Cut-and-join (W-) operators and Young diagram algebra One can naturally associate with Hurwitz numbers a set of commuting differential operators. These operators generalize the cut-and-join operator of [38], which is the simplest one in the whole set, and are constructed in the following way [1,2,39]. They are originally invariant differential operators on the matrices M from G L(∞), so that the time-variables p k = Tr M k , and the eigenvalues of the matrices are related with p k by the Miwa transformation. Then, the generalized cut-and-join operators arê and The normal ordering in (36) implies that all the derivatives ∂ M stand to the right of all M. Since W are invariant matrix operators, and we apply them only to invariants, they can be realized as differential operators in p k [1,2]. In particular, the simplest cut-and-join operatorŴ [2] , [38] iŝ Another example iŝ An essential property of these generalized cut-and-join operators is that they form a commutative family with the common eigenfunctions being the Schur functions: What is important is that one can lift in this formula the restriction | | = |R|, then, one immediately obtains for the diagram containing r unit cycles: whereˆ Note that the commutative family of the generalized cutand-join operators gives rise to the associative algebra of Young diagrams: Note that this algebra was first constructed in [40] just in terms of φ R, . Indeed, using (41), one can immediately translate (43) into terms of the vectors φ R, in the space of representations R of S ∞ : Still, the fact that the structure constants C 1 2 are independent of R follows in the simplest way from the algebra of commuting cut-and-join operators.

φ R, and shifted Schur functions
In accordance with formula (42), φ R, expresses through ψ R ([ , 1 |R|−| | ]). In its turn, the latter can be expressed [40] through the shifted Schur functions [41]. Indeed, an explicit formula for ψ R ([ , 1 |R|−| | ]) involves the skew Schur functions at the special point p k = δ 1,k : This formula follows from the manifest expression for the skew Schur functions, (26) through the Littlewood-Richardson coefficients and the manifest expression (33) for these latter. Then, using the expansion (29) for the Schur function and repeating several times the orthogonality relation of the symmetric group characters (32), one immediately obtains (45).
The quantity S R/μ {δ 1,k } can be expressed through the shifted Schur functions S * μ (R) [41]. The shifted Schur functions are symmetric functions of the n variables x i −i and can be defined either through the sum over the reverse semi-stable Young tableaux T , which entries strictly decrease down the column and non-strictly decrease right in the row, or through the determinant where (x; n) := n−1 k=0 (x − k) = x!/(x − n)!. In the limit of large x i , (x; n) → x n , and formula (47) reduces to the formula for the standard Schur polynomials Hence, the standard Schur polynomials are the large x iasymptotics of the shifted ones. Equivalently, the shifted Schur functions can be also unambiguously expressed through the shifted power sums if one requires Now one can use [41, formula (0.14)] 3 in order to obtain finally and One can definitely consider more than two sets of Young diagrams 1 , 2 and accordingly more times variables, however, the standard integrability will not persist in those cases. Now, one can further define Z g (β; p,p) := n q n Z g,n (β; p,p) and we will restrict ourselves only to the genus zero. At last, we use the continuation (42) of φ R, to |R| = | | and consider more than one in order to obtain finally (see details in [1,2]) where we have fixed a set of { i } and rescaled qp k → p k . Now one may ask when the generating function (56) is a τ -function of the KP hierarchy (or, more generally, the Toda hierarchy) w.r.t. to each set of time-variables p k andp k . First of all, the Schur function satisfies the KP equation: and, in fact, the entire KP hierarchy. This is nearly obvious from the fermionic realization of characters [42][43][44][45] but in the ordinary formulation looks like a set of non-trivial identities. Linear combinations while the generating function of the whole hierarchy is written in terms of the generating parameters y k as where P k are the polynomials (19) and It was first proved in [47] that the partition function (56) solves the KP hierarchy w.r.t. each set of time-variables p k andp k if the sum in the exponential, i β i φ R, i is an arbitrary linear combination of the Casimir operators, A particular case of this claim [48] is the case of only one = [2], since φ R, [2] is associated with C 2 (R): The τ -functions of this kind are called hypergeometric [49,50]. However, higher φ R, are not linear combinations of C k (R). The proper combinations of C k (R) are nicknamed the completed cycles. Hence, the final claim is [47]: only the generating function (56) with the completed cycles gives a τ -function of the KP hierarchy More details and discussion of other cases can be found in [12,51].

Matrix models and character expansions
One can rewrite the generating function (56) in the cases, when it is a τ -function, in the form [12,49,50] with the function w R being the product since exponential of any linear combination of C k (R) can be presented [12, sect.3] as w R with some function f (x). For instance, e βC 2 (R) = i, j∈R e β(i− j) . It turns out that the generating functions (64) are sometimes partition functions of matrix models. For instance, the partition function of the rectangular N 1 × N 2 complex matrix model is [13,24,25] where is dimension of the representation of SL N group given by the Young diagram R. Similarly, the partition function of the Gaussian Hermitean matrix model is [13,24,25] Both these partition functions are known to be τ -functions of the KP hierarchy (and the Toda chain hierarchy) [13,[52][53][54][55], which is evident from the results of the previous section: the both partition functions can be presented in the form (64) withp k = N 2 in (66) andp k = δ 2,k in (68), and the weight function w R of the form

Geometric set-up
Spin Hurwitz numbers are similar to the classical Hurwitz numbers adapted to coverings with spin structures [36,37]. Spin bundle was defined (under the name of thetacharacteristic) by B. Riemann as a bundle over Riemann surfaces such that its tensor square is the cotangent bundle [56,57]. The spin bundle on a surface P has an equivalent topological description using a quadratic form (Arf-function) ω : H 1 (P, Z 2 ) → Z 2 [58][59][60]. In this case, the definition of spin Hurwitz number is where the sum is taken over a maximal set of essentially different coverings from It is possible to prove that this number depends only on the Young diagrams 1 , . . . , k . It follows from (70), [37,61,62] that

Schur Q-functions and their properties
A counterpart of the Schur functions which allows one to construct a combinatorial formula for the spin Hurwitz numbers similar to the Frobenius formula (34) is the system of symmetric Schur Q-functions [17,18]. These functions were originally introduced by Schur on the projective representations of the symmetric groups and turn out to induce characters of the Sergeev group [19][20][21]63]. They can be obtained from the Hall-Littlewood polynomials HL R (t) [18], Hereafter, SP (strict partitions) denotes a set of Young diagrams with all lengths of lines distinct. However, there is a manifest way to construct them. To this end, let us define a set of functions Q n,m by the generating function n,m Q n,m z n 1 z m 2 := e 2 k p 2k+1 It is a power series in both z 1 and z 2 , since the exponential in (73) is equal to 1 at z 2 = −z 1 . Moreover, Q n,m = −Q m,n , i.e. the matrix Q i j := Q R i ,R j associated with a Young diagram R is antisymmetric. The indices of the matrix run from 1 to l R for even l R and from 1 to l R + 1 for add l R , i.e. we add a line of zero length to the Young diagram with odd number of lines, Q 0,n being non-zero. Now we define the Q-Schur symmetric function via the Pfaffian of Q: With this normalization, for the Q-functions are orthogonal: with The Cauchy formula acquires the form Q R { p} form a full basis in the space of polynomials of p 2k+1 and thus form a closed ring. Since Cauchy formula is true and the norms of Q are unities, the skew-functions Q R/R are defined directly through the structure constants of the ring [22,23,64]. Namely, introduce the Littlewood-Richardson coefficients N R 3 R 1 R 2 in the standard way Then, the skew Q-Schur functions Q R/P , defined as are given by The usual formulas involving the skew functions are also correct: the Cauchy formula and the expansion formula

Frobenius formula
Now we are ready to discuss a combinatorial formula for the spin Hurwitz numbers [37,61,62]. First of all, we associate the characters of the Sergeev group R ( ) with the coefficients where OP (odd partitions) is a set of Young diagrams with all lengths of lines odd. 4 These coefficients plays for the spin Hurwitz numbers the same role as do the characters 4 The both SP and OP have the same dimensions as can be seen from their generation functions: the generation function of number of SP at a given level n is equal to n (1 + q n ), while that of OP is n (1 − q 2n+1 ) −1 , and these two products are equal to each other. of symmetric groups for ordinary Hurwitz numbers. Their particular values are: As any characters, they satisfy the orthogonality conditions: Note that the Littlewood-Richardson coefficients for the Qfunctions are expressed through the characters R ( ) in the usual way where 1 + 2 denotes the reordered union of all lines of the two diagrams. We will also need the quantity which is a counterpart of the standard d R and regulates the dimension of representation R of the Sergeev group It is manifestly given by which is a counterpart of the hook formula (30). It is non-zero only for R ∈ SP. Now the spin Hurwitz numbers for the genus g base with the spin structure ω such that Arf(ω) = p are given as follows (| i | = d) [37,61,62] where ∈ OP, l R is the number of lines in the Young diagram R, and R ( ) := R ( )/(z d R ). As compared with (18), this formula contains an additional sign factor and additionally depends on the parity p ∈ Z/2Z [56][57][58][59][60]. The surface = S 2 has only even spin structure and, therefore, the Hur (1) 0,n does not exist. However, all formulas can be smoothly extended also to this case, [61,62]. Then, this formula at g = 0 agrees with (18), since In particular,

Cut-and-join (W-) operators and Young diagram algebra
W -operators are again defined as graded differential operators in time variables p k with common eigenfunctions being Q Schur functions. They are labeled by ∈ OP so that the order of the operator is | |. One can immediately check that the first operators are (94) and the first non-trivial one is at the third level They are Hermitian with The eigenvalues of W [1 k ] on the eigenfunction Q R are equal to These eigenvalues are nothing but lifting of R, to |R| = | | similar to (42): for the diagram containing r unit cycles: At the same time, the eigenvalue ofŴ (3) is equal to This eigenvalue is not equal to R ([3, 1 |R|−3 ]) (93), as it was in the ordinary Hurwitz case (42): This means that, in order to construct W [3] , one has to add W [1,1] to W (3) so that the eigenvalue of W [3] would become exactly R ([3, 1 |R|−3 ]): Such "corrected" cut-and-join operator generates the spin Hurwitz numbers, however, the operatorŴ (3) , (95) instead generates the BKP τ -function, see the next section, i.e. provides a counterpart of the completed cycle. At the first five levels, one can obtain the following values of R ( ): Linearly combining R ( ) with different 's, one can easily cook up the expressions of the form which are counterparts of the completed cycles in the ordinary, non-spin case.

R, and symmetric functions
Similarly to (45), one can prove that where the sum runs over the strict partitions. Now one could try to express Q R/μ (δ 1,k ) through the shifted symmetric functions. Let us start with the shifted Macdonald functions [65], which are symmetric functions of the n variables x i t −2i and can be again defined through the sum over the reverse semi-stable Young tableaux T , where ξ T (q, t) are the same coefficients (rational functions of q and t) as in the usual (non-shifted) Macdonald polynomials.
Equivalently, they can be also unambiguously expressed through the shifted power sums Now one would have to put q = 0 and t 2 = −1 in the shifted Macdonald polynomials and consider only the strict partitions in order to obtain the Schur Q-function. However, one immediately realizes that the requirement (107) becomes too singular, when one puts q = 0 and t 2 = −1, and, besides, the Schur Q-functions would become symmetric functions in variables (−1) i x i . Instead of this, we consider the usual symmetric functions of variables x i , or functions of variables p k = x k i , and define Then, as a counterpart of (51), we obtain in order to obtain finally This formula can be immediately recast into an explicit expression for R, : which gives (102) in particular examples.
These bilinear relations has an evident solution with an arbitrary function F(x). This describes a counterpart of the hypergeometric τ -functions, i.e. τ -functions of the form (116) that satisfy the hierarchy equations w.r.t. to the both sets of time-variables, in the BKP case. Numerous discussions of the BKP hierarchy and related issues can be found in [70][71][72][73][74]. Note that, similarly to (42), one can continue the Sergeev characters to |R| = | |. However, in variance with (63), the lowest non-trivial Sergeev character R ( [3]), (93) is not of the form (121), because of the second mixing term, and, hence, does not give rise to a τ -function. At the same time, the eigenvalue of the first non-trivial cut-and-join operator (99),˜ R ( [3]) is a linear combination, and can be used in (112) in order to obtain a τ -function.
Also note that the formulas for W R , and many similar ones, in the spin case involve the quantities R i , while the same formulas in the non-spin case, R i −i. This is because the shift R i − i effectively makes the partition R i strict, and, in the spin case, the partitions are strict from the very beginning. A particular manifestation of this phenomenon is also seen from the sum over the Young diagrams with restricted numbers of lines which is a τ -function of the BKP hierarchy w.r.t. time variables p k and a τ -function of the KP hierarchy w.r.t. timevariablesp k . HereR is the strict partition made from R: R i = R i − i.

Matrix models and the character expansions
Similarly to the KP case, one can study the sums over the Qfunctions of types (66) and (68) in the spin case in attempt to associate them with matrix model partition functions. Hence, we look at the series with some fixed r . However, this sum is not a τ -function of the BKP hierarchy at all, which is not surprising, since is not a weight of the proper form (as was the case in the Hermitean Gaussian matrix model), (121). Neither Q R { p k = N } makes any sense of a representation dimension. Moreover, one also should not expect distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecomm ons.org/licenses/by/4.0/. Funded by SCOAP 3 .