Topological Collapse: P = NP Implies #P = FP via Solution-Space Homology

M. Alasli

Home/Archive/arXiv

arXiv · 2603.22211

Topological Collapse: P = NP Implies #P = FP via Solution-Space Homology

M. Alasli

View original source ↗Read source document ↗Export metadata ↓

Abstract

We prove that P = NP implies #P = FP by exploiting the topological structure of 3SAT solution spaces. The argument proceeds via a dichotomy: any polynomial-time algorithm for 3SAT either operates without global knowledge of the solution-space topology, in which case it cannot certify unsatisfiability for instances with second Betti number b_2 = 2^{Omega(N)} (leading to contradiction), or it computes global topological invariants, which are #P-hard. As local information is provably insufficient and any useful global invariant is #P-hard, the dichotomy is exhaustive. The proof is non-relativizing, consistent with oracles separating P = NP from #P = FP, and therefore necessarily exploits non-oracle properties of computation. Combined with Toda's theorem, the result yields P = NP => #P = FP => PH = P, providing new structural evidence for P != NP via a topological mechanism. We complement the theoretical framework with empirical validation of solution-space shattering at scale (N up to 500), demonstrating that these topological barriers manifest as measurable hardness across five independent algorithm classes.

Explore related subjects

cs.CC

Keep this discovery

BibTeX RIS

M. Alasli. 2026-03-23. Topological Collapse: P = NP Implies #P = FP via Solution-Space Homology. https://arxiv.org/abs/2603.22211

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗