arXiv (All)
open access
An Algebraic Matching Algorithm for the Genus of Grid Diagrams
Grid diagrams encode knots and links combinatorially through an (n,n) winding matrix W(G). A fundamental invariant of the grid diagram is its genus g(G), which records essential topological information about the underlying knot. We give an algebraic algorithm that computes g(G) directly from W(G). 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
- Knot Tricks: What Mathematical Knot Theory Can Reveal about the Structure of Khipu Knot Encoding#16161
- Kink-equivalence of matrices, spanning surfaces, 4-manifolds, and quadratic forms#1186306
- The \(V_n\) Invariants as Colored Links--Gould Invariants:A Root--Center Approach#821486
- CorrFlow: Exact and Permutation-Equivariant Flow Matching on the Correlation Elliptope#1297958
- Projective Braids in $\mathbb{R}P^3$#1076987
Record · ID 1328104
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