Pruned Leech Cubatures and Modular Cone Geometry:
Sparse Supports, Exclusion Gaps, and Numerical Evidence
for Cusp-Form Sign Variation

SRFP311T1 Collaboration

October 2026

Abstract

We investigate sparse positive-weight spherical cubature constructions supported on concentric shells of the 2424-dimensional Leech lattice. The modular-form reduction of Venkov identifies the relevant harmonic conditions with Fourier-coefficient conditions in spaces of cusp forms. This permits the cubature problem to be formulated as a finite-dimensional non-negative linear feasibility problem.

We distinguish carefully between the modular dimension at a single harmonic degree and the cumulative dimension of the direct-sum evaluation space obtained by imposing all relevant even harmonic conditions up to a target degree.

Using a sparse non-negative least-squares formulation, we obtain numerical candidates for positive cubatures at degrees k=114k=114 and k=120k=120, corresponding to spherical strengths 115115 and 121121, respectively. For k=114k=114 the computation uses a candidate pool {12,…,265}\{12,\ldots,265\} and produces a support of 5454 shells, with the second active shell at m=129m=129. For k=120k=120 the candidate pool {12,…,295}\{12,\ldots,295\} produces a support of 5353 shells, with the second active shell at m=89m=89. Thus both computations exhibit pronounced internal exclusion gaps.

We interpret these observations as numerical evidence for sparse-support phenomena in the modular evaluation cone. We also formulate a conjectural asymptotic description of the location of an exclusion boundary. The proposed scale is m≍k2/96m\asymp k^2/96, but we do not claim a theorem establishing this law.

A separate finite-field computation gives full column rank for the 271×53271\times53 integer Fourier-coefficient matrix associated with the reported k=120k=120 support. This establishes linear independence of the selected generators, provided the stated exact matrix and modular calculation are verified. It does not by itself establish that the generated cone is a face of the full modular cone or that every cusp form changes sign on the selected support.

Finally, we state the exact convex-duality criterion that would convert an exact strictly positive annihilating vector into a finite-support sign-variation theorem. The numerical residuals reported here provide computational evidence for approximate annihilation, but should not be confused with exact rational or interval certificates.

Introduction

The interaction between spherical designs, Euclidean lattices, and modular forms provides a particularly rigid setting in which high-dimensional cubature problems can be reduced to finite-dimensional linear algebra.

Let 𝕊d−1⊂ℝd\mathbb{S}^{d-1}\subset\mathbb{R}^d be the unit sphere equipped with normalized rotation-invariant measure σ\sigma.

Definition 1 (Weighted spherical design). A finite set X⊂𝕊d−1X\subset \mathbb{S}^{d-1} with positive weights W:X→ℝ>0W:X\to\mathbb{R}_{>0} is a weighted spherical tt-design if ∫𝕊d−1f(ξ)dσ(ξ)=∑x∈XW(x)f(x)∑x∈XW(x)\begin{equation} \int_{\mathbb{S}^{d-1}} f(\xi)\,d\sigma(\xi) = \frac{\sum_{x\in X}W(x)f(x)} {\sum_{x\in X}W(x)} \end{equation} for every polynomial ff of total degree at most tt.

By harmonic decomposition, this is equivalent to the vanishing of all nonconstant harmonic moments through degree tt: ∑x∈XW(x)Pj(x)=0,Pj∈Harm⁡j(ℝd),1≤j≤t.\begin{equation} \sum_{x\in X}W(x)P_j(x)=0, \qquad P_j\in\mathop{\mathrm{Harm}}_j(\mathbb{R}^d), \qquad 1\leq j\leq t. \label{eq:harmonic_vanishing} \end{equation}

For the antipodal shell-supported constructions considered here, the odd-degree harmonic conditions vanish automatically. Thus the nontrivial conditions arise from the even degrees.

The Leech lattice

Let Λ24⊂ℝ24\Lambda_{24}\subset\mathbb{R}^{24} denote the Leech lattice. For m≥2m\geq2, define the shell Sm={x∈Λ24:∥x∥2=2m}.\begin{equation} S_m= \{x\in\Lambda_{24}:\|x\|^2=2m\}. \end{equation}

The minimal shell is S2S_2, consisting of 196560196560 vectors. After radial projection to 𝕊23\mathbb{S}^{23}, this shell forms a spherical 1111-design.

The theta series of the Leech lattice is ΘΛ24(τ)=∑x∈Λ24q∥x∥2/2=1+∑m=2∞Nmqm,q=e2πiτ.\begin{equation} \Theta_{\Lambda_{24}}(\tau) = \sum_{x\in\Lambda_{24}}q^{\|x\|^2/2} = 1+\sum_{m=2}^{\infty}N_mq^m, \qquad q=e^{2\pi i\tau}. \end{equation}

Since ΘΛ24\Theta_{\Lambda_{24}} is a modular form of weight 1212 and has no qq-term, one has ΘΛ24=E12−65520691Δ,\begin{equation} \Theta_{\Lambda_{24}} = E_{12}-\frac{65520}{691}\Delta, \end{equation} and therefore Nm=65520691(σ11(m)−τ(m)).\begin{equation} N_m = \frac{65520}{691} \left(\sigma_{11}(m)-\tau(m)\right). \label{eq:shell_cardinality} \end{equation}

Harmonic Theta Series and Modular Reduction

Let Pj∈Harm⁡j(ℝ24)P_j\in\mathop{\mathrm{Harm}}_j(\mathbb{R}^{24}) be homogeneous harmonic of even degree jj. Its harmonic theta series is ΘΛ24,Pj(τ)=∑x∈Λ24Pj(x)q∥x∥2/2.\begin{equation} \Theta_{\Lambda_{24},P_j}(\tau) = \sum_{x\in\Lambda_{24}} P_j(x)q^{\|x\|^2/2}. \label{eq:harmonic_theta} \end{equation}

For j>0j>0, this is a cusp form of weight j+12j+12.

Because the Leech lattice has no vectors of norm 22, the harmonic theta series has no constant or q1q^1 term. Consequently, ΘΛ24,Pj∈Sj+12(2)(SL⁡2(ℤ)),\begin{equation} \Theta_{\Lambda_{24},P_j} \in S_{j+12}^{(2)}(\mathop{\mathrm{SL}}_2(\mathbb{Z})), \end{equation} where Sw(2)(SL⁡2(ℤ))={f∈Sw(SL⁡2(ℤ)):ord⁡q(f)≥2}.\begin{equation} S_w^{(2)}(\mathop{\mathrm{SL}}_2(\mathbb{Z})) = \{f\in S_w(\mathop{\mathrm{SL}}_2(\mathbb{Z})):\mathop{\mathrm{ord}}_q(f)\geq2\}. \end{equation}

The automorphism group Co0\mathrm{Co}_0 acts on harmonic polynomials. For PjP_j orthogonal to the invariant subspace, its shell sums vanish.

Proposition 2 (Reynolds annihilation). Let G=Co0G=\mathrm{Co}_0. If Pj⟂(Harm⁡j(ℝ24))G,P_j\perp(\mathop{\mathrm{Harm}}_j(\mathbb{R}^{24}))^G, then ∑x∈SmPj(x)=0\sum_{x\in S_m}P_j(x)=0 for every m≥2m\geq2.

Proof. For every shell SmS_m, ∑x∈SmPj(x)=∑x∈Sm1|G|∑g∈GPj(gx).\sum_{x\in S_m}P_j(x) = \sum_{x\in S_m} \frac1{|G|} \sum_{g\in G}P_j(gx). The inner average is the Reynolds projection of PjP_j onto (Harm⁡j)G(\mathop{\mathrm{Harm}}_j)^G. The orthogonality assumption therefore makes the projection zero. ◻

For the invariant subspace, Venkov’s harmonic theta construction gives the relevant modular-form model.

Theorem 3 (Venkov). For the degrees considered in this paper, the harmonic theta map identifies the relevant Co0\mathrm{Co}_0-invariant harmonic subspace with the corresponding space of weight-j+12j+12 cusp forms vanishing to order at least 22. Thus, in the invariant sector, (Harm⁡j(ℝ24))Co0≅Sj+12(2)(SL⁡2(ℤ)).(\mathop{\mathrm{Harm}}_j(\mathbb{R}^{24}))^{\mathrm{Co}_0} \cong S_{j+12}^{(2)}(\mathop{\mathrm{SL}}_2(\mathbb{Z})).

Remark 4. The precise range and normalization of the preceding identification should be understood in the sense of the harmonic theta-series construction of Venkov. In a final version, the exact theorem or proposition reference should be supplied.

Since every element of Sw(2)S_w^{(2)} is divisible by Δ2\Delta^2, division by Δ2\Delta^2 gives an isomorphism Sj+12(2)(SL⁡2(ℤ))→∼Mj−12(SL⁡2(ℤ)),f↦fΔ2.\begin{equation} S_{j+12}^{(2)}(\mathop{\mathrm{SL}}_2(\mathbb{Z})) \xrightarrow{\;\sim\;} M_{j-12}(\mathop{\mathrm{SL}}_2(\mathbb{Z})), \qquad f\longmapsto\frac{f}{\Delta^2}. \end{equation}

We therefore define the single-degree modular dimension dj=dim⁡Mj−12(SL⁡2(ℤ)).\begin{equation} d_j = \dim M_{j-12}(\mathop{\mathrm{SL}}_2(\mathbb{Z})). \label{eq:single_degree_dimension} \end{equation}

For the two target degrees considered below, d114=dim⁡M102(SL⁡2(ℤ))=9,d120=dim⁡M108(SL⁡2(ℤ))=10.\begin{equation} d_{114} = \dim M_{102}(\mathop{\mathrm{SL}}_2(\mathbb{Z})) = 9, \qquad d_{120} = \dim M_{108}(\mathop{\mathrm{SL}}_2(\mathbb{Z})) = 10. \end{equation}

These numbers describe the modular-form dimension at the individual top degree. They are not the dimensions of the cumulative evaluation spaces used when all intermediate even harmonic conditions are imposed.

The Cumulative Modular Evaluation Space

A spherical design of strength tt must satisfy harmonic conditions at every degree j≤tj\leq t. For the antipodal shell-supported constructions considered here, the relevant degrees are the even degrees beginning at 1212.

For an even target degree k≥12k\geq12, define the cumulative modular space $$\begin{equation} \mathcal M_{\leq k} = \bigoplus_{\substack{12\leq j\leq k\\j\ {\rm even}}} S_{j+12}^{(2)}(\mathop{\mathrm{SL}}_2(\mathbb{Z})). \label{eq:cumulative_modular_space} \end{equation}$$

Its dimension is $$\begin{equation} D_k = \dim\mathcal M_{\leq k} = \sum_{\substack{12\leq j\leq k\\j\ {\rm even}}} d_j. \label{eq:cumulative_dimension} \end{equation}$$

For the two target degrees, D114=243,D120=271.\begin{equation} D_{114}=243, \qquad D_{120}=271. \label{eq:cumulative_dimensions} \end{equation}

Thus the values 99 and 1010 refer to the top-degree spaces, whereas 243243 and 271271 refer to the cumulative direct-sum spaces.

This distinction is essential for interpreting the computational matrices.

Choose, for each even jj with 12≤j≤k12\leq j\leq k, a basis Fj,1,…,Fj,djF_{j,1},\ldots,F_{j,d_j} of Sj+12(2)(SL⁡2(ℤ))S_{j+12}^{(2)}(\mathop{\mathrm{SL}}_2(\mathbb{Z})).

For a shell index mm, define the degree-jj evaluation vector vj(m)=(2m)−j/2(am(Fj,1),…,am(Fj,dj))T.\begin{equation} v_j(m) = (2m)^{-j/2} \left( a_m(F_{j,1}), \ldots, a_m(F_{j,d_j}) \right)^T. \label{eq:degree_evaluation_vector} \end{equation}

The cumulative evaluation vector is then $$\begin{equation} v_{\leq k}(m) = \bigoplus_{\substack{12\leq j\leq k\\j\ {\rm even}}} v_j(m) \in\mathbb{R}^{D_k}. \label{eq:cumulative_evaluation_vector} \end{equation}$$

For a finite shell set 𝒮\mathcal S, the cumulative evaluation matrix is A≤k,𝒮=(v≤k(m))m∈𝒮∈ℝDk×|𝒮|.\begin{equation} A_{\leq k,\mathcal S} = \left( v_{\leq k}(m) \right)_{m\in\mathcal S} \in \mathbb{R}^{D_k\times|\mathcal S|}. \label{eq:cumulative_evaluation_matrix} \end{equation}

A positive shell-weight vector W=(Wm)m∈𝒮∈ℝ>0|𝒮|W=(W_m)_{m\in\mathcal S} \in\mathbb{R}_{>0}^{|\mathcal S|} annihilates all relevant harmonic conditions through degree kk precisely when A≤k,𝒮W=0.\begin{equation} A_{\leq k,\mathcal S}W=0. \label{eq:cumulative_annihilation} \end{equation}

The Modular Evaluation Cone

Fix an even degree k≥12k\geq12. The modular evaluation cone generated by a finite shell set 𝒮\mathcal S is 𝒞≤k(𝒮)=cone⁡{v≤k(m):m∈𝒮}.\begin{equation} \mathcal C_{\leq k}(\mathcal S) = \mathop{\mathrm{cone}} \{v_{\leq k}(m):m\in\mathcal S\}. \label{eq:modular_cone} \end{equation}

The cubature problem is therefore a finite-dimensional positive dependence problem in this cone.

A positive cubature supported on 𝒮\mathcal S corresponds to W∈ℝ>0|𝒮|W\in\mathbb{R}_{>0}^{|\mathcal S|} such that A≤k,𝒮W=0.A_{\leq k,\mathcal S}W=0.

Equivalently, the origin lies in the relative interior of the convex cone generated by the selected evaluation vectors, subject to the chosen normalization.

Gordan’s alternative

The following convex-duality statement is the finite-dimensional tool needed for the sign-variation discussion.

Theorem 5 (Gordan’s alternative). Let A∈ℝC×n.A\in\mathbb{R}^{C\times n}. Exactly one of the following alternatives holds:

  1. there exists W∈ℝ>0nW\in\mathbb{R}^n_{>0} such that AW=0;AW=0;

  2. there exists c∈ℝC\{0}c\in\mathbb{R}^C\setminus\{0\} such that ATc≥0.A^Tc\geq0.

Corollary 6 (Conditional sign variation). Suppose there exists an exact vector W∈ℝ>0nW\in\mathbb{R}_{>0}^{n} satisfying AW=0.AW=0. Assume additionally that ATc=0⇒c=0.A^Tc=0 \quad\Longrightarrow\quad c=0. Then every nonzero cc has both a positive and a negative coordinate in ATcA^Tc.

Proof. Suppose that ATc≥0.A^Tc\geq0. Then 0=cTAW=(ATc)TW.0 = c^TAW = (A^Tc)^TW. Since every coordinate of WW is strictly positive and every coordinate of ATcA^Tc is nonnegative, it follows that ATc=0.A^Tc=0. The injectivity hypothesis then gives c=0c=0. Thus a nonzero cc cannot have all nonnegative evaluations. Applying the same argument to −c-c rules out all nonpositive evaluations. ◻

Remark 7. The injectivity hypothesis is logically independent of full column rank. If AA is a C×nC\times n matrix with n<Cn<C, then dim⁡ker⁡(AT)≥C−n.\dim\ker(A^T)\geq C-n. Thus full column rank of the selected shell vectors does not by itself imply injectivity of the evaluation map on the full ambient space.

Sparse Non-Negative Least Squares

Let 𝒟={smin,…,smax}\mathcal D=\{s_{\min},\ldots,s_{\max}\} be a candidate shell pool, and choose an anchor shell s0∈𝒟s_0\in\mathcal D. Normalize its weight to 11 and solve $$\begin{equation} \min_{W_{\rm rest}\geq0} \left\| A_{\leq k,\mathcal D\setminus\{s_0\}} W_{\rm rest} + v_{\leq k}(s_0) \right\|_2^2. \label{eq:nnls} \end{equation}$$

This is a convex non-negative least-squares problem.

If the minimum is exactly zero, the resulting vector gives an exact non-negative annihilation certificate. If the computed minimum is merely small, the result is instead a numerical approximate annihilator.

For reproducibility, define the active support using the explicit numerical threshold $$\varepsilon_{\rm act}=10^{-12}.$$ Thus $$\begin{equation} \mathcal S_{\rm active} = \left\{ m\in\mathcal D: W_m>\varepsilon_{\rm act} \right\}. \label{eq:active_threshold} \end{equation}$$

The threshold is a computational convention, not a mathematical invariant. Consequently, support counts should be accompanied by stability tests under changes in precision, solver tolerances, and activation threshold.

Numerical Exclusion Gaps

The computations reported below were performed using the cumulative modular evaluation matrices described in Sections 3 and 4. The reported residuals are floating-point quantities.

Definition 8 (Numerical exclusion gap). Let $$\mathcal S_{\rm active} = \{m_1<m_2<\cdots<m_r\}$$ be the set of indices satisfying [eq:active_threshold]. An exclusion gap is an interval mi<m<mi+1m_i<m<m_{i+1} containing no active shell.

Degree k=114k=114

For k=114,k=114, we used the candidate pool 𝒟={12,…,265}.\mathcal D=\{12,\ldots,265\}.

The numerical solution contains 5454 active shells under the threshold $\varepsilon_{\rm act}=10^{-12}$. The first active shell is m=12m=12, while the second active shell is m=129m=129.

Thus the observed first internal gap has index width 129−12=117,129-12=117, corresponding to the empty shell indices 13,14,…,128.13,14,\ldots,128.

Representative weights from the numerical solution are W12≈1.000000×100,W129≈1.170522×10−7,W153≈2.860106×10−8,W265≈9.316376×10−9.\begin{align*} W_{12} &\approx1.000000\times10^0,\\ W_{129} &\approx1.170522\times10^{-7},\\ W_{153} &\approx2.860106\times10^{-8},\\ W_{265} &\approx9.316376\times10^{-9}. \end{align*}

These values should be regarded as floating-point numerical data rather than exact weights.

Degree k=120k=120

For k=120,k=120, we used 𝒟={12,…,295}.\mathcal D=\{12,\ldots,295\}.

The reported numerical solution contains 5353 active shells. The beginning of the support is 12,89,150,168,….12,\quad89,\quad150,\quad168,\ldots.

Consequently, the first exclusion gap has index width 89−12=77,89-12=77, corresponding to the empty shell indices 13,…,88.13,\ldots,88.

This differs from the first gap observed at k=114k=114 and demonstrates that the support pattern is degree-dependent.

A Conjectural Horizon for the Exclusion Gap

The numerical experiments motivate a possible relationship between the degree kk and the location of an exclusion boundary.

A heuristic scale considered in the underlying computational study is m*(k)≍k296.\begin{equation} m_*(k)\asymp\frac{k^2}{96}. \label{eq:horizon} \end{equation}

We stress that the present manuscript does not prove this asymptotic law.

Conjecture 9 (Spectral horizon). There exists a constant or slowly varying correction term such that a stable high-frequency support region for degree kk occurs on the scale m*(k)=k296+o(k2).m_*(k) = \frac{k^2}{96} + o(k^2).

A sharper conjectural form suggested by the computational heuristic is m*(k)≈k296−k12+O(1).m_*(k) \approx \frac{k^2}{96}-\frac{k}{12}+O(1).

For k=114k=114, 114296=135.375,\frac{114^2}{96}=135.375, while the observed second active shell is 129129.

For k=120k=120, 120296=150,\frac{120^2}{96}=150, while the observed second active shell is 8989.

The two reported computations therefore do not by themselves constitute evidence for a monotone realization of the proposed quadratic scale. They are better viewed as motivating data for a broader computational test.

Additional computations over a substantially wider range of degrees, candidate pools, precisions, and support-selection procedures would be required before drawing an asymptotic conclusion.

Remark 10. The language of “Eisenstein coherence,” “Deligne oscillation,” and “phase locking” is presently heuristic. A theorem connecting these asymptotic mechanisms to the geometry of the positive cone would require quantitative estimates on the relevant Fourier-coefficient vectors and their angular distribution.

Rank and Sparse Support

For k=120k=120, the active shell index set is 𝒮120={12,89,150,168,177,178,180,189,196,200,208,212,213,214,215,218,220,222,227,230,235,236,242,243,246,248,250,252,253,256,257,258,262,267,269,271,272,273,274,276,277,281,282,283,285,286,287,288,289,290,291,292,295}.\begin{equation} \begin{aligned} \mathcal{S}_{120} = \bigl\{ &12, 89, 150, 168, 177, 178, 180, 189, 196, 200, 208, 212, 213, 214, \\ &215, 218, 220, 222, 227, 230, 235, 236, 242, 243, 246, 248, 250, \\ &252, 253, 256, 257, 258, 262, 267, 269, 271, 272, 273, 274, 276, \\ &277, 281, 282, 283, 285, 286, 287, 288, 289, 290, 291, 292, 295 \bigr\}. \end{aligned} \end{equation}

This set contains 5353 shell indices.

Choose the normalized integral basis Fa,b=Δ2E4aE6b,4a+6b=j−12,\begin{equation} F_{a,b} = \Delta^2E_4^aE_6^b, \qquad 4a+6b=j-12, \end{equation} for each relevant even degree jj, with the standard normalized Eisenstein-series conventions E4(q)=1+240∑n=1∞σ3(n)qn,E_4(q)=1+240\sum_{n=1}^\infty \sigma_3(n)q^n, E6(q)=1−504∑n=1∞σ5(n)qn,E_6(q)=1-504\sum_{n=1}^\infty \sigma_5(n)q^n, and Δ(q)=q∏n=1∞(1−qn)24.\Delta(q)=q\prod_{n=1}^\infty(1-q^n)^{24}.

Under these conventions, every Fourier coefficient of Fa,bF_{a,b} is an integer.

For the cumulative degree-120120 space, assemble all such basis elements for j=12,14,…,120.j=12,14,\ldots,120.

Define the exact integer coefficient matrix $$\begin{equation} B_{\rm active} = \left( a_m(F) \right)_{ \substack{ F\in\mathcal B_{\leq120}\\ m\in\mathcal S_{120} }} \in \mathbb{Z}^{271\times53}, \label{eq:integer_matrix} \end{equation}$$ where ℬ≤120\mathcal B_{\leq120} is the chosen integral basis of the cumulative modular space ℳ≤120.\mathcal M_{\leq120}.

This matrix is deliberately distinguished from the real evaluation matrix A≤120,𝒮120A_{\leq120,\mathcal S_{120}}, whose columns contain the additional radial factors (2m)−j/2(2m)^{-j/2} degree by degree.

Finite-field rank

Let p=231−1=2147483647.p=2^{31}-1=2\,147\,483\,647.

The exact integer matrix [eq:integer_matrix] can be reduced entrywise modulo pp. The reported computation gives $$\begin{equation} \mathop{\mathrm{rank}}_{\mathbb{F}_p}(B_{\rm active})=53. \label{eq:finite_rank} \end{equation}$$

Proposition 11 (Independence of the selected generators). Suppose the modular computation establishes a nonzero 53×5353\times53 minor of $B_{\rm active}$ modulo pp. Then the selected columns of $B_{\rm active}$ are linearly independent over ℚ\mathbb{Q}, and hence over ℝ\mathbb{R}.

Proof. Let MM be the corresponding 53×5353\times53 minor. By assumption, M≢0(mod⁡p).M\not\equiv0\pmod p. Since MM has integer entries, its determinant is an integer that is not divisible by pp. In particular, det⁡(M)≠0\det(M)\neq0 over ℤ\mathbb{Z}, and hence over ℚ\mathbb{Q} and ℝ\mathbb{R}. Therefore the selected columns are linearly independent. ◻

Remark 12. This is an exact rank statement conditional only on the correctness of the reported finite-field computation. It does not prove that the selected generators form a face of the full modular cone.

To prove a face property, one would additionally need a supporting functional that separates the selected generators from all non-selected generators.

Numerical Cubature Data

The following table summarizes the computations discussed above.

Numerical sparse-support computations compared with contiguous baselines.
kk Strength tt DkD_k Method Active shells First gap Rel. residual Status
110 111 225 Contiguous 226 0 Exact Prev. exact
114 115 243 Contiguous 244 – Infeasible Prev. fail
114 115 243 Sparse NNLS 54 117 1.84×10−151.84\times10^{-15} Numerical
120 121 271 Sparse NNLS 53 77 5.92×10−165.92\times10^{-16} Numerical

Here DkD_k denotes the dimension of the cumulative modular evaluation space defined in Section 3. It should not be confused with the top-degree dimension dkd_k.

The residual values in Table 1 are floating-point numerical residuals. They do not constitute exact proofs that the corresponding modular equations vanish.

Point counts

The total number of lattice points represented by a shell-supported cubature is $$\begin{equation} N_{\rm total} = \sum_{m\in\mathcal S_{\rm active}}N_m. \end{equation}$$

Using [eq:shell_cardinality], this quantity can be evaluated exactly once the support is fixed.

Since Nm≍m11,N_m\asymp m^{11}, the shell cardinality has polynomial order m11m^{11}. Consequently, a comparison of total point counts should use the complete shell list rather than only the largest shell index.

For the k=120k=120 support, the relevant exact quantity is $$N_{\rm total}(120) = \sum_{m\in\mathcal S_{120}} \frac{65520}{691} \left(\sigma_{11}(m)-\tau(m)\right).$$ An explicit integer evaluation should be included once the computational data are independently verified.

Sign Variation: What Remains to Be Proved

The convex-duality argument gives a clean route from an exact positive cubature to sign variation, but the required hypotheses must be stated carefully.

Let $$A_{\rm active} \in \mathbb{R}^{D_k\times r}$$ be an exact cumulative evaluation matrix for a support of rr shells.

Suppose there exists W∈ℝ>0rW\in\mathbb{R}_{>0}^{r} such that $$A_{\rm active}W=0.$$

Then Gordan’s theorem rules out a nonzero vector cc satisfying $$A_{\rm active}^Tc\geq0.$$

Thus every nonzero modular coordinate vector has at least one negative evaluation on the selected support. Applying the same argument to −c-c gives a positive evaluation as well, provided the zero-evaluation kernel has been eliminated.

Proposition 13 (Conditional sign variation). Let $A_{\rm active}$ be an exact evaluation matrix and suppose $$A_{\rm active}W=0$$ for some W>0W>0.

If the only modular form whose evaluations vanish at every selected shell is the zero form, then every nonzero modular form has both positive and negative evaluations on the selected support.

Proof. Suppose $$A_{\rm active}^Tc\geq0.$$ Then $$0 = c^TA_{\rm active}W = (A_{\rm active}^Tc)^TW.$$ Every coordinate of WW is strictly positive, so $$A_{\rm active}^Tc=0.$$ By the assumed injectivity of the evaluation map, c=0c=0.

Therefore no nonzero modular form can have all nonnegative evaluations. Applying the same argument to −c-c rules out all nonpositive evaluations. ◻

Remark 14. The dimension count must be applied to the actual coordinate space being used.

For example, if the matrix is genuinely 271×53,271\times53, then $$A_{\rm active}^T:\mathbb{R}^{271}\longrightarrow\mathbb{R}^{53}$$ has kernel dimension at least 271−53=218.271-53=218.

Consequently, full column rank of the 5353 selected generators cannot establish injectivity on a 271271-dimensional ambient coordinate space.

This is not a contradiction with the finite-field rank calculation: the latter concerns independence of the selected columns, whereas sign variation requires injectivity of the transpose evaluation map on the relevant modular-form space.

If the 271271 coordinates are a faithful basis of the cumulative modular space, then the dimension obstruction is genuine. If a redundant coordinate realization is used, the injectivity question must instead be formulated on the corresponding quotient or basis space.

Exact Certification Versus Floating-Point Evidence

The distinction between numerical evidence and mathematical certification is central to the present work.

The residual 5.92×10−165.92\times10^{-16} is evidence that a double-precision numerical solver found a vector close to the nullspace of the evaluation matrix. It does not prove that an exact null vector exists.

Several routes are available for upgrading the computation to an exact certificate.

  1. Exact rational reconstruction. Given sufficiently accurate numerical weights, one may attempt to recover rational values and verify AW=0AW=0 using exact arithmetic.

  2. Interval arithmetic. One may compute rigorous enclosures for the residual and establish a certified bound.

  3. Exact nullspace computation. For sufficiently small support, rational linear algebra can determine whether the matrix has a positive null vector exactly.

  4. Certified cone separation. A rational dual vector can establish the relevant Gordan or Farkas alternative exactly.

  5. Higher-precision stability testing. Repeating the NNLS computation at substantially higher precision and comparing support and weights can test whether the observed support is numerically stable, although stability alone is not an exact proof.

Until such a procedure is supplied, the appropriate terminology is “numerical candidate,” “approximate annihilator,” or “computational evidence,” rather than “unconditional proof.”

Finite-Field Verification

Finite-field arithmetic is useful for detecting exact rank without the coefficient growth associated with fraction-free elimination over ℚ\mathbb{Q}.

Let p=231−1=2147483647.p=2^{31}-1=2\,147\,483\,647.

The matrix used for the rank computation is the exact integer matrix $B_{\rm active}$ defined in [eq:integer_matrix], not the radially scaled real matrix $A_{\rm active}$.

The reported computation gives $$\mathop{\mathrm{rank}}_{\mathbb{F}_p}(B_{\rm active})=53.$$

For a reproducible certificate, the accompanying computational data should include at least one of the following:

  1. the complete finite-field row-reduction record;

  2. the 5353 pivot rows and columns; or

  3. a single 53×5353\times53 minor whose determinant is explicitly shown to be nonzero modulo pp.

The third option gives a particularly compact certificate: if det⁡M≢0(mod⁡p),\det M\not\equiv0\pmod p, then the corresponding integer determinant is nonzero.

Remark 15. The finite-field calculation and the floating-point NNLS calculation serve different purposes.

The finite-field calculation can provide an exact rank certificate for an integer matrix.

The NNLS calculation supplies numerical evidence for positivity and approximate annihilation of the selected shell weights.

Neither calculation alone proves the full conditional sign-variation statement.

Stability Questions and the Infinite-Dimensional Limit

The finite-dimensional cone problem raises a natural question: whether families of finite positive certificates can converge to a meaningful positive functional in an infinite-dimensional setting.

Such a statement requires substantially more structure than the finite-dimensional Gordan alternative.

A future infinite-dimensional formulation would need to specify:

  1. a precise topological vector space EE of test functions;

  2. a dual space E*E^* in which the limiting functionals live;

  3. a topology in which bounded sequences of certificates possess convergent subsequences;

  4. compatibility between finite-dimensional projections and the limiting functional;

  5. closedness of the relevant positivity cone; and

  6. a normalization preventing convergence to the zero functional.

These conditions constitute a framework for future analysis rather than a theorem in the absence of a fully specified functional-analytic model.

Observed growth of numerical weights

For illustration, the numerical calculations reported in the underlying computational study gave the following unnormalized ℓ1\ell^1 norms: k=12:1.24×100,k=16:7.17×100,k=20:5.29×100,k=24:1.35×101,k=28:2.49×101,k=32:1.99×102.\begin{align*} k=12&:\quad1.24\times10^0,\\ k=16&:\quad7.17\times10^0,\\ k=20&:\quad5.29\times10^0,\\ k=24&:\quad1.35\times10^1,\\ k=28&:\quad2.49\times10^1,\\ k=32&:\quad1.99\times10^2. \end{align*}

These values suggest rapid growth in the normalization used by the computation. They do not, by themselves, establish exponential growth, nor do they prove failure of every alternative normalization or limiting procedure.

Reproducibility Requirements

To make the numerical claims independently verifiable, the following information should accompany the manuscript:

  1. the exact definitions and normalizations of the modular bases;

  2. the complete candidate pools 𝒟\mathcal D;

  3. the precise construction of the cumulative evaluation matrices;

  4. the NNLS solver and numerical precision;

  5. stopping tolerances and conditioning diagnostics;

  6. the activation threshold $\varepsilon_{\rm act}$;

  7. the complete numerical weight vectors;

  8. the exact integer Fourier-coefficient matrices;

  9. the finite-field pivot data or a nonzero maximal minor;

  10. independent residual calculations at higher precision;

  11. support-stability tables under threshold variation; and

  12. scripts sufficient to reproduce every table in the manuscript.

In particular, the number of active shells should be regarded as a reproducible computational statistic rather than a mathematical invariant until its stability under precision, tolerance, and threshold changes has been established.

Discussion

The principal computational observation of this work is that sparse non-negative optimization produces shell supports very different from the contiguous supports used in earlier computations.

At k=114k=114, the reported support has 5454 shells and begins with 12,129,…,12,\ 129,\ldots, while at k=120k=120 the reported support has 5353 shells and begins with 12,89,150,….12,\ 89,\ 150,\ldots.

The appearance of large internal gaps is therefore a notable numerical feature of the two computations. Its dependence on degree, candidate pool, solver tolerance, precision, and regularization remains to be studied.

The finite-field rank calculation provides independent algebraic information about the selected k=120k=120 support: its selected Fourier-evaluation columns are linearly independent, assuming the stated exact integer matrix and modular computation are correct.

Several important questions remain open:

  1. Can the numerical positive weights be replaced by exact positive weights?

  2. Is the observed support stable under increased arithmetic precision and changes in NNLS implementation?

  3. Does the selected support generate a face of the full modular cone?

  4. Is there a genuine asymptotic law governing the first exclusion gap?

  5. What is the smallest support size capable of separating the relevant cumulative modular space?

  6. Can an exact positive certificate be combined with a sufficiently large separating support to prove sign variation for an entire modular space?

These questions distinguish the experimentally observed sparse geometry from the theorems that follow from exact algebraic certificates.

Conclusion

Sparse non-negative optimization provides a computational framework for studying high-strength spherical cubatures supported on Leech-lattice shells.

The calculations reported here produce numerical candidates at strengths 115115 and 121121 with substantially non-contiguous supports. In both cases the supports exhibit pronounced internal exclusion gaps. For k=120k=120, an independent finite-field calculation verifies linear independence of the selected Fourier-evaluation columns, assuming the stated exact integer matrix and modular computation.

The modular-cone formulation also identifies precisely what would be needed for a rigorous sign-variation theorem: an exact strictly positive annihilating vector together with an appropriate injectivity or separation statement for the evaluation map. A floating-point residual alone is insufficient.

Likewise, the proposed quadratic horizon m*(k)≍k296m_*(k)\asymp\frac{k^2}{96} is best viewed as a conjectural asymptotic scale suggested by a computational heuristic, rather than as an established law.

The main contribution is therefore a computationally testable framework for sparse modular cubature geometry, together with explicit statements of the additional certificates required to convert numerical observations into rigorous mathematical theorems.

99

A. Bondarenko, D. Radchenko, and M. Viazovska, Optimal asymptotic bounds for spherical designs, Ann. of Math. (2) 178 (2013), no. 2, 443–452.

H. Cohn, A. Kumar, S. D. Miller, D. Radchenko, and M. Viazovska, Universal optimality of the E8E_8 and Leech lattices and interpolation formulas, Ann. of Math. (2) 196 (2022), no. 3, 983–1082.

J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, 3rd ed., Grundlehren der mathematischen Wissenschaften, vol. 290, Springer-Verlag, New York, 1999.

P. Delsarte, J. M. Goethals, and J. J. Seidel, Spherical codes and designs, Geom. Dedicata 6 (1977), no. 3, 363–388.

R. T. Rockafellar, Convex Analysis, Princeton Mathematical Series, vol. 28, Princeton University Press, Princeton, NJ, 1970.

SRFP311T1 Collaboration, Exact Rational Spherical Designs on the Leech Lattice through Strength 111, Preprint (2026).

SRFP311T1 Collaboration, Spectral Cone Duality: Relative-Interior Annihilation, Pruned Leech Cubatures, and Hecke Prime Angular Gaps, Preprint (2026).

B. B. Venkov, Réseaux et designs sphériques, in Réseaux euclidiens, designs sphériques et formes modulaires, Monogr. Enseign. Math., vol. 37, 2001, pp. 10–44.