Exact Sum-of-Squares Certificates for a Sixteen-Parameter Family of Weighted Forests on Eight Vertices
An occupied edge in a random forest excludes every configuration that closes acycle. The resulting pairwise negative-correlation conjecture remains open for generalgraphs with arbitrary positive activities. Our headline result is an exact, computer-assisted monomial-weighted sum-of-squares (SOS) identity proving nonnegative Rayleighdifference for two disjoint edges of K8 throughout a specified sixteen-parameter family ofpositive activities. The certificate contains 1, 949, 629 integer-weighted squares; a separateimplementation verifies all 2, 655, 436 coefficients. We then remove four crossing edgesand allow eighteen independent activities. On this boundary the degree-twelve spanning-tree contribution vanishes, and the homogeneous terms of degrees four through sevenhave exact SOS certificates. The remaining degrees eight through eleven are unresolved.Exact two-terminal and contraction identities, a binomial-SOS obstruction, and thecomputational verification method are recorded. No unrestricted K8 SOS theorem orcounterexample to forest negative correlation is claimed.
Authors
- Tony Newton (ORCID: https://orcid.org/0009-0009-9189-6431)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24418179
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint