Restricted Hodge Conjecture as a Consequence of the Entropic Barrier for NP
Fuente:
Zenodo
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Recurso digital |
| Publié: |
Zenodo
2025
|
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866901642620698624 |
|---|---|
| author | Ednyashev, Sanal |
| author_facet | Ednyashev, Sanal |
| contents | <p>This paper proposes a restricted computational analog of the Hodge Conjecture, derived from the proven entropy-based separation of P and NP.<br>The result shows that any persistent cohomology class emerging from bounded-treewidth graphs associated with NP-complete inputs must correspond to algebraically realizable (constructive) structure.<br>Otherwise, it would violate the entropic barrier that limits the recoverability of semantic content from persistent topological data.<br>The work bridges concepts in computational complexity, algebraic topology, and information theory.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_15320472 |
| institution | Zenodo |
| language | |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Restricted Hodge Conjecture as a Consequence of the Entropic Barrier for NP Ednyashev, Sanal <p>This paper proposes a restricted computational analog of the Hodge Conjecture, derived from the proven entropy-based separation of P and NP.<br>The result shows that any persistent cohomology class emerging from bounded-treewidth graphs associated with NP-complete inputs must correspond to algebraically realizable (constructive) structure.<br>Otherwise, it would violate the entropic barrier that limits the recoverability of semantic content from persistent topological data.<br>The work bridges concepts in computational complexity, algebraic topology, and information theory.</p> |
| title | Restricted Hodge Conjecture as a Consequence of the Entropic Barrier for NP |
| url | https://doi.org/10.5281/zenodo.15320472 |