arXiv (All)
open access
Merge Trees of Length-Filtered Lattice Knot Spaces
We study lattice-filtered move graphs as finite-state models for knot types under a length cap. At level $N$, vertices are lattice polygons of a fixed knot type with length at most $N$, modulo orientation-preserving lattice isometries, and edges are local moves. The first level at which two initial
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
- Counting tangles in coverings of closed 2-orbifolds via ribbon categories#1049389
- $β$-Skewed Maximal Spanning Forests#999526
- Pine Needles#49425
- Riesz transform on eventually Gaussian local trees#1119404
- Maximum-Entropy Random Walks on Hypergraphs#985016
Record · ID 1155214
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