---
title: Schur Generating Functions Overview
url: https://www.emergentmind.com/topics/schur-generating-functions
type: topic
---

# Schur Generating Functions Overview

to=arxiv_search.search  东臣son  天天中彩票开奖 json
{"query":"\"Schur generating functions\" arXiv", "max_results": 10}
to=arxiv_search.search 夫妻性生活影片  彩票天天 json
{"query":"\"Fluctuations of particle systems determined by Schur generating functions\"", "max_results": 5}
to=arxiv_search.search  全民彩票  彩神争霸 json
{"query":"\"Domino Tilings of the Aztec Diamond in Random Environment and Schur Generating Functions\"", "max_results": 5}
to=arxiv_search.search +天天中彩票  天天中彩票这个 json
{"query":"\"Schur P-positivity and involution Stanley symmetric functions\"", "max_results": 5}
Schur generating functions are generating objects organized by Schur data. In the classical case, the Schur polynomial is the generating function of semistandard Young tableaux,
$$
s_\lambda(x_0,\ldots,x_h)=\sum_{T\in SSYT_{h+1}(\lambda)}x^{\mathrm{wt}(T)},
$$
and it also admits quasisymmetric, determinantal, and alternant descriptions. In later developments, the same phrase encompasses stable limits of key or Schubert polynomials, Schur- or Schur \(P\)-positive expansions of combinatorial and geometric series, and normalized generating functions of probability measures on signatures. Across these settings, Schur generating functions encode combinatorics, representation theory, and asymptotic stochastic behavior in a basis governed by Schur or Schur-type functions [1504.03782] [1604.01110].

## 1. Classical Schur functions and their generating mechanisms

Classically, Schur functions arise as generating functions for semistandard Young tableaux, and this tableau definition is equivalent to several structural formulas. One has the Jacobi–Trudi determinants
$$
s_\lambda=\det(h_{\lambda_i-i+j}),\qquad s_\lambda=\det(e_{\lambda'_i-i+j}),
$$
and the ratio-of-alternants formula
$$
s_\lambda(x_1,\dots,x_m)=\frac{a_{\lambda+\delta}}{a_\delta}
=\frac{\det(x_j^{\lambda_i+m-i})}{\det(x_j^{m-i})},
\qquad \delta=(m-1,m-2,\dots,1,0).
$$
The same function also has the descent expansion
$$
s_\lambda(x_0,\ldots,x_h)=\sum_{T\in SYT(\lambda)}F_{Des(T)}(x_0,\ldots,x_h),
$$
so Schur generating functions simultaneously encode semistandard tableaux, standard tableaux, and Gessel’s fundamental quasisymmetric functions [1504.03782] [2511.02649].

This multiplicity of descriptions is stabilized by the Cauchy kernel
$$
\sum_\lambda s_\lambda(x)\,s_\lambda(y)=\prod_{i,j}\frac{1}{1-x_i y_j},
$$
which is realized in vertex-operator language as a vacuum expectation value of products of bosonic fields. In the operator framework, the generating series
$$
H(z)=\sum_{n\ge 0}h_n z^n,\qquad E(z)=\sum_{n\ge 0}e_n z^n
$$
satisfy \(H(z)E(-z)=1\), while multivariable generating series such as
$$
Q(\underline{u})=\prod_{1\le i<j\le \ell}\left(1-\frac{u_j}{u_i}\right)\prod_{i=1}^{\ell}Q(u_i)
$$
have coefficients equal to Schur functions. This places Schur generating functions inside a formalism that also yields Pieri rules, Jacobi–Trudi identities, and Cauchy-type kernels by normal ordering and Heisenberg-algebra relations [1610.03396].

## 2. Stable-limit generalizations and Schur-type bases

A substantial extension of the classical picture replaces a single alphabet by several alphabets and ordinary Schur functions by stable limits of key polynomials. For infinite alphabets \(X_1,\dots,X_r\), the ring of \(r\) multi-symmetric functions is
$$
\Lambda_R(X_1|\cdots|X_r)=\Lambda_R(X_1)\otimes_R\cdots\otimes_R\Lambda_R(X_r),
$$
with bases indexed by \(r\)-tuples of partitions. The multi-symmetric Schur function
$$
\mathcal{S}_{(\lambda^{(1)}|\cdots|\lambda^{(r)})}(X_1|\cdots|X_r)
$$
is defined as a stable limit of key polynomials. It has a diagrammatic combinatorial expansion, a triangular monomial expansion, and a complete support characterization via a partial order \(\triangleleft\) generated by three classes of moves on multi-partitions. It also expands positively into tensor products of ordinary Schur functions, with coefficients realized as multiplicities of irreducible \(L(n_1|\cdots|n_r)\)-modules inside Demazure modules, and it is acted on by plethystic operators \(D_i\) that transfer the largest part from the \(i\)-th partition to the \((i+1)\)-st partition [2502.08738].

Loop Schur functions furnish a different generalization. Here variables are colored modulo \(n\), tableaux are weighted by a content-dependent color rule,
$$
\mathrm{wt}_r(T)=\prod_{(i,j)\in \lambda/\mu}x_{T(i,j)}^{(r+c(i,j))},
$$
and the loop skew Schur function
$$
s_{\lambda/\mu}^{(r)}=\sum_T \mathrm{wt}_r(T)
$$
is a generating function over colored semistandard tableaux. Loop Schur functions satisfy loop Jacobi–Trudi determinants and, crucially, a ratio-of-loop-alternants formula
$$
s_\lambda^{(r)}(\mathbf{x}_1,\dots,\mathbf{x}_m)=\frac{a_{\lambda+\delta}^{(r)}}{a_\delta^{(r)}},
$$
together with a polynomial alternant variant involving \(b_{\lambda+\delta}^{(r)}\). These identities extend the classical triangle of tableau generating function, Jacobi–Trudi determinant, and alternant ratio to the loop setting [1504.03782].

Shifted Schur functions provide a third stable generalization. In the Okounkov–Olshanski setup, shifted complete and elementary functions generate determinant identities
$$
s^*_\lambda=\det\big(T^{j-1}h^*_{\lambda_i-i+j}\big),\qquad
s^*_\lambda=\det\big(T^{j-1}e^*_{\lambda'_i-i+j}\big),
$$
while the multivariable generating series \(Q^*(\underline u)\) and \(R^*(\underline u)\) have coefficients equal to shifted Schur functions. This framework parallels the ordinary Schur case but replaces ordinary monomials by falling factorials and ordinary creation operators by shifted analogues [1610.03396].

| Setting | Defining generating object | Structural feature |
|---|---|---|
| Multi-symmetric | \(\mathcal{S}_{(\lambda^{(1)}|\cdots|\lambda^{(r)})}\) | Stable limit of key polynomials |
| Loop | \(s_{\lambda/\mu}^{(r)}\) | Colored SSYT generating function |
| Shifted | \(Q^*(\underline u),R^*(\underline u)\) | Falling-factorial determinant expansions |

These families preserve the central Schur-generating paradigm: a combinatorial sum is promoted to a basis with triangularity, positivity, and operator calculus.

## 3. Schur positivity, Schur \(P\)-positivity, and involution series

Involution Stanley symmetric functions provide a particularly sharp example of Schur-generating behavior. For an involution \(y\in I_n\), let \(A(y)\) be the set of atoms, \(\hat R(y)\) the involution words, and
$$
\hat{\mathfrak S}_y=\sum_{w\in A(y)}\mathfrak S_w,\qquad
\hat F_y=\sum_{w\in A(y)}F_w
=\lim_{N\to\infty}\hat{\mathfrak S}_{y\gg N}
=\sum_{a\in \hat R(y)}f_a.
$$
Thus \(\hat F_y\) is simultaneously a generating function for involution words and a stable limit of representatives of orthogonal-group orbit closures in the flag variety. Since it is a nonnegative sum of Stanley symmetric functions, it is Schur-positive; the stronger theorem is Schur \(P\)-positivity,
$$
\hat F_y=\sum_{\lambda\text{ strict}} a_\lambda(y)\,P_\lambda,\qquad a_\lambda(y)\ge 0.
$$
Moreover, if \((y)\) is the strict partition extracted from the involution code, then
$$
\hat F_y\in P_{(y)}+\mathbb N\text{-span}\{P_\lambda:\lambda<(y)\},
$$
so the Schur \(P\)-expansion is triangular in dominance order [1701.02824].

The constructive mechanism is an involution analogue of the Lascoux–Schützenberger tree. For an \(I\)-Grassmannian involution
$$
y=(\phi_1,n+1)(\phi_2,n+2)\cdots(\phi_r,n+r),
$$
one has the one-term formula
$$
\hat F_y=P_{(n+1-\phi_1,\dots,n+1-\phi_r)}.
$$
For general \(z\), the involution transition identity
$$
\sum_{u\in \hat\Phi^-(y,p)}\hat F_u=\sum_{v\in \hat\Phi^+(y,q)}\hat F_v
$$
induces a finite tree whose leaves are \(I\)-Grassmannian, yielding
$$
\hat F_z=\sum_{v\text{ leaf of }\mathcal T(z)}P_{(v)}.
$$
This gives explicit Schur \(P\)-summands and a direct proof of positivity [1701.02824].

The same theory also supplies classification results. An involution is \(P\)-vexillary when \(\hat F_y\) is a single Schur \(P\)-function; this occurs exactly when all \(8\)-point standardizations avoid eleven listed bad patterns, and for \(321\)-avoiding involutions the criterion reduces to avoiding two patterns. The reverse permutation \(w_n=n\cdots 321\) satisfies
$$
\hat F_{w_n}=P_{(n-1,n-3,n-5,\dots)}=s_{\delta_p}s_{\delta_q},
$$
where the index is a shifted staircase. The same framework recovers skew Schur functions \(s_{\delta_{n+1}\setminus\mu}\) as involution Stanley symmetric functions, yields triangular Schur \(P\)-expansions for these skew Schur functions, and gives alternate proofs of results of Ardila–Serrano and DeWitt [1701.02824].

## 4. Operator, noncommutative, and affine-combinatorial realizations

One major line of development treats Schur generating functions as outputs of operator algebras. In the vertex-operator approach, bosonic fields
$$
\Gamma_+(z)=\exp\Big(\sum_{n\ge1}\frac{z^n}{n}a_n\Big),\qquad
\Gamma_-(z)=\exp\Big(\sum_{n\ge1}\frac{z^n}{n}a_{-n}\Big)
$$
satisfy
$$
\Gamma_+(x)\Gamma_-(y)=\frac{1}{1-xy}\Gamma_-(y)\Gamma_+(x),
$$
and the Cauchy identity is recovered from the vacuum expectation value of \(\prod_i\Gamma_+(x_i)\prod_j\Gamma_-(y_j)\). In the same formalism, ordinary, shifted, Hall–Littlewood, and Schur \(Q\)-families are produced by modifying the correlation factor \(f(x)\), so Schur generating functions appear as coefficients of explicitly normal-ordered operator series [1610.03396].

A second line replaces commutative symmetric functions by noncommutative Schur functions. In the free algebra \(U=\mathbb Z\langle u_1,\dots,u_N\rangle\), the noncommutative Cauchy kernel
$$
\Omega(X,u)=H(x_1)H(x_2)\cdots
$$
expands as
$$
\Omega(X,u)=\sum_w Q_{Des(w)}(X)\,u_w.
$$
For \(y\in U^*\), the associated symmetric function is
$$
F_y(X)=\langle \Omega(X,u),y\rangle,
$$
and the Schur coefficients are extracted by pairing with noncommutative Schur functions:
$$
F_y(X)=\sum_\lambda s_\lambda(X)\,\langle \mathfrak s_\lambda(u),y\rangle.
$$
The paper develops ideals \(I\supset I_C\) for which Schur positivity of all \(F_y\) with \(y\in U_{\ge0}\cap I^\perp\) is equivalent to \(Q\)-monomial positivity of every \(\mathfrak s_\lambda(u)\) modulo \(I\). Switchboards, adapted from Assaf’s \(D\)-graphs, organize words and local relations for LLT, Macdonald, Stanley, and stable Grothendieck families inside this framework [1510.00657].

A third line concerns \(k\)-Schur functions. For \(n=k+1\), Lam–Lapointe–Morse–Shimozono define
$$
s_\nu^{(k)}(X;t)=\sum_{S^*\in SST^*(\rho(\nu),n)} t^{\mathrm{spin}(S^*)}\,Q_{\sigma(S^*)}(X),
$$
so \(k\)-Schur functions become weighted generating functions of starred strong tableaux in the affine Bruhat order on the affine symmetric group modulo the symmetric group. Affine dual-equivalence involutions \(\varphi_i\) act on these tableaux, preserve spin, and produce signed, colored graphs \(G^{(n)}_{\nu/\mu}\) that satisfy the \(D\)-graph axioms together with local Schur positivity on \(2\)-colored subgraphs. Flattening and squashing operations reduce affine dual-equivalence components to canonical local types and connect the theory to LLT and Macdonald polynomials [1201.2128].

## 5. Probabilistic Schur generating functions

In probability theory, a Schur generating function is a normalized transform of a probability measure on signatures. If \(r\) is a probability measure on \(GT_N\), then
$$
S_r(x_1,\dots,x_N)=\sum_{\lambda\in GT_N} r(\lambda)\,
\frac{s_\lambda(x_1,\dots,x_N)}{s_\lambda(1^N)}
$$
is its Schur generating function. This transform encodes the law of the shifted particle configuration \(\ell_i^{(N)}=\lambda_i+N-i\) and interacts with the differential operators
$$
\mathcal D_m=\prod_{1\le i<j\le N}\frac1{x_i-x_j}
\Big(\sum_{i=1}^N(x_i\partial_{x_i})^m\Big)
\prod_{1\le i<j\le N}(x_i-x_j),
$$
which satisfy
$$
\mathcal D_m s_\lambda
=s_\lambda\sum_{i=1}^N(\lambda_i+N-i)^m.
$$
Under LLN-appropriate and CLT-appropriate assumptions on \(\log S_{r_N}\) near \(1^N\), one obtains a law of large numbers for the empirical measure and a central limit theorem for centered shifted power sums, with covariance given by explicit double contour integrals. The method extends to multi-level arrays through branching and Littlewood–Richardson maps and applies to tensor products and restrictions of \(U(N)\)-representations, lozenge tilings, domino tilings, and non-intersecting random walks [1604.01110].

The same formalism has been extended to random domino tilings of the Aztec diamond in random environment. For the annealed marginal \(\rho_N\) of the signature \(\lambda^{(N)}\), the Schur generating function is
$$
S_{\rho_N}(x_1,\dots,x_N)
=\left(\mathbb E\prod_{i=1}^N(1-\beta+\beta x_i)\right)^{M-N}
$$
in the i.i.d. one-periodic setting. The paper proves a generalized LLN based on convergence of the \(N\)-th root of the Schur generating function,
$$
\lim_{N\to\infty}\sqrt[N]{S_{\rho_N}(u_1,\ldots,u_k,1^{N-k})}=F_k(u_1,\ldots,u_k),
$$
and a generalized CLT for moment observables at scale \(N^{k+1/2}\). These results yield two fluctuation regimes for the random Aztec diamond: when the variance of the environment decreases at the critical scale \(1/M\), the unrescaled height fluctuations are governed by the sum of a Gaussian Free Field and an independent Brownian motion; when the distribution of the environment is fixed, the fluctuations occur on the much larger scale \(\sqrt M\) and are governed by Brownian motion alone [2507.08560].

This probabilistic usage is structurally different from tableau enumeration, but the underlying mechanism is still Schur expansion. The normalized character transform \(S_{\rho_N}\) plays the role of a generating function whose first and second logarithmic derivatives determine global laws and fluctuation kernels.

## 6. Representation-theoretic, geometric, and arithmetic extensions

Schur generating functions also appear in plethysm, character theory, and arithmetic generating-series constructions. For plethysm, the bivariate generating function
$$
A_\mu(z,q)=\sum_{h\ge0}\sum_{k\ge1}\mathsf a_{\mu[h]}^{[k]}q^k z^h
$$
records bounded-length \(\mathrm{SL}_2\)-plethysm coefficients. It is shown to be rational, with
$$
A_\mu(z,q)=\mathsf{PT}^q\big((q-q^{-1})\,QEhr_\mu(z,q)\big),
$$
where \(QEhr_\mu\) is a \(q\)-Ehrhart series built from Schur data and the positive-term operator \(\mathsf{PT}^q\) is MacMahon’s truncation operator. For \(|\mu|\le5\), the resulting rational functions admit positive cone decompositions, and there is a reciprocity theorem
$$
A_\mu(z^{-1},q^{-1})=(-1)^w z^2 A_{\mu'}(z,q).
$$
This situates Schur generating functions within \(q\)-Ehrhart theory and bounded-length plethysm [2511.02649].

For classical Lie groups, multiplicative generating functions generalize Schur expansions of products \(\prod_i(a_0+a_1x_i+a_2x_i^2+a_3x_i^3)\) or their symplectic and orthogonal analogues. The expansions are written in bases of Weyl characters \(\operatorname{ch}^G_\lambda\), with explicit recurrence relations for the coefficients derived from Weyl-group dot actions. In the \(\mathrm{GL}(n)\) case these characters are Schur functions, while the symplectic, orthogonal, and spin cases yield direct analogues of Schur-series generating functions and explain periodicity phenomena through dual pairs and root-of-unity specializations [2303.00576].

A further extension replaces Schur functions by Weyl bialternants for rank-two root systems. In type \(A_2\), the Weyl character \(\chi_{a\omega_1+b\omega_2}\) is the Schur function \(s_{(a+b,b,0)}\), and the paper constructs two-color grid posets whose distributive lattices have weight generating functions
$$
WGF(L_\Phi(\lambda))=\chi_\lambda.
$$
Their rank generating functions are principal specializations
$$
RGF(L_\Phi(\lambda),q)=\prod_{\alpha\in\Phi^+}
\frac{1-q^{(\lambda+\rho,\alpha^\vee)}}{1-q^{(\rho,\alpha^\vee)}},
$$
which in type \(A_2\) recover the usual Schur principal specialization [1901.00185].

Other extensions are more specialized but preserve the same organizing idea. Schur multiple zeta values lead to Schur anti-hook generating functions that explain the resemblance between classical and symmetric sum formulas for multiple zeta values and yield polynomial multiple zeta generating functions indexed by split depths [2011.04220]. Schur-type poly-Bernoulli numbers are defined by replacing the ordinary polylogarithm with Schur-type polylogarithms built from semistandard Young tableaux of shape \(\lambda\), producing multi-variable generating series
$$
\frac{\operatorname{Li}_{\boldsymbol{k}}(1-e^{-z_1},\dots,1-e^{-z_c})}
{(1-e^{-z_1})\cdots(1-e^{-z_c})}
=\sum B_{\lambda,\boldsymbol{k}}(m_1,\dots,m_c)
\frac{z_1^{m_1}\cdots z_c^{m_c}}{m_1!\cdots m_c!},
$$
together with type \(C\) analogues, interpolation theorems, and Stirling-number formulas [1812.10640].

Taken together, these developments suggest that “Schur generating functions” is best understood as a family of constructions rather than a single definition. In one direction, the term denotes generating functions whose coefficients are Schur functions or Schur-type functions; in another, it denotes transforms of measures whose asymptotics are accessed through Schur expansions. What persists across the literature is the same structural package: basis expansions with positivity or triangularity, operator identities, and explicit links between combinatorial models, representation theory, and analytic or probabilistic limits.

Source: https://www.emergentmind.com/topics/schur-generating-functions