Null designs and switching in polynomial spaces

Null designs are finite point configurations with real weights whose polynomial moments vanish up to a given degree. In Godsil's framework of polynomial spaces, we give elementary proofs of sharp lower bounds on the number of points in the Euclidean and spherical cases. We characterize the spherical null designs attaining the bound and give explicit formulas for their weights. We then study how null designs can be used to replace part of a weighted design while preserving its polynomial moments. We give conditions ensuring nonnegative weights and apply the minimum-size classification to switching on circles. Examples on spheres and in Hamming and Johnson spaces illustrate these results, including a replacement between noncongruent spherical $5$-designs that preserves equal weights and the number of points.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16178
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Null designs and switching in polynomial spaces

Masanori Sawa, Hiroshi Nozaki, Tomoki Tamaru, Masatake Hirao et al.
arXiv (Cornell University)
Advanced Combinatorial Mathematics
preprint

Null designs and switching in polynomial spaces

Masanori Sawa, Hiroshi Nozaki, Tomoki Tamaru, Masatake Hirao, Koji Imamura
preprint en

Abstract

Null designs are finite point configurations with real weights whose polynomial moments vanish up to a given degree. In Godsil's framework of polynomial spaces, we give elementary proofs of sharp lower bounds on the number of points in the Euclidean and spherical cases. We characterize the spherical null designs attaining the bound and give explicit formulas for their weights. We then study how null designs can be used to replace part of a weighted design while preserving its polynomial moments. We give conditions ensuring nonnegative weights and apply the minimum-size classification to switching on circles. Examples on spheres and in Hamming and Johnson spaces illustrate these results, including a replacement between noncongruent spherical $5$-designs that preserves equal weights and the number of points.

arXiv (Cornell University)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon