Universal Symmetric Polynomials

• Universal symmetric polynomials are generalized Schur functions constructed from any monic polynomial basis, extending classical symmetric function theory.
• They satisfy quantum Jacobi–Trudi identities and recast integrable hierarchies like KP and 2D Toda as τ-functions, enabling combinatorial and operator theoretic expansions.
• Their universality bridges connections to classical group characters, matrix models, and random processes, highlighting a versatile framework in both mathematics and physics.

Universal symmetric polynomials are a generalization of classical Schur polynomials, constructed by associating to any monic polynomial basis $\{\phi_i(x)\}$ for $\C(x)$ an element $[\Phi]$ in the Grassmannian of $n$-dimensional subspaces of the Hardy space $H^2$ over $\F = \C(x_1,\ldots,x_n)$. The resulting Plücker coordinates $S^\phi_{\lambda,n}(x_1,\ldots,x_n)$, indexed by partitions $\lambda$, deform standard Schur function theory through combinatorial determinants and encode broad connections to KP and 2D Toda integrable hierarchies, classical group characters, random processes, and matrix models, subsuming these as special or limiting cases (Harnad et al., 2013).

1. Definition and Fundamental Construction

Given a monic polynomial basis $$\phi = \{\phi_0(x)=1, \phi_1(x), \phi_2(x), \ldots\}$$ with $\deg\phi_i = i$, define the $\C(x)$0 matrix $\C(x)$1 for $\C(x)$2, $\C(x)$3. Let $\C(x)$4 be the $\C(x)$5 Vandermonde-like minor with columns $\C(x)$6. For a partition $\C(x)$7, set $\C(x)$8. The Plücker coordinate formula is: $\C(x)$9 This construction is universal for any choice of the basis $[\Phi]$0, reducing to classical Schur polynomials when $[\Phi]$1.

2. Quantum Jacobi–Trudi Identities and Recursion

Define generalized complete symmetric functions $[\Phi]$2, $[\Phi]$3. Structure these as semi-infinite columns subject to the recursion of the polynomial basis, encoded through the recursion operator $[\Phi]$4. Construct the infinite matrix $[\Phi]$5, with $[\Phi]$6, and the invertible $[\Phi]$7 minor $[\Phi]$8. A crucial structural result (Proposition 2.1) is: $[\Phi]$9 The generalized Jacobi–Trudi formula for universal symmetric polynomials follows: $n$0 where $n$1. Dual identities exist for the analogues of elementary symmetric functions $n$2, yielding the dual Jacobi–Trudi formulation: $n$3

3. KP τ-Functions and Integrable Hierarchies

Introduce power-sum KP-flow variables $n$4, with $n$5. For fixed $n$6,

$n$7

where $n$8 are standard Schur functions and $n$9 are Plücker coordinates for another Grassmannian element. The series

$H^2$0

is a KP τ-function, satisfying Hirota bilinear equations in $H^2$1 and $H^2$2. This τ-function encoding plays a central role in integrable systems, allowing the construction of solution spaces and combinatorial expansions.

4. Fermionic Operator Formalism

The universal symmetric polynomials admit a representation via fermionic (Clifford algebra) operators. Let $H^2$3 obey standard fermionic anticommutation relations, with vacua $H^2$4, $H^2$5. For the lower-triangular recursion matrix $H^2$6 of $H^2$7, set

$H^2$8

The bosonic operators $H^2$9, $\F = \C(x_1,\ldots,x_n)$0, generate KP flows. The generalized Schur polynomials then admit: $\F = \C(x_1,\ldots,x_n)$1 and the corresponding τ-function is

$\F = \C(x_1,\ldots,x_n)$2

These forms satisfy the standard bilinear identities critical for integrable hierarchy theory.

5. Classical Specializations and Universality

Universal symmetric polynomials interpolate between, and generalize, key classical cases:

• Ordinary Schur functions: For $\F = \C(x_1,\ldots,x_n)$3, $\F = \C(x_1,\ldots,x_n)$4 is the shift, $\F = \C(x_1,\ldots,x_n)$5. Recover $\F = \C(x_1,\ldots,x_n)$6, $\F = \C(x_1,\ldots,x_n)$7, $\F = \C(x_1,\ldots,x_n)$8.
• Orthogonal polynomial characters: For any orthogonal polynomial system (Jacobi, Hermite, etc.), $\F = \C(x_1,\ldots,x_n)$9 coincides with the irreducible characters of classical groups via the Weyl character formula. For $S^\phi_{\lambda,n}(x_1,\ldots,x_n)$0, $S^\phi_{\lambda,n}(x_1,\ldots,x_n)$1, $S^\phi_{\lambda,n}(x_1,\ldots,x_n)$2, one recovers determinantal character formulae of Fulton–Harris and Littlewood.

This universality provides a framework connecting combinatorial symmetric function theory and representation theory of classical groups.

6. Applications in Matrix Models, Random Processes, and Integrable Hierarchies

Universal symmetric polynomials underpin several important applications:

• 2D Toda lattice τ-functions: By introducing a second polynomial basis $S^\phi_{\lambda,n}(x_1,\ldots,x_n)$3 and corresponding dressing $S^\phi_{\lambda,n}(x_1,\ldots,x_n)$4, one obtains

$S^\phi_{\lambda,n}(x_1,\ldots,x_n)$5

• Matrix models: Selecting $S^\phi_{\lambda,n}(x_1,\ldots,x_n)$6 to factorize a Hankel or bimoment matrix gives the representation of matrix model partition functions as

$S^\phi_{\lambda,n}(x_1,\ldots,x_n)$7

for one-matrix or two-matrix models, with $S^\phi_{\lambda,n}(x_1,\ldots,x_n)$8 the Vandermonde determinant.

• Random processes: The framework allows fermionic constructions of exclusion processes, such as TASEP-type models, by substituting a charge-preserving “hopping” operator for $S^\phi_{\lambda,n}(x_1,\ldots,x_n)$9. Evolution operator matrix elements then generate transition probabilities via τ-function expansions.

A plausible implication is the capacity of the Harnad–Lee construction (Harnad et al., 2013) to serve as a universal nexus linking classical symmetric function theory, integrable systems, group character theory, and stochastic process analysis through a single determinantal and operator-theoretic formalism.