Search arXiv⌕ 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

Hecke Triangle Groups and Dessins d'Enfants

We study finite-index subgroups of the Hecke triangle group $H_q$ of signature $(2,q,\infty)$ through the finite-edge tessellation, special polygons, and the associated dessins. The quotient finite-edge graph is a connected bipartite ribbon graph in which even vertices have degree $1$ or $2$ and odd vertices may have any degree $d\mid q$; geometrically, degree $d$ records a $d$-cluster and an elliptic stabilizer of order $q/d$. We determine two finite ambiguities that arise when one passes from this quotient graph to a special polygon. First, all tree diagrams obtained from a fixed ribbon graph are classified by the possible spanning-tree cuts modulo graph automorphisms. Second, at a proper cluster one must record which cyclic gap contains the omitted branches of the universal $q$-star; every such choice develops to a special polygon. Combining the two gives an explicit finite description of all polygon orbits over a fixed dessin, together with a separate count of normalized realizations in the fixed tessellation. Concrete examples for $H_5$, $H_6$, and $H_7$ illustrate the geometry, and two arithmetic corollaries concern level-$2$ cusp labels and Galois orbits of principal congruence dessins.

math.CO↗

A new simple family of non-periodic tilings with square tiles

We define a new family of non-periodic tilings with square tiles that is mutually locally derivable with some family of tilings with isosceles right triangles. Both families are defined by simple local rules, and the proof of their non-periodicity is as simple as that of the non-periodicity of Robinson's tilings. We also relate the construction to the classical chair tiling: forgetting the decoration, our tilings map almost one-to-one onto the chair, our substitution is essentially a square root of the chair substitution, and our local rules are perfect, defining exactly the family of substitution tilings.

math.CO↗

Partitioning perfect graphs into comparability graphs

We study how many comparability subgraphs are needed to partition the edge set of a perfect graph. We show that many classes of perfect graphs can be partitioned into (at most) two comparability subgraphs and this holds for almost all perfect graphs. On the other hand, we prove that for interval graphs an arbitrarily large number of comparability subgraphs might be necessary.

math.CO↗