Young Generating Function

• Young generating function is a formal power series encoding asymptotic behaviors in random partition theory via logarithmic derivatives.
• It employs representation theory to package symmetric group characters, facilitating analysis of LLN, CLT, and multilevel asymptotics in Young diagrams.
• The approach bridges combinatorial structures, free probability, and height function fluctuations, enabling conditioned Gaussian Free Field examinations.

Searching arXiv for the cited paper and closely related work on Young generating functions and nearby terminology. A Young generating function, in the representation-theoretic sense introduced in "Global fluctuations for standard Young tableaux," is the formal power series

$A_\rho(x_1,x_2,\ldots)=M_\rho(U_\infty)$

attached to a probability measure $\rho$ on $\mathbb Y_n$, the set of partitions of $n$. It is designed to encode asymptotic information about random partitions and random standard Young tableaux through the logarithmic derivatives of $A_\rho$ at the origin. In this framework, $A_\rho$ plays the role of a characteristic function for random partitions: its first derivatives determine limiting transition measures and laws of large numbers, its second derivatives determine covariances and central limit theorems, and its multilevel extension leads to two-dimensional fluctuation results for height functions, whose limits are identified as a conditioned Gaussian Free Field (Raposo, 24 Jul 2025).

1. Definition and representation-theoretic construction

The ambient combinatorial objects are Young diagrams, viewed in Russian notation. If $\lambda$ is a partition, its boundary is a piecewise-linear curve $\omega=\omega_\lambda$ embedded in the upper half-plane by the change of variables

$x=s-r,\qquad y=r+s,$

where $r$ is the row index and $\rho$0 is the column index. The diagram is then viewed as a continuous diagram

$\rho$1

For a probability measure $\rho$2 on $\rho$3, the construction begins with the associated character on the inductive limit $\rho$4 of symmetric groups,

$\rho$5

extended by zero off $\rho$6. One then chooses disjoint permutations $\rho$7 that are products of $\rho$8 disjoint $\rho$9-cycles, for $\mathbb Y_n$0, and defines

$\mathbb Y_n$1

as an element of $\mathbb Y_n$2, understood as the inverse limit of truncations at finite $\mathbb Y_n$3. The Young generating function is then

$\mathbb Y_n$4

Since $\mathbb Y_n$5, the formal series $\mathbb Y_n$6 is well-defined. Although $\mathbb Y_n$7 depends on the choice of disjoint representatives $\mathbb Y_n$8, $\mathbb Y_n$9 does not, because $n$0 is conjugation-invariant (Raposo, 24 Jul 2025).

This construction is explicitly representation-theoretic. It packages the character values of the symmetric groups into a formal object that can be differentiated, and those derivatives recover asymptotic data of random partitions at the $n$1 scale. The inverse-limit algebra $n$2 and the group ring $n$3 are therefore not auxiliary formalities; they are the setting in which characters, cumulants, and asymptotic moments are brought into a single calculus.

2. Transition measures, logarithmic derivatives, and free-probability content

The key analytic object attached to a partition $n$4 is Kerov’s transition measure $n$5. For a continuous diagram $n$6 on $n$7, it is characterized by the Markov–Krein correspondence

$n$8

For discrete $n$9, one has

$A_\rho$0

where $A_\rho$1 are the minima of $A_\rho$2 and $A_\rho$3 are the Plancherel growth weights of adding a box at $A_\rho$4.

The logarithmic derivatives of $A_\rho$5 recover scaled moments and cumulants of $A_\rho$6. First derivatives of $A_\rho$7 along the variables $A_\rho$8 yield numbers $A_\rho$9, and these are assembled into

$A_\rho$0

Second derivatives yield numbers $A_\rho$1, assembled into

$A_\rho$2

Higher derivatives govern higher-order cumulants and Gaussianity criteria.

The paper identifies these quantities with the free-probability description of asymptotic transition measures. The coefficients $A_\rho$3 are the free cumulants of the rescaled limit of $A_\rho$4, and if $A_\rho$5 denotes the Stieltjes transform of the limiting transition measure, then

$A_\rho$6

In this sense, $A_\rho$7 is the Voiculescu $A_\rho$8-transform in the variables used by the paper, while $A_\rho$9 is the covariance-generating series controlling fluctuations (Raposo, 24 Jul 2025).

This organization is the conceptual core of the theory. A measure on partitions is replaced by a formal series; the logarithm of that series is differentiated; those derivatives become free cumulants and covariance data; and the asymptotic geometry of Young diagrams is then reconstructed from $\lambda$0 and $\lambda$1.

3. Law of large numbers, central limit theorem, and multilevel asymptotics

The asymptotic theory is formulated directly in terms of the derivatives of $\lambda$2. A sequence $\lambda$3 on $\lambda$4 is called LLN-appropriate if there exist numbers $\lambda$5 such that, for each $\lambda$6,

$\lambda$7

and, for each $\lambda$8 and $\lambda$9,

$\omega=\omega_\lambda$0

If

$\omega=\omega_\lambda$1

then $\omega=\omega_\lambda$2 satisfies a law of large numbers when $\omega=\omega_\lambda$3 and all higher cumulants vanish asymptotically. Theorem 2.3 states that these two conditions are equivalent, and gives the limit moments as

$\omega=\omega_\lambda$4

The central-limit regime is obtained by strengthening the derivative hypotheses. A sequence is CLT-appropriate if there exist $\omega=\omega_\lambda$5 and $\omega=\omega_\lambda$6 such that

$\omega=\omega_\lambda$7

and

$\omega=\omega_\lambda$8

If $\omega=\omega_\lambda$9 satisfies a CLT, then

$x=s-r,\qquad y=r+s,$0

and higher scaled cumulants vanish. Theorem 2.6 states that CLT-appropriateness is equivalent to this central limit theorem, with

$x=s-r,\qquad y=r+s,$1

and

$x=s-r,\qquad y=r+s,$2

The theory is intrinsically multilevel. If increasing partitions are sampled via the branching rule

$x=s-r,\qquad y=r+s,$3

then Theorem 3.1 gives a multilevel law of large numbers. For $x=s-r,\qquad y=r+s,$4, $x=s-r,\qquad y=r+s,$5, and

$x=s-r,\qquad y=r+s,$6

one has

$x=s-r,\qquad y=r+s,$7

Theorem 3.2 gives the corresponding covariance formula,

$x=s-r,\qquad y=r+s,$8

In particular, sublinear slices $x=s-r,\qquad y=r+s,$9 recover the semicircle limit and classical CLT (Raposo, 24 Jul 2025).

4. Height functions and the conditioned Gaussian Free Field

For a standard Young tableau of shape $r$0, the height function is

$r$1

the length of the diagonal $r$2 at time $r$3. In the multilevel setting, Theorem 3.1 implies the existence of a limiting surface

$r$4

To study fluctuations, the paper translates between transition measures, continuous diagrams, and co-transition measures, and linearizes Markov–Krein. For the continuous-diagram moments

$r$5

Lemma 4.1 expresses both $r$6 and $r$7 in terms of $r$8 and $r$9.

The limiting two-dimensional fluctuation field is not the unconditioned Gaussian Free Field. On the upper half-plane $\rho$00, the covariance kernel is

$\rho$01

where $\rho$02 is the multilevel parameter attached to $\rho$03 via a model-specific conformal map. The resulting Gaussian field $\rho$04 is identified as a Gaussian free field $\rho$05 conditioned by linear constraints along the level curves

$\rho$06

Proposition 4.2 makes this precise. If $\rho$07 is the closed linear span of integrals of $\rho$08 against smooth test functions over the curves $\rho$09, then

$\rho$10

where $\rho$11 is the orthogonal projection onto $\rho$12. The covariance of $\rho$13 is

$\rho$14

and the second term is exactly the conditioning term in $\rho$15 (Raposo, 24 Jul 2025).

The conditioned nature of the field is structurally important. It reflects the multilevel constraints inherited from Gelfand–Tsetlin branching, rather than a free Dirichlet field without extra linear conditions.

5. Principal models, examples, and technical machinery

The formalism is applied to three main classes of models, each with an explicit domain map and the same limiting fluctuation field.

Model	Defining data	Limiting fluctuation statement
Plancherel growth process	$\rho$16 if $\rho$17	$\rho$18
Extreme characters of $\rho$19	Thoma parameters $\rho$20	$\rho$21
Random SYT of fixed shape	$\rho$22	$\rho$23

For Plancherel measure on $\rho$24, $\rho$25, the associated character is the trivial character of $\rho$26, so

$\rho$27

Hence $\rho$28, $\rho$29, and the limit moments $\rho$30 are those of the semicircle law. The VKLS curve appears as the limit profile $\rho$31, with

$\rho$32

In the growth process, the limiting liquid region is mapped to $\rho$33 by

$\rho$34

and the level sets $\rho$35 map to semicircles $\rho$36.

For measures induced by extreme characters of $\rho$37, Thoma parameters $\rho$38 are scaled so that

$\rho$39

with $\rho$40. Then $\rho$41 is CLT-appropriate, and Proposition 4.4 gives

$\rho$42

The inverse map $\rho$43 solves

$\rho$44

and is a diffeomorphism onto its image. The Schur–Weyl specialization is obtained by taking $\rho$45, $\rho$46 for $\rho$47, $\rho$48, $\rho$49, which gives

$\rho$50

For random standard Young tableaux of fixed shape, a deterministic sequence $\rho$51 converges to a continuous diagram $\rho$52, and the domain map is determined by the Stieltjes transform $\rho$53 of $\rho$54. Proposition 4.6 states that for any $\rho$55 and $\rho$56, the equation

$\rho$57

has at most one root $\rho$58; the map $\rho$59, with $\rho$60, defines a diffeomorphism onto its image. In the square-shape example,

$\rho$61

and the level-line Stieltjes transforms are

$\rho$62

The technical proof apparatus is built from several algebraic and asymptotic ingredients. The inverse-limit algebra $\rho$63 makes $\rho$64 and $\rho$65 available at the formal level. Jucys–Murphy elements enter through central operators

$\rho$66

where $\rho$67 is the adjacency matrix built from transpositions, and for characters $\rho$68,

$\rho$69

Theorem 5.1 expands $\rho$70 into central class sums with leading coefficients involving noncrossing partitions, while Theorem 5.2 and Lemmas 5.3–5.5 develop the Gelfand–Tsetlin algebra needed for multilevel cumulants. The resulting framework generalizes Schur generating functions of Bufetov–Gorin to integer partitions, recovers and extends free-probability laws for Plancherel-type measures, matches Kerov’s central limit theorem in the Plancherel case, and is distinct from determinantal approaches that require Poissonization and do not apply to these models (Raposo, 24 Jul 2025).

6. Other meanings of the term in the literature

The phrase Young generating function is not unique to the representation-theoretic formal series $\rho$71. In the recent literature it also appears in several unrelated combinatorial senses.

In "Simple Generating Functions for Certain Young Tableaux with Periodic Walls," the relevant objects are ordinary generating functions for tableaux with horizontal walls. For the periodic building $\rho$72 of shape $\rho$73, the counting series

$\rho$74

satisfies

$\rho$75

where $\rho$76 is the Catalan generating function and $\rho$77 (Liu et al., 2024).

In "On the generating function for intervals in Young’s lattice," the central object is the multivariate series

$\rho$78

where $\rho$79. The main theorem states that $\rho$80 satisfies a rational recursion and is therefore a rational function in $\rho$81 (Azam et al., 2021).

In "Generating Functions for Inverted Semistandard Young Tableaux and Generalized Ballot Numbers," the basic generating function is

$\rho$82

counting $\rho$83-inverted semistandard Young tableaux of shape $\rho$84 and content $\rho$85. A fixed-standardization generating function

$\rho$86

is expressed as a product of $\rho$87-numbers determined by the statistics $\rho$88 and $\rho$89 (Drube, 2016).

In "A new $\rho$90-Selberg integral, Schur functions, and Young books," the generating function is the major-index enumerator

$\rho$91

for Young books, and it is represented both by a Jackson integral and by a Schur-function expansion (Kim et al., 2014).

In "Derivatives, Eulerian polynomials and the $\rho$92-indexes of Young tableaux," the expression “Young generating function” is used for tableau-weighted generating polynomials such as

$\rho$93

and

$\rho$94

where the weights are $\rho$95-indexes (Han et al., 2020).

A useful way to read the terminology, therefore, is as context-dependent. In asymptotic representation theory, the Young generating function is the formal characteristic-function analogue $\rho$96. In enumerative combinatorics, the same phrase may denote an ordinary generating function, a $\rho$97-generating function, or a tableau-weighted polynomial attached to a different class of Young-type objects.