Sunflower Detectors: MDS Classification, Layered Optimization, and the Limits of Envelope Counting

The interpolation method of Bucić, He, and Lee raises two connected questions: which prescribed spaces admit a normalized sunflower detector, and how efficiently can its layered monomial envelope be counted? We classify anchored detectors for arbitrary specified MDS spaces: sorted dimensions satisfy d_i ≥ i exactly when a detector exists, and the affine dimension is D[(D−1)⋯(D−m)−∏(D−d_i)]. The minimal profile is unique. For polynomial spaces over ordered fields, an even number of petals satisfies the corresponding all-direction rigidity criterion; odd petals and a four-element field illustrate its limits. Independently, we solve the cylinder-cover cost of a general complete profile envelope by equal binary relative entropies and a matching type-class witness. This gives explicit finite improvements, including F_4(N) < 2.312·1.988772^N, and the large-petal optimal saving (γ+o(1))/m^3 within the profile-counting and random-block framework, with 0.34938 < γ < 0.34940. These are structure and optimization results for a specified method; the inherited detector and block reduction retain their attribution.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24373109
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Sunflower Detectors: MDS Classification, Layered Optimization, and the Limits of Envelope Counting

ZHICHENG JIANG
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Sunflower Detectors: MDS Classification, Layered Optimization, and the Limits of Envelope Counting

ZHICHENG JIANG
preprint en

Abstract

The interpolation method of Bucić, He, and Lee raises two connected questions: which prescribed spaces admit a normalized sunflower detector, and how efficiently can its layered monomial envelope be counted? We classify anchored detectors for arbitrary specified MDS spaces: sorted dimensions satisfy d_i ≥ i exactly when a detector exists, and the affine dimension is D[(D−1)⋯(D−m)−∏(D−d_i)]. The minimal profile is unique. For polynomial spaces over ordered fields, an even number of petals satisfies the corresponding all-direction rigidity criterion; odd petals and a four-element field illustrate its limits. Independently, we solve the cylinder-cover cost of a general complete profile envelope by equal binary relative entropies and a matching type-class witness. This gives explicit finite improvements, including F_4(N) < 2.312·1.988772^N, and the large-petal optimal saving (γ+o(1))/m^3 within the profile-counting and random-block framework, with 0.34938 < γ < 0.34940. These are structure and optimization results for a specified method; the inherited detector and block reduction retain their attribution.

Zenodo (CERN European Organization for Nuclear Research)
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