Polynomial Weighted Theta Functions

• Polynomial weighted theta functions are modified theta series where polynomial data influences analytic, algebraic, or combinatorial properties across diverse mathematical frameworks.
• They appear in Euclidean lattices, vector-valued Siegel kernels, coding theory weight enumerators, and integrable systems, shaping modular forms and asymptotic behaviors.
• Their applications encode shell statistics, design conditions, and modular constraints, bridging areas such as harmonic analysis, quantum algebras, and tropical geometry.

Polynomial weighted theta functions are theta-type generating functions in which polynomial data modifies either the summand, the kernel, or the coefficient structure. In the classical Euclidean lattice setting, the standard form is the weighted theta series

$$\Theta_{L,P}(q)=\sum_{v\in L}P(v)\,q^{\langle v,v\rangle/2},$$

with $P$ typically harmonic (Elkies et al., 2011). Closely related literatures use the same idea in non-equivalent ways: vector-valued Siegel theta functions with polynomial insertions in the Schwartz kernel (Zemel, 2020), orthogonal-theta kernels with explicit polynomial factors depending on the Grassmannian variable (Zemel, 2014), code- and lattice-theoretic theta series obtained by substituting theta functions into polynomial weight enumerators (Shaska et al., 2013), and finite-gap tau-functions expressed as theta functions multiplied by the exponential of a quadratic polynomial rather than by a polynomial factor (Dubrovin, 2018).

1. Terminology and conceptual range

The expression “polynomial weighted theta function” does not have a single uniform meaning across the cited literature. In some works it denotes an actual polynomial insertion into a lattice or Siegel theta kernel, as in $\Theta_{L,P}$ or $\Theta_L(\tau;v,p_v)$ (Elkies et al., 2011, Zemel, 2020). In others, the relevant structure is a theta function whose coefficients are controlled by a polynomial invariant, such as a complete or symmetric weight enumerator of a code (Shaska et al., 2013). In still other settings, the nearest analogue is not polynomial multiplication at all: for KdV tau-functions the finite-gap expression is

$$\tau(\mathbf t)=e^{\frac12\sum_{i,j\ge0}q_{ij}t_it_j}\, \theta\!\left(\sum t_k\mathbf V^{(k)}-\mathbf u_0\right),$$

so the “weight” is an exponential of a quadratic polynomial (Dubrovin, 2018).

This terminological spread is mirrored by modern generalizations. Scattering-diagram theta functions are weighted by tropical multiplicities defined through iterated Lie brackets rather than by a polynomial factor (Mandel, 2015). Weighted theta functions for non-commutative graphs use a positive semidefinite weight matrix instead of a vertex-weight vector (Stahlke, 2021). Theta series for quantum loop algebras and Yangians decompose into root-lattice weight components that are polynomial in the spectral variable (Zhang, 2023). This suggests that the most stable encyclopedic meaning is umbrella-like: a polynomial weighted theta function is a theta object whose analytic, algebraic, or combinatorial content is modified by polynomial data.

2. Euclidean lattice theta series and harmonic polynomial weights

In the Euclidean lattice setting, the basic weighted object is

$$\Theta_{L,P}(q)=\sum_{v\in L}P(v)\,q^{\langle v,v\rangle/2} =\sum_{k\ge0}\left(\sum_{\langle v,v\rangle=2k}P(v)\right)q^k,$$

where $L\subset \mathbf R^n$ is a lattice and $P$ is a polynomial on $\mathbf R^n$ (Elkies et al., 2011). The unweighted theta function $\Theta_L(q)$ is recovered by taking $P$0. In this form, the polynomial weight records shell statistics rather than merely shell cardinalities.

The distinguished class of weights is the space of harmonic polynomials. If $P$1 denotes homogeneous degree-$P$2 polynomials and $P$3, then

$P$4

with $P$5 (Elkies et al., 2011). Harmonicity is structurally important because for

$P$6

one has the clean Fourier-transform identity

$P$7

when $P$8 (Elkies et al., 2011). By Poisson summation, this yields the weighted-theta functional equation

$P$9

For a Type II lattice, the weighted series

$\Theta_{L,P}$0

is a modular form of weight $\Theta_{L,P}$1, and if $\Theta_{L,P}$2 it is a cusp form (Elkies et al., 2011). In this form, polynomial weighting is not an auxiliary decoration but the mechanism by which shell distributions, design conditions, and modular constraints are encoded.

3. Siegel theta kernels and orthogonal polynomial insertions

A more general framework appears in vector-valued Siegel theta theory. For an even lattice $\Theta_{L,P}$3 of signature $\Theta_{L,P}$4, a decomposition $\Theta_{L,P}$5, and a polynomial $\Theta_{L,P}$6 homogeneous of degree $\Theta_{L,P}$7 with respect to $\Theta_{L,P}$8, the polynomially weighted Siegel theta function is

$\Theta_{L,P}$9

and its generalized form also depends on $\Theta_L(\tau;v,p_v)$0 (Zemel, 2020). The modularity statement is explicit: $\Theta_L(\tau;v,p_v)$1 so for $\Theta_L(\tau;v,p_v)$2 the weight is $\Theta_L(\tau;v,p_v)$3 (Zemel, 2020).

The same paper develops a seesaw formalism for polynomially weighted theta functions. If $\Theta_L(\tau;v,p_v)$4 contains a primitive non-degenerate sublattice $\Theta_L(\tau;v,p_v)$5, $\Theta_L(\tau;v,p_v)$6, and $\Theta_L(\tau;v,p_v)$7, then the full weighted theta kernel factors through a relative theta function $\Theta_L(\tau;v,p_v)$8, and the corresponding theta contraction produces the restriction of a weighted theta lift from $\Theta_L(\tau;v,p_v)$9 to a sub-Grassmannian attached to $$\tau(\mathbf t)=e^{\frac12\sum_{i,j\ge0}q_{ij}t_it_j}\, \theta\!\left(\sum t_k\mathbf V^{(k)}-\mathbf u_0\right),$$0 (Zemel, 2020). In this setting, polynomial weighting is built directly into the decomposition and contraction mechanism.

In the orthogonal Grassmannian setting, the polynomial insertion becomes even more explicit. For a quadratic space $$\tau(\mathbf t)=e^{\frac12\sum_{i,j\ge0}q_{ij}t_it_j}\, \theta\!\left(\sum t_k\mathbf V^{(k)}-\mathbf u_0\right),$$1 of signature $$\tau(\mathbf t)=e^{\frac12\sum_{i,j\ge0}q_{ij}t_it_j}\, \theta\!\left(\sum t_k\mathbf V^{(k)}-\mathbf u_0\right),$$2 and $$\tau(\mathbf t)=e^{\frac12\sum_{i,j\ge0}q_{ij}t_it_j}\, \theta\!\left(\sum t_k\mathbf V^{(k)}-\mathbf u_0\right),$$3, the basic polynomial factors are

$$\tau(\mathbf t)=e^{\frac12\sum_{i,j\ge0}q_{ij}t_it_j}\, \theta\!\left(\sum t_k\mathbf V^{(k)}-\mathbf u_0\right),$$4

and the theta kernel summand is

$$\tau(\mathbf t)=e^{\frac12\sum_{i,j\ge0}q_{ij}t_it_j}\, \theta\!\left(\sum t_k\mathbf V^{(k)}-\mathbf u_0\right),$$5

(Zemel, 2014). The resulting $$\tau(\mathbf t)=e^{\frac12\sum_{i,j\ge0}q_{ij}t_it_j}\, \theta\!\left(\sum t_k\mathbf V^{(k)}-\mathbf u_0\right),$$6 is automorphic of weight $$\tau(\mathbf t)=e^{\frac12\sum_{i,j\ge0}q_{ij}t_it_j}\, \theta\!\left(\sum t_k\mathbf V^{(k)}-\mathbf u_0\right),$$7 in $$\tau(\mathbf t)=e^{\frac12\sum_{i,j\ge0}q_{ij}t_it_j}\, \theta\!\left(\sum t_k\mathbf V^{(k)}-\mathbf u_0\right),$$8 and of weight $$\tau(\mathbf t)=e^{\frac12\sum_{i,j\ge0}q_{ij}t_it_j}\, \theta\!\left(\sum t_k\mathbf V^{(k)}-\mathbf u_0\right),$$9 in $$\Theta_{L,P}(q)=\sum_{v\in L}P(v)\,q^{\langle v,v\rangle/2} =\sum_{k\ge0}\left(\sum_{\langle v,v\rangle=2k}P(v)\right)q^k,$$0 (Zemel, 2014). The same paper then studies how Grassmannian weight-raising and weight-lowering operators act on these polynomially weighted kernels and on their theta lifts.

4. Coding-theoretic and combinatorial realizations

A distinct realization of polynomially weighted theta functions appears in coding theory. For a binary linear code $$\Theta_{L,P}(q)=\sum_{v\in L}P(v)\,q^{\langle v,v\rangle/2} =\sum_{k\ge0}\left(\sum_{\langle v,v\rangle=2k}P(v)\right)q^k,$$1 and a discrete harmonic polynomial $$\Theta_{L,P}(q)=\sum_{v\in L}P(v)\,q^{\langle v,v\rangle/2} =\sum_{k\ge0}\left(\sum_{\langle v,v\rangle=2k}P(v)\right)q^k,$$2, the harmonic weight enumerator is

$$\Theta_{L,P}(q)=\sum_{v\in L}P(v)\,q^{\langle v,v\rangle/2} =\sum_{k\ge0}\left(\sum_{\langle v,v\rangle=2k}P(v)\right)q^k,$$3

which is presented as the precise coding-theoretic analogue of the weighted lattice theta series $$\Theta_{L,P}(q)=\sum_{v\in L}P(v)\,q^{\langle v,v\rangle/2} =\sum_{k\ge0}\left(\sum_{\langle v,v\rangle=2k}P(v)\right)q^k,$$4 (Elkies et al., 2011). The analogy is structural: Euclidean norm shells correspond to Hamming weight shells, harmonic polynomials correspond to discrete harmonic polynomials, and the Poisson-summation transformation law corresponds to the generalized MacWilliams identity

$$\Theta_{L,P}(q)=\sum_{v\in L}P(v)\,q^{\langle v,v\rangle/2} =\sum_{k\ge0}\left(\sum_{\langle v,v\rangle=2k}P(v)\right)q^k,$$5

for $$\Theta_{L,P}(q)=\sum_{v\in L}P(v)\,q^{\langle v,v\rangle/2} =\sum_{k\ge0}\left(\sum_{\langle v,v\rangle=2k}P(v)\right)q^k,$$6 (Elkies et al., 2011).

For codes over $$\Theta_{L,P}(q)=\sum_{v\in L}P(v)\,q^{\langle v,v\rangle/2} =\sum_{k\ge0}\left(\sum_{\langle v,v\rangle=2k}P(v)\right)q^k,$$7 attached to imaginary quadratic fields, the theta series of the Construction A lattice is obtained by evaluating a polynomial weight enumerator on coset theta functions. If $$\Theta_{L,P}(q)=\sum_{v\in L}P(v)\,q^{\langle v,v\rangle/2} =\sum_{k\ge0}\left(\sum_{\langle v,v\rangle=2k}P(v)\right)q^k,$$8 is a code and $$\Theta_{L,P}(q)=\sum_{v\in L}P(v)\,q^{\langle v,v\rangle/2} =\sum_{k\ge0}\left(\sum_{\langle v,v\rangle=2k}P(v)\right)q^k,$$9 its complete weight enumerator, then

$L\subset \mathbf R^n$0

and after identifying equal coset theta series this passes to the symmetric weight enumerator $L\subset \mathbf R^n$1 (Shaska et al., 2013). In this framework the polynomial does not weight a lattice summand directly; rather, it controls how a finite family of theta functions is assembled into a new theta series. The same paper shows that different symmetric weight enumerators can produce the same theta function at a fixed admissible level, so the substitution map from polynomial data to theta series need not be injective (Shaska et al., 2013).

A related bridge begins with matroids and Tutte polynomials. For a binary code $L\subset \mathbf R^n$2, the standard identity

$L\subset \mathbf R^n$3

expresses the Construction A lattice theta series as a polynomial substitution into the code weight enumerator (Kume et al., 2020). Combined with Greene’s theorem, this places the theta series under indirect control of the Tutte polynomial. The same paper treats this as the closest relevant analogue to “polynomial weighted theta functions” in its own framework (Kume et al., 2020).

5. Integrable-systems usage: finite-gap theta functions and quadratic-exponential weights

In the KdV literature, the nearest exact counterpart to a polynomially weighted theta function is not a theta function multiplied by a polynomial, but a finite-gap theta function multiplied by the exponential of a quadratic polynomial in the KdV times. For a hyperelliptic finite-gap solution, the tau-function is

$L\subset \mathbf R^n$4

so

$L\subset \mathbf R^n$5

(Dubrovin, 2018). The paper explicitly states that for finite-gap solutions the tau-function “coincides with the hyperelliptic theta-function up to multiplication by exponential of a quadratic polynomial” (Dubrovin, 2018).

The main approximation theorem of the same work says that for any formal KdV tau-function $L\subset \mathbf R^n$6 and any truncation order $L\subset \mathbf R^n$7, there exists a hyperelliptic curve $L\subset \mathbf R^n$8 of genus at most $L\subset \mathbf R^n$9 and $P$0 such that

$P$1

(Dubrovin, 2018). Thus the non-quadratic part of $P$2 is reproduced by the logarithmic expansion of a finite-genus theta function, while the discrepancy is at most quadratic in the times.

This usage is conceptually close to polynomial weighting but technically different. The extra factor is $P$3 with $P$4 quadratic, and the comparison is carried out at the level of $P$5. The paper’s Witten–Kontsevich example makes this concrete by showing that the $P$6-truncation of $P$7 coincides, modulo linear and quadratic terms, with the $P$8-truncation of the logarithm of a genus $P$9 theta function built from the corresponding spectral curve (Dubrovin, 2018).

6. Scattering, quantum, and operator-algebraic generalizations

Scattering-diagram theta functions provide a different nonclassical meaning of weighting. For a consistent scattering diagram $\mathbf R^n$0, the theta function attached to $\mathbf R^n$1 and endpoint $\mathbf R^n$2 is

$\mathbf R^n$3

a sum over broken lines (Mandel, 2015). The coefficients in products of theta functions are then expressed as weighted tropical counts: $\mathbf R^n$4 (Mandel, 2015). In the quantum torus case, the weights are refined $\mathbf R^n$5-multiplicities such as

$\mathbf R^n$6

and the paper states that these quantum multiplicities extend Block–Götsche multiplicities (Mandel, 2015). Here the “weighted theta function” is a theta function whose coefficients are tropical counts with Laurent-polynomial quantum weights.

A graph-theoretic generalization appears for non-commutative graphs. If $\mathbf R^n$7 is a non-commutative graph and $\mathbf R^n$8, the weighted theta quantity is

$\mathbf R^n$9

with $\Theta_L(q)$0 (Stahlke, 2021). The classical theory is recovered when $\Theta_L(q)$1 is diagonal. This is a weighted-theta formalism, but the weight is a positive semidefinite matrix rather than a polynomial.

A further nonclassical use occurs in quantum loop algebras and Yangians. There the “Theta series” are algebra-valued formal series whose weight components are indexed by the positive root cone $\Theta_L(q)$2. If $\Theta_L(q)$3 has coweight $\Theta_L(q)$4, then for every $\Theta_L(q)$5,

$\Theta_L(q)$6

are polynomials in $\Theta_L(q)$7 with coefficients in

$\Theta_L(q)$8

of degree bounded by $\Theta_L(q)$9 (Zhang, 2023). In this setting “weighted” refers to root-lattice grading, and polynomiality refers to the spectral parameter.

7. Analytic kernels, derivative generation, and theta-like series

The Kronecker theta function supplies a classical analytic mechanism for generating polynomial weights. It is defined by

$P$00

and Kronecker’s identity gives its bilateral expansion

$P$01

(Liu, 2020). Liu’s decomposition theorem then states that a meromorphic function $P$02 with the prescribed quasi-periodicity and only simple poles can be written as a finite sum of shifted Kronecker kernels: $P$03 (Liu, 2020). The paper itself does not formulate a general theory of polynomially weighted theta sums, but this kernel makes such weights accessible by differentiation in the auxiliary parameter $P$04, since derivatives of $P$05 produce powers of $P$06.

Theta-like functions also appear in asymptotic spline theory. The functions

$P$07

arise as limiting Mellin kernels for scaled $P$08-splines, and the auxiliary series

$P$09

is an explicit theta-like series weighted by the polynomial $P$10 in the summation index (Ganzburg, 10 Jan 2026). This is one of the clearest literal appearances of a polynomially weighted theta-like sum in the cited literature.

Taken together, these constructions show that polynomial weighting may enter theta theory in at least four distinct ways: as a polynomial inserted into the lattice or Siegel summand, as a polynomial factor in an orthogonal theta kernel, as a polynomial invariant controlling theta-series coefficients through substitution, or as a polynomial dependence generated by differentiating an auxiliary theta kernel. The common theme is that theta objects remain the organizing analytic structure, while polynomial data controls their coefficients, transformations, or asymptotic behavior.