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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Exact Sum-of-Squares Certificates for a Sixteen-Parameter Family of Weighted Forests on Eight Vertices

Tony Newton
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Exact Sum-of-Squares Certificates for a Sixteen-Parameter Family of Weighted Forests on Eight Vertices

Tony Newton
preprint en

Abstract

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.

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
Exact Sum-of-Squares Certificates for a Sixteen-Parameter Family of Weighted Forests on Eight Vertices — Tony Newton · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS