Mixed Partition Functions and Exponentially Bounded Edge-Connection Rank
Regts and Sevenster conjectured that a complex-valued graph parameter $f$ with $f(\varnothing)=1$ has exponentially bounded edge-connection rank precisely when it is a mixed partition function. The paper proves it, with the numbers of even and odd colours bounded in terms of the rank bound.
Exact FrontierDelta
Scope and record
Occurred: Jul 29, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-assisted. Imported under CC BY 4.0.
Canonical aliases: Mixed Partition Functions and Exponentially Bounded Edge-Connection Rank · Regts–Sevenster conjecture
Confidence: Not scored
Registry verification: unreviewed · preprint · resolved
Attribution
VibeMathed
registry · event recorded by
William Whistler
human · human collaborator
Claude Fable 5 + GPT-5.6 Sol Pro
model · ai model contributor
Lineage and corrections
This event attributed to William Whistler
This event attributed to Claude Fable 5 + GPT-5.6 Sol Pro