arXiv (All)
open access
Khovanov complexes for bipartite links
Recently, for a limited class for bipartite links, the complicated Khovanov-Rozansky matrix factorization technique was reduced to an analogue of elementary Kauffman-Khovanov cycle calculus for an arbitrary $N$. In this note, we demonstrate the consistency of such reduction with the computation of t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Computing a connection matrix and persistence efficiently from a morse decomposition#476197
- Two conjectures on graphs and their edge-path matrices#617667
- Two conjectures on graphs and their edge-path matrices#617167
- On the 0/1 knapsack polytope#429993
- AT-SKM-Net: An Accelerated Trainable Sampling Kaczmarz-Motzkin Framework for Linear Hard-Constraint Feasibility on Dynamic Graphs#1078159
Record · ID 1036710
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive