Searcharxiv⌕ Search

arXiv · 2609.31689

Finite-Defect Rigidity and the Minimum Spherical 4-Design on the Two-Sphere

Abstract

We prove that every equal-weight spherical $4$-design on $\mathbb{S}^2$ has at least twelve points. Since the regular icosahedron is a spherical $5$-design, this determines the exact minimum$$N_4(\mathbb{S}^2)=12;$$equivalently, no such design has $9$, $10$ or $11$ points.The proof is part of a finite-defect theory. If a spherical $2m$-design has corank $c=N-\dim P_m$, its Naimark complement consists of unit vectors $u_x\in\mathbb{S}^{c-1}$ forming a spherical $2$-design and satisfying the exact coupling$$u_x\cdot u_y=-\frac{K_m^{(d)}(x\cdot y)}{c}\qquad(x\ne y).$$This gives a pairwise kernel bound, an antipodal lower bound, Cayley-Bacharach information, and uniform lower bounds for multiplicative-relation spaces. In corank one the design splits into two equal spherical $m$-designs. We derive a residue formula for its signed Schoenberg coefficients; the coefficient of degree $m+3$ is negative exactly when $3\le d\le m+1$, excluding corank one throughout that range. At strengths four and six the only examples in any dimension are the regular hexagon and octagon, respectively.In corank two the complement is a circle Gale frame. Multiplication by its phase forces at least $d-1$ linear-quadratic aliases and yields exact norm and socle identities in every dimension. For eleven nodes on $\mathbb{S}^2$, two aliases produce a real harmonic cubic and a Hermitian quartic matrix. A matrix-valued Cayley-Bacharach argument eliminates the generic branch; the exceptional branch reduces to a Pauli normal form and contradicts the second moments. In dimensions $d\ge4$ the corank-two problem remains open; we identify a forced quadratic socle as the obstruction to extending the present argument.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shalender Singh, Vishnupriya Singh. 2026-09-16. Finite-Defect Rigidity and the Minimum Spherical 4-Design on the Two-Sphere. https://arxiv.org/abs/2609.31689

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Combinatorics of the Leading Root of the Partial Theta Function

Let $x_0(q)=-ξ_0(q)$ be the leading formal root of $Θ_0(x,q)=\sum_{n\geq0}x^nq^{\binom n2}$. I give here explicit combinatorial interpretations of the positive integer coefficients of $ξ_0(q)=1+q+2q^2+4q^3+9q^4+\cdots$ in terms of rooted trees enriched by stack polyominoes or certain Ferrers diagrams, weighted by total area. The two enrichments may be chosen independently at each level of the tree. A decomposition along the first-child path gives a combinatorial interpretation of $1-ξ_0^{-1}$. By reserving two successor slots at the root, I also obtain an interpretation of $1-ξ_0^{-2}$ and its zero coefficient in degree three. The sequence decomposition gives a Lyndon-word interpretation of the Euler-product exponents and proves their positivity and weak monotonicity. Finally, I derive the coefficient asymptotic $[q^n]ξ_0(q)\sim ξ_0(ρ)ρ^{-n}n^{-3/2}/(2\sqrtπ)$, where $ρ$ is the radius of convergence. The tree models are equinumerous with the braid classes studied by Flores and González-Meneses.

math.CO↗

Two poset polytopes are mutation-equivalent

The combinatorial mutation $\mathrm{mut}_w(P,F)$ for a lattice polytope $P$ was introduced in the context of mirror symmetry for Fano manifolds in [1]. It was also proved in \cite{ACGK} that for a lattice polytope $P \subseteq N_\mathbb{R}$ containing the origin in its interior, the polar dual $P^* \subseteq M_\mathbb{R}$ and $\mathrm{mut}_w(P,F)^* \subseteq M_\mathbb{R}$ have the same Ehrhart quasi-polynomial. To extend this framework, we introduce combinatorial mutation for rational pointed polyhedra in $N_\mathbb{R}$ containing the origin in their interiors. Such polyhedra are Minkowski sums of rational polytopes and rational polyhedral pointed cones. On the dual side $M_\mathbb{R}$, the construction applies to full-dimensional rational polytopes containing the origin, not necessarily in their interiors. As an application of this extension of the combinatorial mutation, we prove that the chain polytope of a poset $Π$ can be obtained by a sequence of combinatorial mutations in $M_\mathbb{R}$ from the order polytope of $Π$. Namely, the order polytope and the chain polytope of the same poset $Π$ are mutation-equivalent.

math.CO↗

On the Multi-Robber Damage Number

We study a variant of the Cops and Robbers game on graphs in which the robbers damage the visited vertices, aiming to maximize the number of damaged vertices. For that game with one cop against $s$ robbers a conjecture was made by Carlson, Halloran and Reinhart that the cop can save three vertices from being damaged as soon as the maximum degree of the base graph is at least $\binom{s}{2} + 2$. We are able to verify the conjecture and prove that it is tight once we add the assumption that the base graph is triangle free. We also study the game without that assumption, disproving the conjecture in full generality and further attempting to locate the smallest maximum degree of a base graph which guarantees that the cop can save three vertices against $s$ robbers. We show that this number is between $2\binom{s}{2} - 3$ and $2\binom{s}{2} + 1$. Furthermore, after the game has been previously studied with one cop and multiple robbers, as well as with one robber and multiple cops, we initiate the study of the game with two cops and two robbers. In the case when the base graph is a cycle we determine the exact number of damaged vertices. Additionally, when the base graph is a path we provide bounds that differ by an additive constant.

math.CO↗