Constraint Failure Boundary F: A Decidable Account over Two Finite Model Classes — Spectral Fibers of Single-Edge Graph Surgery and Distance Sets on F2 Tori
Year: 2026
Type: preprint
Abstract: This paper gives a decidable, fully recomputable account over two explicitly delimited modelfamilies, and contracts every general claim to the scope actually covered by a certificate. Modelfamily one is the twenty-five-element surgery graph class obtained from the disjoint union oftwo five-vertex path graphs plus one cross-block edge: every surgery graph is isomorphic to aunique arm-length signature normal form (six classes, of sizes 4,8,4,4,4,1); substituting y = λ2into the six exact characteristic polynomials yields six pairwise distinct quintic polynomials withinteger coefficients, whose spectral radii and subdominant readings are given pairwise disjointexact rational isolating intervals by Sturm sequences, and the reading fibers are exactly theisomorphism classes. The same classification formula holds for arbitrary Pm ⊔ Pn; for all 324size pairs with 3 ≤ m,n ≤ 20, the class counts agree with the membership formula and thereis no cospectral pair (symbolic-level final adjudication of characteristic polynomials), amongwhich the pair with the smallest spectral-radius gap holds a rational isolating-interval certificate,and the number of signature classes in the extended grid certificate is bounded above by 100.Model family two is the N-torus of the three-point L-shaped constraint system over F2: ZN isclosed under multiplication by 2 mod N and always contains the unit orbit ⟨2⟩; the solutionspace is trivial if and only if ZN is the full set (N ≥ 5; N = 3 is the unique direct exception,with dimV3 = 2 while Z3 is the full set); for any odd N, ZN is exactly the set of powersof 2 if and only if N is a Mersenne number; ZN is determined by an explicit root-conditionoverlap of the irreducible factors of gN, and the quadratic, cubic, and quartic primitive factorfamilies are completely solvable in closed form. The two model families share one adjudicationsyntax: a reading is legitimate if and only if it holds a recomputable certificate; the certificateof family one is signature classification plus Sturm rational isolating intervals, and that offamily two is ideal membership testing or factor-condition overlap, both being theorems ratherthan numerical extrapolation, where the ideal criterion is a theorem proved for general oddN. On the boundary: the general tree family is not determined by spectrum, whereas thesingle-edge bridge tree family exhibits no cospectral pair over all tested sizes — this contrastis registered as an open problem; the characterization of ZN for non-Mersenne N and themulti-orbit classification are registered as open problems. Throughout, readings are registeredonly and never promoted, negative conclusions are invariably conditionalized, and load-bearingexternal anchors serve only for positioning and never impersonate a proof of this paper. Thebody consists of Chapters 2 through 7 (in order: machine-checked ledger; models and definitions;surgery model family: classification and spectral fibers; torus distance sets; adjudication meaningand prohibited-inference table; open problems), followed by Appendices A through F.
Authors: zhou, changzheng, zhou, ziqing
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7233596133
Cites:
Cited by:
Related to:
