Random strict partitions and random shifted tableaux

We study asymptotics of random shifted Young diagrams which correspond to a given sequence of reducible projective representations of the symmetric groups. We show limit results (Law of Large Numbers and Central Limit Theorem) for their shapes, provided that the representation character ratios and their cumulants converge to zero at some prescribed speed. Our class of examples includes uniformly random shifted standard tableaux with prescribed shape as well as shifted tableaux generated by some natural combinatorial algorithms (such as shifted Robinson–Schensted–Knuth correspondence) applied to a random input.

We start with Sects. 1.2-1.5 of this Introduction where we present basic notations related to strict partitions. We continue in Sects. 1.6-1.7 with two concrete example models which we aim to treat, namely random strict tableaux of prescribed shape and asymptotics of shifted Robinson-Schensted-Knuth correspondence.
These two example models turn out to be special cases of a more general and more abstract theory which we present later in the paper in Sect. 2. This general theory concerns random shifted Young diagrams related to reducible spin representations of the symmetric groups. We also state there the main results of the current paper, Theorems 2.5 and 2.6.
These general results are direct analogues of their classical counterparts for linear representations and usual (non-shifted) Young diagrams. Our strategy will be twofold: to revisit the ideas from the work of the second-named author [41] which concern the linear representations of the symmetric groups, as well as to use the link between the linear and the spin setup which we explored only recently [31].
Our reuse of the notion of the approximate factorization property for the character ratios (which appears in the assumptions of Theorems 2.5 and 2.6) has some novelty: in Sect. 3 we discuss this established notion with a new, more abstract and hopefully more elegant viewpoint of the category theory. This new approach seems applicable in a quite wide spectrum of setups, including the classical one [41].
The remaining part of the paper is tailored specifically for the needs of the setup of the asymptotic spin representation theory of the symmetric groups.
In Sect. 4 we present our key technical tools: Kerov-Olshanski algebra and its spin analogue. We prove the main technical difficulty of the current paper, Theorem 4.2.
In Sect. 5 we prove Theorem 5.1 which provides several equivalent, convenient characterizations for approximate factorization property for character ratios. This result directly implies the main results of the current paper, Theorems 2.5 and 2.6. Section 6 is devoted to applications of the aforementioned Theorem 5.1. We construct a large collection of examples of sequences of representations with approximate factorization property for which the results of the current paper are applicable. In particular, we explain how Theorems 1.1, 1.3, Corollaries 1.4, 1.5 fit into the general framework of the approximate factorization property.
In Sect. 7 we recall the methods for finding explicitly the limit shape of (shifted) Young diagrams.
In "Appendix A" we recall some basic facts from the spin representation theory of the symmetric groups.

Strict partitions
Random partitions occur in mathematics and physics in a wide variety of contexts, in particular in the Gromov-Witten and Seiberg-Witten theories [32,47]. In the current paper we focus attention on a special class, namely on random strict partitions.
We recall that ξ = (ξ 1 , . . . , ξ ) (1) is a strict partition of an integer n if ξ 1 > · · · > ξ form a strictly decreasing sequence of positive integers such that n = |ξ | = ξ 1 + · · · + ξ , cf. [27, p. 9]. We denote by SP n the set of strict partitions of a given integer n and by SP = n≥0 SP n the set of all strict partitions. It is convenient to represent graphically a strict partition ξ by a shifted Young diagram, as it is shown in Fig. 1, which is a collection of boxes (x, y) : x, y ∈ N, 1 ≤ y < x ≤ y + ξ y (2) on the plane. We use the French notation for drawing diagrams as well as the usual Cartesian coordinate system O XY on the plane; in particular the variable x indexes the columns and the variable y indexes the rows. The rows and columns are indexed by natural numbers N = {1, 2, . . . }. Above and in the following it is convenient to view a strict partition (1) as an infinite sequence of non-negative integers ξ = (ξ 1 , . . . , ξ , 0, 0, . . . ) by padding zeros at the end.

Strict partitions: motivations and applications
Strict partitions occur naturally in the context of spin representations of the symmetric groups S n , cf. "Appendix A.2" later on, and in this article we shall concentrate on this link. Nevertheless, it is worth pointing out that they also appear in the theory of partially ordered sets as order filters in the root poset of type B n , as well as they form an interesting infinite family of d-complete posets, which in turn is connected to fully commutative elements of some Coxeter groups [34,46]. Also, strict partitions are in a bijective correspondence with permutations which avoid patterns 132 and 312 [9].

Drawing (strict) partitions and Young diagrams for asymptotic problems
For asymptotic problems we need some way of drawing large strict partitions which would allow us to compare the shapes of such partitions with different numbers of boxes. In this section we shall present a convenient solution to this difficulty.

Shifted Russian convention for drawing shifted Young diagrams
In the French convention we draw shifted Young diagrams on the plane using the Cartesian coordinate system O XY , cf. Fig. 1, but for asymptotic questions it is convenient to draw them using the shifted Russian convention [10,Sect. 4.2.6] which corresponds to a new coordinate system O Z T on the plane given by see Fig. 2. In this convention, the boundary of a shifted Young diagram ξ (shown on Fig. 3 by the thick zigzag line), called its profile, is a graph of a function ω ξ : R + → R + on the positive half-line. If necessary, the domain of the profile can be extended to the whole real line by declaring that ω ξ (−x) = ω ξ (x) for any x ≥ 0. The graph of such a profile ω ξ : R → R + is shown on Fig. 2 as the union of the thick solid and the thick dashed lines.

Russian convention for drawing Young diagrams
In the French convention we draw the usual (non-shifted) Young diagrams on the plane using the Cartesian coordinate system O XY , but for asymptotic questions it is convenient to draw them using the Russian convention (cf. Fig. 3) which corresponds to a new coordinate system O Z T on the plane given by In this convention, the boundary of a Young diagram λ (shown on Fig. 3 by the thick zigzag line), called its profile is a graph of a function ω λ : R → R + .

Continual Young diagrams: dilations of (shifted) Young diagrams
We will say that a function ω : R → R + is a continual Young diagram [19,21] if • ω(z) = |z| for sufficiently big values of |z|.
For a real number r > 0 we can draw the boxes of the Young diagram λ as squares of side r . Such an object-denoted r λ and called dilated Young diagram-is usually no longer a Young diagram, but its profile ω r λ is still well defined and is a continual Young diagram; note that ω r λ (z) = r ω λ z r for any z ∈ R which can be viewed as an alternative definition of ω r λ . For a shifted Young diagram ξ the analogous operation of drawing boxes as squares of side r > 0 and then looking on the profile of the resulting object is more delicate because we would have to adjust the additive terms in the linear transformations (3) to the new size of the boxes. For this reason we take the following analogue of (4): ω r ξ (z) = r ω ξ z r for any z ∈ R as the definition of the profile of the dilated diagram r ξ .

Shifted tableaux
We recall that a shifted tableau is a filling of the boxes of a given shifted Young diagram ξ which is weakly increasing along the rows and strictly increasing along the columns. Such a tableau is standard if each of the numbers 1, 2, . . . , n appears as an entry exactly once, where n = |ξ | is the number of the boxes, cf. top of Fig. 4 for an example. For a shifted tableau T of shape ξ we denote by T x,y its entry in x-th column and y-th row for integers x, y such that 1 ≤ y < x ≤ y +ξ y . For any integer 0 ≤ i ≤ n we denote by T ≤i = (ζ 1 , ζ 2 , . . . ) ∈ SP i the strict partition which corresponds to the set of boxes of T occupied by numbers which are ≤ i; in other words In the context of the representation theory of the symmetric groups, shifted tableaux play an analogous role (for spin representations) as the usual ("non-shifted") tableaux (for linear representations) and several classical combinatorial algorithms for tableaux have their shifted counterparts [36,39,45,49].
A special role is played by the staircase strict partition k = (k, . . . , 3, 2, 1) and by shifted tableaux with this shape; we call the latter staircase shifted tableaux. Such staircase shifted tableaux-apart from the aforementioned general context of the representation theory-appear in the combinatorics of the Coxeter groups; more specifically they are in a bijective correspondence with a natural class of objects which can be described in several equivalent ways: • maximum length chains in the Tamari lattice [12], • maximal chains in weak Bruhat order on 312-avoiding permutations in S n [12] which are also known under the name of 312-avoiding sorting networks, • both 132and 312-avoiding sorting networks [24,Proposition 3.12], • the commutation class of the word w 0 = (s 1 s 2 · · · s k−1 )(s 1 s 2 · · · s k−2 ) · · · (s 1 s 2 )(s 1 ) in the symmetric group S k [38]. For ξ ∈ SP we denote by T ξ the set of shifted standard tableaux with the presecribed shape ξ and by P ξ the uniform probability measure on T ξ . Such a uniformly random shifted tableau can be generated by the shifted hook walk algorithm [35] and is an important tool in some proofs of the hook length formula for the number |T ξ | of shifted tableaux [35].

Limit shape for random shifted tableaux
Following the ideas of Pittel and Romik [33], a shifted tableau T with shape ξ ∈ SP n can be regarded as a three-dimensional stack of cubes over the two-dimensional shifted Young diagram ξ , with T x,y cubes stacked over the square in such a way that the area of ξ becomes equal to 1 2 , and to rescale the height of the cubes by the factor 1 n in such a way that the heights of stacks of cubes are all between 0 and 1. In this way we may ask asymptotic questions about large random shifted tableaux using the language of random surfaces.
Before reading the exact form of the following result we recommend to consult the almost self-explanatory Fig. 4.
The following result states a kind of Law of Large Numbers result that if the (scaled down) shapes of the strict partitions ξ (k) converge to some limit shape then the aforementioned random surface which corresponds to a uniformly random shifted tableau T (k) ∈ T ξ (k) converges in probability towards some deterministic surface F : → [0, 1] in the sense of level curves. The latter sense of convergence means that the (scaled down) region on the plane occupied by the boxes with (scaled) height bounded from above by any fixed real number α-in the physical geography the boundary of such a region is a curve called the contour curve or the level curveconverges in probability to the region where the surface F takes values which are bounded from above by the same level α. 2 , . . . ) ∈ SP n k for some sequence (n k ) of positive integers which tends to infinity. We assume that the sequence of rescaled profiles converges to some limit in the sense of pointwise convergence of functions on R + . We denote by this limit shape drawn in the French coordinate system.
We also assume that the sequence (ξ (k) ) is C-balanced [4], i.e. the length of the first row satisfies the bound for some constant C > 0 and all integers k ≥ 1.
Then there exists a function F : → [0, 1] and the corresponding a family of level curves (drawn in the Russian convention) indexed by 0 < α < 1, defined for z ≥ 0 by α (z) = sup x + y : (x, y) ∈ and x − y = z and F(x, y) ≤ α ; we use the convention that if the supremum above is taken over the empty set then α (z) = |z|. We denote by T (k) a random standard Young tableau, sampled with the uniform distribution on T ξ (k) . Then for each 0 < α < 1 the (rescaled by the factor 1 √ 2n k ) profile of the shifted Young diagram T (k) ≤αn k converges in probability to α . In other words, for each > 0 The proof and the exact form of the limit surface F is postponed to Sect. 6.3. The results of the current paper can be also used to show that the fluctuations of the random surfaces T (k) around the limit shape are Gaussian.

Remark 1.2
With some minor effort, an analogous result for the usual (non-shifted) tableaux can be extracted from the work of Biane [4,Theorem 1.5.1]. This non-shifted analogue was known to Biane; in particular the second-named author witnessed a presentation of Biane in Spring 2008 in which this kind of result was stated by referring to computer simulations similar to the one from Fig. 4, see also [40] in the context of Gaussianity of fluctuations. Nevertheless, it seems that this non-shifted version was never explicitly stated in the existing literature and for this reason it was overlooked by the scientific community. For example, the authors of [33] cite the work of Biane but do not seem to be aware of a partial overlap of their result with [4].

Example: random staircase tableaux
The assumptions of the above Theorem 1.1 are fulfilled for the sequence ξ (k) = k ∈ SP n k of staircase strict partitions, cf. Eq. (5), with n k = k+1 2 and the limit shape Theorem 1.1 is applicable and, as we shall see in Sect. 6.3.7, in this case the limit surface is the restriction of the function L described by Pittel [25] used convergence with respect to a stronger topology given by the pointwise convergence of the entries of tableaux towards the limit surface F). Note that the latter paper contains also large deviations results which do not seem to be accessible by out methods.

Shifted RSK correspondence
Let us fix some positive integers n and d. We consider the ordered set In the following we will use shifted RSK correspondence [13,36,49] in a very specific context (with the notations of [36,Theorem 8.1] this corresponds to the case when the circled matrix (a i j ) i∈[n], j∈ [d] is such that j a i j = 1 for any i ∈ [n]). In this context shifted RSK is a bijection between: • the set of words of length n, and • pairs (P, Q) of (generalized) tableaux of the same shape ξ ∈ SP n which fulfil the following conditions. The insertion tableau P is a generalized shifted tableau which means that it is a filling of the boxes of ξ with the elements of A d which is weakly increasing along the rows and along the columns; furthermore each circled symbol appears in each row at most once, and each non-circled symbol appears in each column at most once.
The recording tableau Q is a filling of the boxes of ξ with the elements of the set [n] := {1, . . . , n} with the property that each element of [n] appears exactly once; furthermore, each row and each column is increasing. Additionally, each non-diagonal entry of the tableau can be circled or not; each diagonal entries is non-circled.
We consider the discrete probability space n,d equipped with the uniform measure. We are interested in the probability distribution of the random variable ξ = ξ(w). Since shifted RSK correspondence is a bijection, this probability distribution on SP n -called shifted Schur-Weyl measure-is explicitly given by where (ξ ) denotes the number of non-zero parts of the partition ξ and g ξ := |T ξ | is the number of shifted standard tableaux of shape ξ . This probability distribution also has a natural representation-theoretic interpretation which we will be discussed later in Sect. 6.2.

Asymptotics of shifted Schur-Weyl measures
Usually we draw boxes which constitute a shifted Young diagram ξ ∈ SP n as unit squares. However, as we already mentioned, for asymptotic problems it might be beneficial to draw them as squares of side 1 √ 2n so that the total area occupied by the boxes is equal to 1 2 . The following result states that random strict partitions distributed according to shifted Schur-Weyl measures with carefully chosen parameters converge (after the rescaling of boxes described above) in probability towards some explicit limit shapes. The analogue of this result for non-shifted Schur-Weyl measures is due to Biane [3]. Then there exists a function SW c : R + → R + with the property that for each > 0 lim n→∞ P SW n,d n ξ ∈ SP n : sup The proof is postponed to Sect. 6.2; the exact form of the limit curve will be discussed in Sect. 7.3.
This result is illustrated on Figs. 5 and 6.

Asymptotics of the insertion tableaux P
We continue the discussion of shifted RSK correspondence from Sect. 1.7.1. If we ignore that some of the entries of the insertion tableau P = P(w) are circled, we may represent P as a stack of cubes, just like we did it in Sect. 1.6.1. This time, however, we rescale all dimensions of the unit cubes by the factor d n . The following result states that such rescaled random surfaces converge in probability to some universal surface P in the sense of level curves. This result is illustrated by a computer simulation on Fig. 7. we have that (for legibility we write d = d n ) holds true for any > 0 and any level α such that The proof is postponed to Sect. 6.2.
(for legibility we write d = d n ) holds true for any > 0 and any level α such that The proof is postponed to Sect. 6.2. Remark 1.6 Corollaries 1.4 and 1.5 have non-shifted analogues which concern the asymptotic shapes of the insertion and the recording tableaux when the usual (nonshifted) RSK correspondence is applied to a random sequence of length n with the entries selected from the finite set [d]. These analogues follow from the results of Biane [3,Theorem 3] in a way similar to the one presented in the proofs of Corollaries 1.4 and 1.5. Somewhat surprisingly, it seems that these non-shifted analogues were not stated explicitly in the existing literature.
The results of the current paper can be also used to show that the fluctuations of the random surfaces corresponding to the insertion and the recording tableaux around the limit shapes are Gaussian.

Spin representations and random strict partitions
We are ready now to present the abstract general theory which provides the link between asymptotics of spin characters and the corresponding random strict partitions.

Character ratios
For Reader's convenience we collected some very basic facts and notations from the spin representation theory of the symmetric groups in "Appendix A". Nevertheless, most of these facts will not be used in the following. The bare minimal necessary knowledge is condensed in "Appendix A.7".
If ψ : CS − n → GL(V ) is a spin representation and π ∈ OP n is an odd partition, we define the corresponding character ratio as the (normalized) character of ψ evaluated on any element c π ∈ C + π which belongs to the conjugacy class which corresponds to π , cf. "Appendix A.7". Above denotes the normalized trace.
For ξ ∈ SP n and π ∈ OP n we denote by the character ratio (8) which corresponds to (any) irreducible spin representation given by ξ , cf. "Appendix A.7".

Random strict partitions and reducible representations
Let ψ : G → GL(V ) be a representation of a finite group G and let be its decomposition into irreducible components. Above, n ξ ∈ {0, 1, 2, . . . } denotes the multiplicity of the irreducible component V ξ . We define a probability measure on the set G of the irreducible representations of G given by which can be interpreted as the probability distribution of a random irreducible component of V .
The main results of the current paper concern the random shifted Young diagrams given by the above construction in the special case when G = S n is the spin group and V is its reducible spin representation. Equivalently, in order to ensure we deal with a spin representation, we may consider the analogue of the above construction in which instead of a group representation of S n we use an algebra representation of CS − n .
Due to the correspondence between the irreducible representations of CS − n and strict partitions of n, the measure P V can be equivalently viewed as a probability measure on SP n , see Sect. 2.3 for some technical details. The corresponding probability measure, called strict (or shifted) Plancherel measure [5,16,18], is given by where g ξ = |T ξ | denotes the number of shifted standard tableaux with shape given by the shifted Young diagram ξ . Equivalently, (11) is the probability distribution of the common shape of the two shifted tableaux associated via shifted Robinson-Schensted correspondence [36,49] to a uniformly random circled permutation in n letters.

Random strict partitions, revisited
Formally speaking, the construction from Sect. 2.2 associates to a given (reducible) representation V of CS − n a probability measure P V on the set of irreducible representations (or irreducible characters) of CS − n which can be identified with the set in which each element of SP − n is counted twice, thus it is not equal to SP n . However, if we identify the two copies of SP − n by identifying the characters φ ξ ± for ξ ∈ SP − then P V becomes, as required, a probability measure on SP n given by An alternative solution to the above minor difficulty is to start with a reducible superrepresentation of CS − n and then to decompose it into irreducible superrepresentations which directly gives rise to a probability distribution on strict partitions.

Random strict partitions, alternative viewpoint
If V is a representation of of CS − n then (keeping in mind (13)) the following equality between functions on OP n holds true: Thanks to Lemma 2.2 below it follows that the coefficients P V (ξ ) of this expansion are uniquely determined by (14).

Lemma 2.2 The family of character ratios
forms a linear basis of the space of (complex-valued) functions on OP n .
Proof The right-hand side of (12) is the complete collection of the characters of CS − n hence it forms a linear basis of the space of complex-valued functions on the set of conjugacy classes C + π over π ∈ OP n ∪ SP − n . It follows that spans the space of complex-valued functions on the set of conjugacy classes C + π over π ∈ OP n . By the identity |SP n | = |OP n |, its cardinality matches the dimension hence (15) is a linear basis of the latter space. Since the claim follows immediately.
Equality (14) can be viewed as an alternative definition of the probabilities P V (ξ ) as coefficients of the expansion of χ V in the linear basis (χ ξ ). This viewpoint has interesting consequences.
Firstly, in order to state the results of the current paper we do not need the representation V and it is enough to speak about the corresponding character ratio χ V . The property of approximate factorization (Definition 2.3) is, in fact, not a property of a sequence of representations but of the corresponding sequence of character ratios.
Secondly, for a superrepresentation of CS − n , the construction from Sect. 2.2 gives a probability measure directly on SP n , without the difficulties discussed in Sect. 2.3. Passage from the framework of representations to the framework of superrepresentations implies that we should replace the family of characters (12) by the characters of the irreducible superrepresentations This change does not create any difficulties because the corresponding family of character ratios (viewed as functions on OP n ) remains the same. By revisiting Eq. (14) in the new context of superrepresentations we see that it still remains valid; this shows that that the probability measure on SP n associated to a (super)representation V remains the same, no matter if we regard V as a superrepresentation or as a representation. Thirdly, the (super)representation theory of the spin symmetric groups S n is known to be Morita equivalent to the (super)representation theory of Hecke-Clifford algebra H n = Cl n CS n . In the context of the (super)representations of H n it still makes sense to speak about the character ratios χ as functions on OP n ; in this way the results of the current paper can be reformulated in the language of the (super)representations of H n and the corresponding probability measures.

Hypothesis of the main results: approximate factorization of characters
In this section we will present the hypothesis of the main results of the current paper, Theorems 2.5 and 2.6.

Cumulants of characters
We define a product of two odd partitions as their concatenation, followed by arranging the entries in a weakly decreasing manner. In this way the set OP of odd partitions becomes a commutative monoid with the unit given by the empty partition ∅. We consider the algebra of odd partitions C[OP] which-as a vector space-is defined as the set of formal linear combinations of odd partitions; the product corresponds to the above monoid structure via distributivity of multiplication. Any function χ : OP → C on odd partitions extends by linearity to a linear map χ : C[OP] → C on the odd partition algebra.
A convenient way to encode the information about a function χ : OP → C with the property that χ(∅) = 1 is to use cumulants. More specifically, for partitions π 1 , . . . , π ∈ OP we define their cumulant (with respect to χ ) log χ e t 1 π 1 +···+t π as a coefficient in the Taylor series of an analogue of the logarithm of the (multidimensional) Laplace transform. The operations on the right-hand side should be understood in the sense of formal power series with values in the odd partitions algebra C[OP]. For example, Informally speaking, the cumulants κ χ (for ≥ 2) quantify the extent to which χ : OP → C fails to be a semigroup homomorphism (with respect to the multiplication). We denote by OP ≤n := 0≤m≤n OP m the set of odd partitions of size smaller or equal than n. We will apply the above construction of cumulants to the special case when V is a (reducible) spin representation of S n and χ = χ V is the character ratio defined on OP ≤n by extending the domain of (8) by padding the partition π with additional ones: Note that so defined χ V is well-defined only on the set OP ≤n ; in this way the cumulant (16) is well-defined as long as |π 1 | + · · · + |π | ≤ n.

Definition 2.3
Assume that for each integer n ≥ 1 we are given a spin representation ψ (n) : S n → GL(V (n) ). We say that the sequence (V (n) ) has approximate factorization property if for each l ≥ 1 and all π 1 , . . . , π ∈ OP such that each π i = (2k i + 1) is an odd partition which consists of exactly one part, we have that Example 2. 4 We continue Example 2.1. The vector space CS − n is the image of the left-regular representation C S n under the projection 1−z 2 . Since the character of the left-regular representation vanishes on all group elements (except for the identity 1), it follows that the character of CS − n vanishes on all group elements, except for 1 and z, and hence the corresponding character ratio is given by for any π ∈ OP n . We extend the domain of the character ratio by (17) and obtain for any π ∈ OP ≤n .
Since κ , we just calculated the first cumulant as well. Since the map (19) is a homomorphism (in the somewhat restricted sense that for all π 1 , π 2 ∈ OP such that |π 1 | + |π 2 | ≤ n), it follows immediately that all higher cumulants κ CS − n (for ≥ 2) vanish. Now it is easy to check that the sequence of representations (CS − n ) indeed has approximate factorization property.
We will construct a whole class of examples later in Sects. 6.2 and 6.3.

Free cumulants
It was noticed by Biane [3,4] that for asymptotic problems it is convenient to parametrize the set of Young diagrams by free cumulants, quantities which originate in the random matrix theory and Voiculescu's free probability [30]. We review these quantities in the following.
For a continual Young diagram ω we consider a function σ ω : R → R + given by which can be viewed as the density of a measure on R.
If ω = ω r λ is the profile of a rescaled Young diagram for a Young diagram λ and r > 0 then the total weight of this measure R σ r λ (z)dz = r 2 |λ| is equal to the area of the rescaled Young diagram r λ (there are |λ| boxes, each is a square of side r ).
Similarly, if ω = ω r ξ : R → R + is the profile of a rescaled shifted Young diagram ξ then R σ r ξ (z)dz = 2r 2 |ξ | is the double of the area of the rescaled shifted Young diagram r ξ (the additional factor 2 appears because we extended the domain of the profile to the whole real line).
For a given continual Young diagram ω and an integer n ≥ 2 we define the rescaled moment of the measure σ ω : Then the sequence of free cumulants R 2 , R 3 , . . . is defined by Conversely, the sequence of free cumulants determines uniquely the corresponding sequence of moments S 2 , S 3 , . . . by the identity where m ↓k = m(m − 1) · · · (m − k + 1) denotes the falling power, see [7, Sect. 3.2 and Proposition 2.2].

The first main result: random strict partitions concentrate around some limit shape
In the following, in order to keep the notation lightweight, we will write χ (n) , κ (n) , Theorem 2.5 Assume that for each integer n ≥ 1 we are given a spin representation ψ (n) : S n → GL(V (n) ) and assume that the sequence (V (n) ) fulfils the approximate factorization property (Definition 2.3).
Additionally, we require that for all odd numbers k, l ≥ 3 the following limits exist: We denote by ξ (n) the random shifted Young diagram with the distribution given by Then the sequence of rescaled shifted Young diagrams 1 √ n ξ (n) converges in probability towards some limit . In other words: there exists a unique continual Young diagram : R → [0, ∞) ("the limit shape") with the property that for each > 0 where · denotes the supremum norm. This limit shape : R → R + is uniquely determined by its free cumulants The proof of this result is postponed to Sect. 5.3. This theorem is analogous to a result of Biane [3, Corollary 1] who considered linear representations of the symmetric groups and the corresponding random (non-shifted) Young diagrams. The assumptions of Theorem 2.5 can be weakened to match the assumptions of the analogous result of Biane; for simplicity we decided to have the same assumptions for Theorems 2.5 and 2.6.
In Sect. 6.1 we will prove that in the special case considered in Example 2.4 when V (n) = CS − n is the spin part of the left-regular representation and the corresponding probability measure P (n) is the shifted Plancherel measure, the limit curve coincides with the Logan-Shepp & Vershik-Kerov curve [26,48] which describes the limit shape of (non-shifted) random Young diagram distributed to the (non-shifted) Plancherel measure. In this case the proof is due to De Stavola [10,Sect. 4.5]; this result was conjectured earlier by the authors of [2].

The second main result: Gaussian fluctuations
Theorem 2. 6 We keep the notations and the assumptions from Theorem 2.5.
(1) (Gaussian fluctuations of characters) Then the joint distribution of (any finite collection of) the centred random variables denotes the evaluation of the character ration on the odd partition (k) which consists of a single part. (2) (Gaussian fluctuations of shapes) Then the joint distribution of (any finite collection of) the random variables converges in distribution to a centered Gaussian distribution, where is the function provided by Theorem 2.5.
The proof is postponed to Sect. 5.4. The explicit form of the covariance can be calculated thanks to Theorem 5.1. This result is analogous to the central limit theorem for random (non-shifted) Young diagrams proved by the second-named author [41] which was an extension of Kerov's Central Limit Theorem [15,20] to the non-Plancherel case. Note also that the special case of the above result for the shifted Plancherel measure was proved by Ivanov [16] already in 2004.
The following sections are a preparation for the proofs of Theorems 2.5 and 2.6.

The approximate factorization category
The notion of approximate factorization of characters was introduced by the secondnamed author as a tool for proving Gaussianity of fluctuations of random Young diagrams related to representation theory and special functions [11,41]. We use this occasion to present this notion in a more abstract and more transparent framework.

Filtered algebras
In the usual definition of a filtered algebra A = i∈Z ≥0 F i the family (F i ) is indexed by non-negative integers. For this reason we will refer to such a filtered algebra as Z ≥0 -filtered algebra. The following is a slight extension of this concept. Note that each such a Z ≥0 -filtered algebra becomes a Z-filtered algebra by setting F i := {0} for all negative integers i < 0. Definition 3.1 By a Z-filtered algebra we will understand an algebra A together with a family (indexed by integers) of linear subspaces (F i ) i∈Z which is increasing: We will always assume that A has a unit and 1 Often we do not need to distinguish between Zand Z ≥0 -filtered algebras; in this case we will speak simply about filtered algebras.

Examples of filtered algebras
The following two examples will play an important role later on.

The algebra X of sequences with polynomial growth
For i ∈ Z we define to be the linear space of (real valued) sequences with growth at most O n i 2 . Then X := i F i is a unital Z-filtered commutative algebra with the multiplication given by the pointwise product. The unit 1 = (1, 1, . . . ) ∈ F 0 corresponds to the constant sequence.

The algebra of odd partitions
We revisit Sect. 2.5.1 and we equip the algebra C[OP] of odd partitions with a Zfiltration by setting It should be stressed that this filtration has a peculiar property that the degree of any element is a non-positive integer.

The approximate factorization property
Definition 3.2 Suppose that A and B are unital commutative algebras and F : A → B is a linear unital map. For a 1 , . . . , a l ∈ A we define their cumulant where the operations on the right-hand side should be understood in the sense of formal power series in the variables t 1 , . . . , t , cf. (16).
So defined cumulant is a coefficient in the expansion of an multidimensional Laplace transform, with the role of the expected value E played by the linear map F. For example, correspond to the mean value and the covariance.

Definition 3.3
We say that a linear unital map F : A → B between filtered commutative algebras has the approximate factorization property if for all ≥ 1 and Remark 3.4 More generally, for an arbitrary α > 0 one can consider the notion of α-approximate factorization property in which (28) is replaced by the condition Clearly, Definition 3.3 is a special case corresponding to α = 2. Some of the abstract general results which we present in the following remain true also for this more general notion (in particular, all results from Sects. 3.4 and 3.5). On the other hand, the results which concern specific examples (such as Observation 3.9 and Proposition 3.10) depend on the specific choice of α = 2.
In order to keep the notation lightweight we will not pursue further this more general setup. This lemma appears in a rather concealed form in [41,Sect. 4.7, proof of the implication (13) ⇒ (14)]; the main idea of the proof is to use the formula of Brillinger [6] in order to express the cumulants for the composition G • F in terms of the cumulants for G and cumulants for F. Lemma 3.5 allows us to speak about the approximate factorization category which has filtered unital commutative algebras as objects and unital maps with the approximate factorization property as morphisms.

Generators and approximate factorization
Since we consider the setup of filtered algebras, the usual notion of generators of an algebra has to be adjusted accordingly.

Definition 3.7 Let
A be a filtered algebra and let X ⊆ A be its subset. We say that X generates A as a filtered algebra if each a ∈ A is a linear combination (with complex coefficients) of finite products of the form x 1 · · · x for some ≥ 0 and The following simple result was proved by the second-named author [41,Corollary 19] in the specific setup of the Kerov-Olshanski algebra (with two distinct multiplicative structures). The proof did not use any specific properties of these filtered algebras and thus it remains valid also in this general context. Note that the original paper mistakenly does not mention the necessary condition (29); see also [11,Lemma 3.4] and the proceeding discussion.

Lemma 3.8 Let F : A → B be a linear unital map between filtered commutative algebras and let X be a set which generates A as a filtered algebra.
If condition (28) holds true for all ≥ 1 and a 1 , . . . , a ∈ X then it holds for arbitary a 1 , . . . , a ∈ A; in other words F has the approximate factorization property.

Example: approximate factorization of characters revisited
In Definition 2.3 we defined the approximate factorization property for a sequence of representations while above we used the same name in Definition 3.3 in the context of maps between filtered algebras. As we explain below, this is not a coincidence.
With the notations of Definition 2.3, let V (n) be a fixed sequence of representations and let χ (n) be the corresponding sequence of the character ratios with χ (n) : OP ≤n → R. We extend the domain of χ (n) in an arbitrary way so that χ (n) : OP → R; for example we may set χ (n) (π ) = 0 if |π | > n. The information about this sequence of character ratios can be encoded by a single map which is defined by Proof We denote by X ⊂ OP the set of odd partitions which consist of exactly one part. This set generates OP as a commutative monoid. We shall identify any odd partition with the corresponding element of the odd partition algebra C[OP]; it is easy to check that X ⊂ C[OP] generates the odd partition algebra C[OP] as a filtered algebra.
Assume that V (n) has the approximate factorization property. The condition (18) implies that the assumptions of Lemma 3.8 are fulfilled for the map (30) and the aforementioned generating set X . It follows that (30) indeed has the approximate factorization property, as required.
The opposite implication is immediate.

The motivating example: Gaussian fluctuations
The following example will be our key tool for proving Gaussianity of various random variables. For each n ≥ 1 let ( n , F n , P n ) be a probability space. Assume that A is a Z-filtered commutative algebra such that each element X ∈ A is a sequence X = (X 1 , X 2 , . . . ) where X n : n → R is a random variable on the appropriate probability space with the property that its expected value E n X n is well-defined.
We assume that the unital map E : A → X given by the expected value: is well-defined, i.e. it indeed takes values in X.
of centered random variables converges to a Gaussian distribution in the limit when n → ∞, in the weak topology of probability measures.
Proof We consider the cumulant of the random variables y i 1 ,n , . . . , y i ,n κ (y i 1 ,n , . . . , y i ,n ) := ∂ ∂t 1 · · · ∂t log E n e t 1 y i 1 ,n +···+t y i ,n For = 1 this cumulant trivially vanishes by the centeredness. For ≥ 2 the cumulant is shift-invariant, thus the assumption of the approximate factorization property implies that In particular, for ≥ 3 this cumulant clearly converges to zero. For = 2 the cumulant coincides with the covariance κ 2 (y i 1 ,n , y i 2 ,n ) = Cov y i 1 ,n , y i 2 ,n and hence by it converges by assumption.
To summarize: we proved that each of the cumulants (32) converges to a finite limit. Since each mixed moment of a collection of random variables can be expressed as a polynomial in their cumulants (for example, via the moment-cumulant formula [44]), it follows that the tuple (31) converges in moments to some distribution. The multidimensional Gaussian distribution can be characterized by the property that its cumulants vanish (except for the mean value and the covariance) thus this limit is a Gaussian distribution. The Gaussian distribution is uniquely determined by its moments; it follows that convergence in moments implies weak convergence, as required.

Kerov-Olshanski algebra and its spin analogue
The usual (linear) Kerov-Olshanski algebra A [14,23] (also known under the less compact name algebra of polynomial functions on the set of Young diagrams; in the monograph [29,Sect. 7] it is referred to as Ivavov-Kerov algebra) is an important tool in the (linear) asymptotic representation theory of the symmetric groups. One of its advantages comes from the fact that it can be characterized in several equivalent ways (for example as the algebra * of shifted symmetric functions); it also has several convenient linear and algebraic bases which are related to various viewpoints and aspects of the asymptotic representation theory. In particular, it was an important ingredient in the proof of Gaussianity of fluctuations for random (non-shifted) Young diagrams [41].
For the purposes of the current paper we will need the spin analogue of Kerov-Olshanski algebra [16].
In the current section we shall present these two algebras, as well as their modifications related to a different multiplicative structure ("disjoint product") and the links between them. The main result of the current section is Theorem 4.2. Our strategy of proof is to use the link between the linear and the spin setup which we explored in [31]. This section is purely algebraic: all calculations are exact, there are no asymptotic assumptions, there is no randomness, there are no representations and no random Young diagrams.

Normalized characters of the symmetric groups
The usual way of viewing the characters of the symmetric groups is to fix the irreducible representation λ and to consider the character as a function of the conjugacy class π . However, there is also another very successful viewpoint due to Kerov and Olshanski [23], called dual approach, which suggests to do roughly the opposite. It turns out that the most convenient way to pursue in this direction is to define-for a fixed integer partition π -the normalized character on the conjugacy class π as a function on the set of all Young diagrams Ch π : Y → C given by Ch π (λ) := n ↓k tr ρ λ (π ∪ 1 n−k ) if n ≥ k, 0 otherwise, where n = |λ| and k = |π |. Above, ρ λ (π ∪1 n−k ) denotes the irreducible representation of the symmetric group S n evaluated on any permutation from S n with the cycle decomposition given by the partition π ∪ 1 n−k ; furthermore tr is the normalized trace (9); and n ↓k = n(n − 1) · · · (n − k + 1) denotes the falling power.

Kerov-Olshanski algebra
For the purposes of the current paper, Kerov-Olshanski algebra A := span{Ch π : π ∈ P} may be defined as the linear span of the normalized linear characters of the symmetric groups. We equip if with a filtration F 0 ⊆ F 1 ⊆ · · · ⊆ A given by where π = |π | + (π ).
This specific choice of the filtration is motivated by investigation of asymptotics of (random) Young diagrams and tableaux in the scaling in which they grow to infinity in such a way that they remain balanced [4,41].

Disjoint product and the algebra A •
The characters (Ch π : π ∈ P) turn out to form a linear basis of A which allows us to define a new multiplication on A, the disjoint product, by setting where the product of two partitions π 1 π 2 on the right-hand side should be understood-just like in Sect. 2.5.1-as their concatenation. The vector space A equipped with the disjoint product • becomes a unital, commutative, Z ≥0 -filtered (with respect to the usual filtration (33)) algebra which will be denoted by A • .
To summarize: the vector space A can be equipped with two distinct multliplicative structures which correspond to the pointwise product and to the disjoint product. Comparison of these two multiplicative structures turns out to be a fruitful idea in asymptotic representation theory [41]. We recall the key result of this flavour below in Theorem 4.1.

Approximate factorization property for linear characters
The following result turned out to be essential for proving Gaussianity of fluctuations for random Young diagrams in [41]. Our goal in this section is to prove its spin analogue (Theorem 4.2).

Proposition 4.1 The identity map
has the approximate factorization property. Furthermore, the second cumulant of this map is given by Ch (a 1 +b 1 −1),...,(a r +b r −1) + terms of degree at most(k 1 + k 2 − 2).
The first proof of this result was found by the second-named author [41,Theorem 15]. For a sketch of an alternative proof based on Stanley character formula and some more historical context we refer to [42,Sect. 1.13]. An extension of this result to the context of Jack symmetric functions and Jack characters was proved by a yet another method in [43, Theorem 2.3].

Normalized spin characters
Following Ivanov [16,17] (see also [31]), for a fixed odd partition π ∈ OP the corresponding normalized spin character is a function on the set of all strict partitions given by where n = |ξ | and k = |π |.

Spin Kerov-Olshanski algebra
We define the spin Kerov-Olshanski algebra (maybe Ivanov algebra would be an even better name) as the linear span of spin characters [16,Sect. 6]. Ivanov proved that the elements of can be identified with supersymmetric polynomials, thus is a unital, commutative algebra. Following [31, Sect. 1.6], we equip with a filtration G 0 ⊆ G 1 ⊆ · · · ⊆ defined by

Disjoint product and the algebra 0 •
Similarly as in Sect. 4.1.3 we define the disjoint product of spin characters Ch spin π 1 • Ch spin π 2 := Ch spin π 1 π 2 for arbitrary π 1 , π 2 ∈ SP. We denote by • the filtered algebra which, as a vector space, coincides with and is equipped with a multiplication given by the disjoint product •.

Approximate factorization property for spin characters Theorem 4.2 The identity map
id : • −→ has the approximate factorization property. Furthermore, the second cumulant of this map is given-for any odd integers k 1 , k 2 ≥ 1-by where the second sum runs over integers a 1 , . . . , a r , b 1 , . . . , b r ≥ 1 such that a 1 + · · · + a r = k 1 , and b 1 + · · · + b r = k 2 and for each i ∈ [r ] the sum a i + b i is even.
The proof is postponed to Sect. 4.6. Our strategy is to explore the link between the linear and the spin setup.

Double of a strict partition
We denote by P n the set of partitions of a given integer n ≥ 0. The theory of partitions and Young diagrams is more developed than its shifted counterpart. For this reason it is convenient to encode a given strict partition ξ ∈ SP n by its double D(ξ ) ∈ P 2n . Graphically, D(ξ ) corresponds to a Young diagram obtained by arranging the shifted Young diagram ξ and its 'transpose' so that they nicely fit along the 'diagonal', cf. Fig. 1, see also [27, p. 9].

Double of a function
If F : P → C is a function on the set of partitions, we define its double as the function D * F : SP → C on the set of strict partitions for ξ ∈ SP given by doubling of the argument. and, additionally, preserves the filtration, i.e.
In the following we well need to compute the images D * Ch ρ of the linear basis of A. The following two results provide the necessary information.
Proof We start with the special case when ρ / ∈ OP contains exactly one part which is even. In this case ρ is an odd integer.
Clearly Ch ρ ∈ F ρ ; Eq. (41) implies therefore that D * Ch ρ ∈ G ρ . We revisit the definition (38) of the filtration G. Note that π is always an even integer for any π ∈ OP; it follows therefore that G 2k+1 = G 2k for any integer k ≥ 0. In particular, G ρ = G ρ −1 . In this way we proved that D * Ch ρ ∈ G ρ −1 , as required.
Let ρ = (ρ 1 , . . . , ρ ) / ∈ OP be now a general partition. We consider the identity map id A : A • → A and the corresponding cumulants. The system of equations (analogous to (27)) which express the cumulants in terms of the moments can be inverted. The resulting moment-cumulant formula [44] expresses any given moment as a polynomial in terms of the cumulants of the individual factors Ch ρ 1 , . . . , Ch ρ . For example, In the general case, the summands in such an expansion of (44) can be split into the following two classes: (a) the unique summand (b) the remaining summands; each such a summand contains at least one factor with a cumulant κ id A k for some k ≥ 2. We apply the map D * to (44) or, equivalently, to its aforementioned expansion to the products of cumulants and we investigate the resulting terms.
In the case (a), by applying D * to (45) we get The discussion from the very beginning of this proof (the special case when ρ has exactly one even part) it follows that for each of the factors we have that D * Ch ρ i ∈ G ρ i +1 if ρ i is odd and D * Ch ρ i ∈ G ρ i if ρ i is even. Thus the degree of (46) is bounded from above by ρ − (number of parts of ρ which are even).
In the case (b), by approximate factorization property each cumulant κ id A k causes a decrease of the degree by 2(k − 1). It follows that the image of the considered summand under the map D * is of degree at most ρ − 2.
This completes the proof.

Remark 4.6
It would be very interesting to have some explicit closed formula (maybe in the flavour of Eq. (42)) for D * Ch ρ in the case when ρ / ∈ OP. Such a formula would make the link between Kerov-Olshanski algebra A and its spin counterpart even more explicit.
We conjecture that the degree bound (43) is not optimal and that D * Ch ρ is of degree at most ρ − (number of parts in ρ which are even) for an arbitrary partition ρ.

Abstract viewpoint on Proposition 4.4
We define the vector space A odd • := span{Ch π : π ∈ OP} ⊂ A which is spanned by the characters corresponding to odd partitions. This vector space, equipped with the disjoint product •, is a unital, commutative algebra.
We consider the algebra homomorphism : A odd • → • ⊗ • which is defined on the algebraic basis of A odd • by an analogue of the Leibniz rule With these notations, the following result is a straightforward reformulation of Proposition 4.4.

Corollary 4.7 The following diagram commutes
where the upper horizontal arrow is an inclusion of vector spaces.

Cumulants of characters
The following result provides a direct link between the cumulants for id A : A • → A and id : • → .
where the cumulant on the left hand side concerns the identity map id : • → while the cumulant on the right-hand side concerns the identity map Proof Since both vertical arrows in the commutative diagram (47) are unital homomorphisms of algebras, it follows immediately that the cumulants for the two horizontal arrows are related by the identity for any x 1 , . . . , x ∈ A odd • . We will consider the special case of this equality when each x i = Ch k i is a character corresponding to a partition (k i ) ∈ OP which consists of a single part which is odd. Then Since the cumulant is linear with respect to each of its arguments, the right-hand side can be expanded to 2 summands. Each summand is the cumulant κ m applied to an -tuple of elements, with each element either from the subalgebra • ⊗ 1 or from the subalgebra 1 ⊗ • . Since these two subalgebras are classically independent with respect to the expected value m, any mixed cumulant vanishes. It follows that out of these 2 summands there are only two which are non-zero and

Proof of Theorem 4.2
Proof of Theorem 4.2 By Lemma 3.8, in order to prove the first part it is enough to show that the cumulant on the left-hand side of (48) is an element of of degree at most (k 1 + 1) + · · · + (k + 1) − 2( − 1).
However, the approximate factorization property for the map id A (Theorem 4.1) combined with Proposition 4.3 show this degree bound for the right-hand side of (48), as required.
For the second part we apply (48) in the special case = 2. The second cumulant κ id A 2 which contributes to the right-hand side is explicitly given by (35). It remains now to evaluate D * Ch ρ for ρ = (a 1 + b 1 − 1), . . . , (a r + b r − 1) .
A simple parity argument shows that there is an even number of even parts of such a partition ρ. In particular, if ρ / ∈ OP then the number of its even parts is at least 2. Proposition 4.5 is then applicable and shows that in this case D * Ch ρ is of degree at most k 1 + k 2 − 2.
In the opposite case when ρ ∈ OP, the exact value of D * Ch ρ is given by it follows that which completes the proof.

Free cumulants revisited
We revisit Sect. 2.6. For an integer n ≥ 2 and ξ ∈ SP we define S spin n (ξ ) = S n (ω ξ ) = (n − 1) By the symmetry of the profile ω ξ : R → R it follows that S Note that the free cumulants for strict partitions defined above and the ones considered by Matsumoto [28] differ by a factor of 2. Proof Comparison of Figs. 2 and 3 shows that the measures σ ω ξ and σ ω D(ξ ) are equal, up to a translation by 1 2 . In particular, The The systems of Eqs. (22) and (23) imply that the analogous claims hold as well for the free cumulants R

The key tool
Suppose that we are given a (sequence of) spin representation(s) and the corresponding (sequence of) character ratio(s). As we already mentioned, sometimes it is more convenient to pass from the character ratio to the corresponding cumulants. Interestingly, there are three distinct natural types of such cumulants, each having its own advantages. In the current section we will review them and prove the key tool of the current paper, Theorem 5.1 which provides a link between them.

Three types of cumulants for the character ratios
We will use the setup considered in Sect. 3.6, i.e. V (n) is a sequence of representations and χ (n) is the corresponding sequence of the character ratios.

Cumulants of partitions
The first type of cumulants we will use are the ones which correspond to the linear map χ : C[OP] → X, see Eq. (30). These cumulants κ χ (π 1 , . . . , π ) are indexed by odd partitions π 1 , . . . , π ∈ OP. The advantage of these cumulants lies in the observation that in the applications we are often given a representation in terms of its characters and thus such cumulants can be often calculated explicitly without much effort. Regretfully, these cumulants do not have a truly probabilistic interpretation. This kind of cumulants will appear in Theorem 5.1 within conditions (a) and (b).

Cumulants in 0
Let us fix for a moment an integer n ≥ 1. We consider the discrete probability space n = SP n equipped with the probability distribution P V (n) ; we denote by ξ (n) a random strict partition in SP n with the same probability distribution P V (n) . By restricting the domain of the functions, any element X ∈ can be viewed as a function on the set SP n or, equivalently, as a random variable on the probability space n . We are interested in its expected value E (n) X = EX ξ (n) .
We define a unital map E : → X by setting for any X ∈ . In the case when X is a normalized spin character, this definition takes the following more concrete form The last equality is a consequence of the definition (36) of the normalized spin characters. The cumulants κ E (X 1 , . . . , X ) which correspond to this map have a direct probabilistic meaning. This kind of cumulants will appear in Theorem 5.1 within conditions (c) and (d).

Cumulants in 0 •
The equality = • between the vector spaces allows us to view the aforementioned map E as a function on • . We will denote it by E • : • → X. The cumulants κ E • (X 1 , . . . , X ) which correspond to this map do not have a probabilistic meaning.
This kind of cumulants will appear in Theorem 5.1 within conditions (e) and (f). Since the algebras and • have different multiplicative structures, the cumulants for the maps E and E • are also different.

The key tool
The following theorem is a direct analogue of a result of the second-named author [41, Theorem and Definition 1] which concerns the usual (non-projective) representations of the symmetric groups, see also [11,Theorem 2.3] for a generalization to Jack characters.
In the following for an integer (or half-integer) k we denote by n k := (1 k , 2 k , . . . ) ∈ X the sequence of powers of the integers. Theorem 5.1 Assume that for each integer n ≥ 1 we are given a representation V (n) of CS − n . Then the following conditions are equivalent: (a) for all odd partitions π 1 = (k 1 ), . . . , π = (k ) ∈ OP which consist of exactly one part κ χ (π 1 , . . . , π ) n π 1 +···+ π +2( −1) 2 all odd partitions π 1 , . . . , π ∈ OP κ χ (π 1 , . . . , π ) n π 1 +···+ π +2( −1) 2 (c) there exists a set X ⊆ which generates as a filtered algebra with the property that for all (e) there exists a set X ⊆ • which generates • as a filtered algebra with the property that for all x 1 , . . . , Furthermore, if the left-hand side of any of the expressions above has a limit for n → ∞ for all ≤ 2 and all prescribed choices of π 1 , . . . , π (respectively, x 1 , . . . , x ), then each of the the left-hand sides of the above expressions has a limit for n → ∞. These limits for ≤ 2 are interrelated as follows: for any odd integers k, k 1 , k 2 ≥ 1 where ξ (n) denotes a random strict partition with the probability distribution P V (n) , where the last sum runs over integers a 1 , . . . , a r , b 1 , . . . , b r ≥ 1 such that a 1 + · · · + a r = k 1 , and b 1 + · · · + b r = k 2 and for each i ∈ [r ] the sum a i + b i is even.
Proof The proof is fully analogous to [41, Theorem and Definition 1, Theorem 3]; we just have to make sure that all ingredients of the old proof have their spin counterparts. The list of new ingredients: the information about disjoint cumulants is provided by Theorem 4.2, the link between non-normalized and normalized spin characters is provided by definition (36). The calculation is fully analogous to the linear case, however one should carefully track the powers of 2 which come from two distinct sources: the choice of normalization used in (36) as well as (39).

Proof of Theorem 2.5
Proof of Theorem 2.5 The proof of a very similar result presented in [11,Sect. 5] works also in our setup. In fact, we consider the simplest possible case of the latter result (with the notations of [11] this corresponds to α = 1, g = 0). We just have to make sure that all ingredients of the proof have their spin counterparts and indeed Theorem 5.1 provides the necessary tools. Alternatively, it was observed by De Stavola [10, Sect. 4.5] that central limit theorem (a la Theorem 2.6) for shifted Young diagrams implies also law of large numbers. The proof of De Stavola can be adapted easily to our context.

Proof of Theorem 2.6
Proof of Theorem 2.6 This proof is fully analogous to the proof of [41,Corollary 4]: in order to show convergence to the Gaussian distribution it is enough to check that the higher cumulants converge to zero.

Example: shifted Plancherel measure
We continue the discussion of the spin part of the left-regular representation from Example 2.4. Theorem 2.5 is applicable in this context with for any even integers k, l ≥ 2.
The limit shape with the corresponding sequence of free cumulants given by (26)

Proof of Theorem 1.3
Proof of Theorem 1. 3 We consider the vector space which with the action of the spin symmetric group S n given by [50,Sect. 4.3 combined with (2.5)] becomes a (reducible) spin superrepresentation. Its decomposition into irreducible components is provided by Sergeev duality [50,Theorem 4.8]; in particular it follows that the corresponding probability measure P V SW d,n on SP n coincides with the measure P SW n,d considered in (7). The character of V SW d,n is given by for any π ∈ OP n . In the same way as in Example 2.4 we calculate the corresponding cumulants; it follows that κ (π 1 , . . . , π ) = 0 for all ≥ 2.
We set d = d n ; it follows that Theorem 2.5 is applicable with for any odd integers k, k 1 , k 2 ≥ 1. The explicit form of the limit shape SW c will be found in Sect. 7.3.

Proof of Corollary 1.5
Proof of Corollary 1. 5 We are interested in the rescaled diagram ω 1 dn ξ , where ξ := Q(w) ≤αd 2 n is the level curve of the recording tableau. The distribution of the random shifted Young diagram ξ is given by Schur-Weyl measure P SW The limit shape Q can be then recovered from the family of curves Q α by setting

Proof of Corollary 1.4
Proof of Corollary 1. 4 The level curve ξ = P(w) ≤α n d can be obtained by the following two-step procedure: firstly, we remove from the random word w all entries which are bigger than the threshold α n d and denote the resulting word by w ; then we consider the common shape of the tableaux associated by shifted RSK correspondence to w .
We denote by n the random length of the word w . Since the distribution of n is Bin(n, α n d 2 ) it follows that n α n 2 holds true in probability. The limit shape of ω 1 √ 2n ξ is provided by Theorem 1.3 with By comparison of the normalization factors it follows that ω d n ξ is a dilation of ω 1 √ 2n ξ by the factor d √ 2n n → √ 2α. It follows that the theorem holds for P α equal to the dilation of SW 1 √ α by the factor √ 2α: The limit shape P can be then recovered from the family of curves P α by setting P(x, y) = sup{α ≥ 0 : P α (x − y) ≤ x + y}.

Random shifted tableaux with prescribed shape: Proof of Theorem 1.1.
The current section is devoted to the proof of Theorem 1.1. For Reader's convenience the proof is split into several subsections. Note that some of the intermediate results might be interesting by themselves.

Random shifted tableaux and the spin representation theory
We start with the link between random shifted standard tableaux and the spin representation theory of the symmetric groups. This link (Proposition 6.1) is fully analogous to the classical link between non-shifted standard tableaux and the linear representation theory of the symmetric groups. Unfortunately, the proof of Proposition 6.1 is more complex than its classical counterpart because not all edges in the Bratteli diagram are simple. We present the details below.

Random shifted tableaux
For a given shifted standard tableau T with shape μ ∈ SP n and an integer 0 ≤ m ≤ n we denote by T ≤m the set of boxes of T which are smaller or equal than m. This set of boxes corresponds to some ξ ∈ SP m . Thus T ≤m := ξ can be regarded as a shifted partition.
We fix μ ∈ SP n and consider a uniformly random tableau T ∈ T μ with this prescribed shape. We are interested in the probability distribution of the random strict partition T ≤m .

Restriction of irreducible representations
We fix μ ∈ SP n and consider the corresponding irreducible representation V μ of CS − n . For an integer 0 ≤ m ≤ n the restriction is a representation of the spin group algebra CS − m . We are interested in the corresponding probability measure on the set SP m which gives the probability distribution of a random irreducible component of (49).

The link
The following result shows that the two probability measures on SP m which we considered in Sects. 6.3.2 and 6.3.3 are equal.
Proposition 6.1 Let μ ∈ SP n and 0 ≤ m ≤ n. Then for any ξ ∈ SP m Proof We consider the Bratteli diagram for the sequence of superalgebras CS − 0 ⊆ CS − 1 ⊆ · · · . The vertices of this graph correspond to irreducible superrepresentations of CS − n over n ≥ 0 and hence can be identified with the strict partitions. This kind of graph (with different multiplicities of the edges) is known in the literature under the name of Schur graph [5,16].
We connect a superrepresentation ξ of CS . In the following we will describe the structure of this graph based on [22,Theorem 22.3.4].
For strict partitions ξ, ζ we write ξ ζ if the shifted Young diagram ξ is obtained from ζ by removal of a single box. It turns out that in the Bratteli diagram there is an oriented edge from ξ to ζ if and only if ξ ζ . If this is the case, the multiplicity of this edge is given by m(ξ, ζ ) = 2 ifξ ∈ SP + andζ ∈ SP − , 1 otherwise, see Fig. 9.
We start by pointing out that the statement of Proposition 6.1 is not very precise in the case when μ ∈ SP − since in this case there are two irreducible representations which correspond to μ. However, in the light of Sect. 2.4 this subtlety is irrelevant because both representations have equal character ratios on OP. In the following we change our setup to superrepresentations of the superalgebras CS − n and CS − m ; by the same argument this does not change the probability distribution on the right-hand side of (50).
Our strategy is to evaluate the denominator and the numerator on the right-hand side of (10) in the special case when is the restriction of the irreducible superrepresentation corresponding to μ.
The denominator, the dimension of the irreducible superrepresentation V μ is equal to the sum over all paths in the Bratteli diagram which connect the trivial onedimensional representation ∅ with μ. The weight of each path is equal to the product of the multiplicities of all edges. This product is a power of 2 with the exponent c equal to the number of the elements in the set 0 ≤ i ≤ n − 1 : μ i is even and μ i+1 is odd .
Since μ 0 , . . . , μ n is a weakly increasing sequence of integers which at each step increases by at most one, it follows that the cardinality of (52) is equal to the number of even integers in the interval {0, . . . , μ − 1} which is equal to Note that this number does not depend on the choice of the path in the Bratteli diagram with a specified endpoint μ. In this way we proved that The latter formula does not involve the multiplicities of the edges in the Bratteli diagram; for this reason it is convenient to replace the latter by Schur graph, see Fig. 10. The shifted Young diagram is obtained from Bratteli diagram by removing the multiplicities of the edges. Clearly, there is a bijective correspondence between paths in the shifted Young graph and shifted standard Young tableaux. In this way we proved that The numerator on the right-hand side of (10), the product is a sum analogous to the right-hand side of (51) over paths which pass through the vertex ξ . A reasoning analogous to the one above implies that The paths which contribute to the second factor on the right-hand side are in a bijective correspondence with the shifted tableaux The latter observation combined with (53) concludes the proof.

Irreducible representations have approximate factorization property
We will show that a sequence of irreducible representations (V ξ (k) ) has approximate factorization property (Definition 2.3), provided that the strict partitions ξ (k) converge to some limit shape. It might seem silly to prove this kind of result since the main purpose of approximate factorization property is to serve as the assumption of Theorems 2.5 and 2.6 which are trivially satisfied for irreducible representations. The key point is that Theorem 5.1 will allow us to produce new examples (often more interesting ones) of the sequences with approximate factorization property from old (and boring) examples. Clearly, Definition 2.3 still makes sense and Theorem 5.1 remains true if we replace the sequence (V (n) ) of representations by its subsequence (V (n k ) ) for some sequence (n k ) of positive integers which tends to infinity; in the following we will use Theorem 5.1 in this formulation.

Proposition 6.2
We keep the notations and the assumptions from Theorem 1.1. We define V (n k ) := V ξ (k) to be the irreducible representation of CS − n k . Then the sequence (V ξ (k) ) has the approximate factorization property.
Proof The corresponding probability measure P V (n k ) is the point measure supported in ξ (k) . With the notations of Sect. 5.1.2 the corresponding random strict partition is deterministic, almost surely equal to ξ (k) . All higher cumulants κ l (with l ≥ 2) of deterministic random variables are equal to zero; it follows that for l ≥ 2 condition (c) of Theorem 5.1 is trivially fulfilled for any choice of X ⊆ .
Take X = {S spin 2 , S spin 4 , . . . } ⊆ ; our plan is to verify that condition (c) of Theorem 5.1 is fulfilled also for l = 1. Firstly, note that by Proposition 4.9 the set X indeed generates as a filtered algebra. The first cumulant κ 1 takes a particularly simple form and The balancedness condition implies that the limit exists thus condition (c) of Theorem 5.1 is indeed fulfilled.

Restriction of representations with approximate factorization property
The following reasoning is based on its non-shifted analogue [41,Theorem 8].
We fix 0 < α < 1. We define n k := αn k and consider a restriction . We claim that the sequence (W (n k ) ) also has approximate factorization property. Indeed, in order to verify approximate factorization property (no matter if we consider (V ξ (k) ) or the sequence of its restrictions (W (n k ) )) we need to understand the asymptotics of the left-hand side of (18). The only difference that in the context of (V ξ (k) ) the right-hand side is while in the context of (W (n k ) )) this right-hand side should be understood as (55) Asymptotically, expressions (54) and (55) differ by a multiplicative factor which concludes the proof of our claim. It follows that Theorem 2.5 is applicable and ω 1 √ 2n k T (k) ≤αn k (x) indeed converges in probability to a limit shape α which is uniquely determined by the sequence of its free cumulants The problem of finding the limit curves explicitly might be computationally challenging, see Sect. 7. Nevertheless in some cases we might be lucky to have a concrete final answer, see below.

The example of Linusson, Potka and Sulzgruber
Pittel and Romik [33] studied asymptotics of random standard Young tableaux having a square shape; in other words it was the non-shifted analogue of the problem studied by Linusson, Potka and Sulzgruber in [25]. The result of Pittel and Romik implies in particular that the (scaled down) level curves of such random standard Young tableaux converge in probability to a family of curves defined for −1 < z < 1 by for some explicit function L which describes the limit shape of the tableau.
On the other hand, the results of Biane [4, Theorem 1.5.1] also imply convergence of rescaled level curves to some family of curves α which are defined via the free cumulants: where 1 describes the profile of the square Young diagram with a unit area. By combining the results of Pittel and Romik with these of Biane it follows that both limits are equal. In particular, the curves (56) have known free cumulants (57).
The problem studied by Linusson, Potka and Sulzgruber [25] of asymptotics of random shifted staircase tableaux fits into the framework of Theorem 1.1 with the limit shape 1 the same as the limit shape in the problem of Pitman and Romik. Furthermore, in the proof of Theorem 1.1 we showed that the level curves α fulfil the same Eq. (57). It follows that the level curves for the asymptotics of shifted staircase tableaux are the same as the limit level curves for square Young tableaux which was already observed in [25].

How to recover the limit shape?
The results of the current paper (such as Theorem 2.5) describe the limit shape of one or another class of large Young diagrams (this limit is given by some continual Young diagram ω : R → R + ) in terms of the sequence of its free cumulants R 2 (ω), R 3 (ω), . . . . For Readers interested in concrete applications such a description might be not sufficient and they would prefer to recover the limit shape ω itself. This problem has a well-known answer; for Reader's convenience we shall review it briefly.

Free cumulants, Cauchy transform, free probability
In Sect. 2.6 we defined free cumulants R 2 , R 3 , . . . for a continual Young diagram ω quite directly via the functionals S 2 , S 3 , . . . , cf. (21), which have a direct geometric interpretation in terms of the shape of ω. The advantage of this approach lies in its simplicity.
Also, as we already discussed in the proof of Theorem 2.5, by inverting the relationship between (R n ) and (S n ), cf. (23), we see that the sequence of free cumulants determines uniquely the sequence of moments of the measure σ ω considered in (20). Under some mild assumptions Hamburger moment problem [1] has a unique solution which shows that the measure σ ω is uniquely determined. In the case when such an existential result is not enough and one would like to find the measure σ ω explicitly, we will need some tools of the complex analysis. For this reason we need to recall the equivalent, original definition of free cumulants for Young diagrams. Originally, such free cumulants for Young diagrams were defined via a two-step process [4] which we recall in the following.

The first step
Kerov [21,Sect. 7] associated to a given continual Young diagram ω two measures on the real line. The first one, called Rayleigh measure, is a signed measure given by the second derivative of ω in the distributional sense. The second one, called transition measure, is the unique probability measure μ = μ ω for which the corresponding Cauchy-Stieltjes transform is given by for z ∈ C \ R. In our setup the transition measure is compactly supported.

The second step
Free cumulants originate in the context of the random matrix theory and Voiculescu's free probability theory, see [30] for an overview. For a compactly supported probability measure μ the corresponding R-transform is an analytic function R = R μ on a neighbourhood of 0 on the complex plane which fulfils the equation for z ∈ C in some neighbourhood of zero. In the specific setup which we consider in the current paper when μ = μ ω is the transition measure of a continual Young diagram R(z) = n≥2 R n z n−1 turns out to be the generating function of the sequence of the free cumulants R 2 , R 3 , . . . presented in Sect. 2.6; the proof and additional context can be found in see [7,Sect. 3].

How to recover the limit shape?
Equality (58) implies that in other words the left-hand side coincides with the Cauchy-Stieltjes transform of the signed measure τ . The measure τ can be recovered from its Cauchy-Stieltjes tranform by Stieltjes inversion formula [30, Sect. 3.1] which in our context takes the form for any real numbers a < b. Note that the left-hand side is equal to for all a < b for which the derivative of ω is well-defined. Thus by considering the limit a → −∞ we get a formula for the cumulative distribution function of τ : which holds true for all z ∈ R for which ω (z) is well-defined. It follows that the shape of the continual Young diagram is given by To summarize: in order to find the continual diagram ω it is enough to know its Cauchy transform G. For some classical concrete examples of finding the Cauchy transform when the sequence of free cumulants is known we refer to [30,Sect. 3.1]. In the following we will analyse in detail one concrete example.

Example: Schur-Weyl measure for c = 1
We will calculate explicitly the Schur-Weyl limit curve SW c (cf. Sect. 1.7.2) in the special case c = 1. We look for a continual Young diagram with the sequence of free cumulants given by This sequence of free cumulants was considered by Deya and Nourdin [8,Sect. 2.5].
With our notations the R-transform is given by note that [8] use a definition of R-transform which differs by a factor of z. Equation (59) shows therefore that y = G(z) is a solution to the cubic equation For z = 0 this equation has three solutions given by Cardan's formulae. Any Cauchy transform G(z) fulfils some known properties (such as asymptotics for z → ∞); by checking them Deya and Nourdin are able to pinpoint the right solution of the cubic equation which gives G(z). Thus we have a closed formula for G(z). Regretfully, computation of the argument arg G(z), even if z converges to the real line, is a computational challenge; in particular we did not attempt to find a closed formula for the integrals appearing in (60). Even though we are not able to evaluate these integrals they are analytic functions. It follows that the limit curve SW c is piecewise analytic. On the bright side, these integrals are easily accessible for a numerical integration and the limit curve SW c can be efficiently calculated, see Fig. 5.

Schur-Weyl measures, the generic case
The above discussion of the special case c = 1 is applicable also in the generic case. Note, however, that for some values of c the behavior of the Cauchy transform and its singularities might be different. For example, in the case c = 2 shown on Fig. 6 the support of the Rayleigh measure is a union of two intervals (located symmetrically with respect to 0) and of the point {0}; in particular it follows that SW 2 (x) = |x| + √ 2 2 for x in a small neighbourhood of 0.
Since this topic is vast and the current paper is already lengthy we postpone more details to a forthcoming publication.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, 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://creativecommons.org/licenses/by/4.0/.

Appendix A: Preliminaries on spin representation theory
We reviewing the rudiments of the spin representation theory of the symmetric groups. For more details and bibliographic references we refer to [16,22,45,50].

A.1.1. Linear representations
Recall that a linear representation of a finite group G is a group homomorphism ψ : G → GL(V ) to the group of linear transformations GL(V ) of some finitedimensional complex vector space V .

A.1.2. Projective representations
A projective representation of a finite group G is a group homomorphism ψ : G → PGL(V ) to the group of projective linear transformations PGL(V ) = GL(V )/C × of the projective space P(V ) for some finite-dimensional complex vector space V . Equivalently, a projective representation can be viewed as a map φ : G → GL(V ) to the general linear group with the property that ψ(x)ψ(y) = c x,y ψ(x y) holds true for all x, y ∈ G for some non-zero scalar c x,y ∈ C × . Each irreducible linear representation ψ : G → GL(V ) gives rise to its projective version ψ : G → PGL(V ). The irreducible projective representations which cannot be obtained in this way are called irreducible spin representations and are in the focus of the current paper.

A.2. Spin symmetric group and spin characters
The spin group S n [37] is a double cover of the symmetric group: More specifically, it is the group generated by t 1 , . . . , t n−1 , z subject to the relations: t i t j = zt j t i for |i − j| ≥ 2; we use the convention that [k] = {1, . . . , k}. Under the mapping S n → S n the generators t 1 , . . . , t n−1 are mapped to the Coxeter tranpositions (1, 2), (2, 3), . . . , (n − 1, n) ∈ S n . The main advantage of the spin group comes from the fact that any projective representation ψ : S n → PGL(V ) of the symmetric group can be lifted uniquely to a linear representation ψ : S n → GL(V ) of the spin group so that the following diagram commutes: In this way the projective representation theory of the symmetric group S n is equivalent to the linear representation theory of the spin group S n which allows to speak about the characters. The irreducible spin representations of S n turn out to correspond to irreducible linear representations of the spin group algebra CS − n := C S n / z + 1 which is the quotient of the group algebra C S n by the ideal generated by (z + 1). Equivalently CS − n = 1 − z ⊂ C S n can be identified with the ideal generated by the projection 1−z 2 .

A.3. Conjugacy classes of S n
We denote by OP the set of odd partitions, i.e. partitions which consist only of odd parts and by OP n the set of odd partitions of a given integer n ≥ 0. We denote by SP + n (respectively, SP − n ) the set of strict partitions ξ ∈ SP n with the property that the length ξ := |ξ | − (ξ ) is even (respectively, odd), see Fig. 9.
For a partition π n we denote by C π ⊂ S n the set of elements of the spin group which are mapped-under the canonical homomorphism S n → S n -to permutations with the cycle-type given by π .
Schur [37] proved the following dichotomy for π n: • if one of the following two conditions is fulfilled: • π ∈ OP n , or • π ∈ SP − n then C π splits into a pair of conjugacy classes of S n which will be denoted by C ± π ; • otherwise, C π is a conjugacy class of S n .

A.4. Conjugacy classes and spin characters
Any spin character vanishes on the conjugacy class C π which does not split, cf. [45, p. 95]. For this reason, from the viewpoint of the spin character theory only the conjugacy classes C ± π are interesting. Spin representations are exactly the ones which map the central element z ∈ S n to − Id ∈ GL(V ). Since C − π = zC + π , it follows that the value of any spin character on C − π is the opposite of its value on C + π . For this reason, from the viewpoint of the spin character theory the conjugacy classes C − π are redundant and it is enough to consider the character values only on the conjugacy classes C + π . From the viewpoint of the asymptotic representation theory it is natural to consider some sequence of groups together with some natural inclusions; in our case this is the sequence S 1 ⊂ S 2 ⊂ S 3 ⊂ · · · of spin groups. Such a setup allows to relate a conjugacy class of a smaller group to some conjugacy class in the bigger group and, in this way, to evaluate the irreducible characters of the bigger group on the conjugacy classes of the smaller one.
Regretfully, the conjugacy classes C + π which correspond to π ∈ SP − n do not behave nicely under such inclusions. Indeed, on the level of the symmetric groups the inclusion S n ⊂ S n+k corresponds to adding k fixpoints to a given permutation; in other words the set C π ⊂ S n corresponds to C π,1 k ⊂ S n+k and the latter does not split because (π, 1 k ) / ∈ SP n (at least for k ≥ 2) and (π, 1 k ) / ∈ OP n (because n − (π ) is odd which implies that at least one part of π is even).
For this reason, for the purposes of the asymptotic representation theory it is enough to consider only the conjugacy classes C + π for π ∈ OP n .

A.5. Irreducible spin representations
The relationship between strict partitions and the irreducible spin representations of the symmetric groups is not a bijective one. Nevertheless, as we shall discuss below, this non-bijectivity can be ignored to large extent. More specifically (see [37, p. 235] and [45, Theorem 7.1]), each ξ ∈ SP + n corresponds to a single irreducible representation. We denote by its character by φ ξ .
On the other hand, each ξ ∈ SP − n corresponds to a pair of irreducible spin representations with equal dimensions; we denote their characters by φ ξ + and φ ξ − . These two characters coincide on the conjugacy classes C ± π over π ∈ OP n . For the purposes of the current paper we not need to evaluate the characters on C ± π for π ∈ SP − n ; for this reason we do not have to distinguish between φ ξ + and φ ξ − and we may denote them by the same symbol φ ξ .

A.6. Superrepresentations
In order to avoid the aforementioned difficulty related to the fact that the relationship between the irreducible representations of CS − n and SP n is not bijective we may change our setup to superalgebras and their superrepresentations. The following presentation is based on [22,Chapters 12,13,22].
We recall that a superalgebra is defined as an algebra A which is equipped with some Z 2 -grading A = A0 ⊕ A1. Similarly, a superspace is a linear space V equipped with some decomposition V = V0 ⊕ V1. The algebra End(V ) of endomorphisms of a superspace carries a natural structure of a superalgebra by declaring that X ∈ End(V ) is homogeneous of degree i ∈ Z 2 = {0,1} if and only if for any homogeneous vector v ∈ V j with j ∈ Z 2 we have that X (v) ∈ V i+ j .
A superrepresentation ψ : A → End(V ) of a superalgebra is an algebra homomorphism which has the additional property that for any homogeneous element x ∈ A i of degree i ∈ Z 2 its image ψ(x) ∈ End(V ) is also homogeneous of degree i.
We define a superalgebra structure on the spin group algebra C S n by declaring that the linear space of homogeneous elements of degree0 (respectively,1) is spanned by the group elements g ∈ S n which under the canonical projection S n → S n are mapped to even (respectively, odd) permutations. Then irreducible superrepresentations of CS − n are in a canonical bijective correspondence with strict partitions in SP n [22,Theorem 22.3.1].
[Here and in the following, the text in square brackets-such as this one-is intended only for Readers who are proficient in the terminology related to superalgebras. It provides some additional context but is not necessary for our purposes. ] We consider the irreducible superrepresentation which corresponds to ξ ∈ SP + . [It turns out to be of type M.] If we forget the superalgebra structure, it becomes an irreducible representation of the algebra CS − n with the character φ ξ , as discussed in Sect. "Appendix A.5".
We consider now the irreducible superrepresentation which corresponds to ξ ∈ SP − . [It turns out to be of type Q.] If we forget the superalgebra structure, it becomes a direct sum of the two irreducible representations of the algebra CS − n with the characters φ ξ ± , as discussed in Sect. "Appendix A.5". In particular, its character is equal to φ ξ + + φ ξ − .

A.7. Spin characters: conclusion
For each strict partition ξ ∈ SP n and each odd partition π ∈ OP n the value of the irreducible spin character φ ξ (π ) = Tr ψ ξ (c π ) is well defined, where c π ∈ C + π is a representative of the of the conjugacy class C + π , cf. [45, Eq. (2.1)].