Search arXivSearch

arXiv · 2605.29160

Density and Compression on Lattice-Knot Merge Trees

Abstract

Ropelength is usually studied as a minimization problem for one knot at a time. We instead use ropelength to filter the space of all realizations of a knot type. For a knot type $K$ and a budget $Λ$, let $Y_Λ(K)$ be the space of unit-thickness $C^{1,1}$ configurations of length at most $Λ$, modulo rigid motions and constant-speed reparametrization. We prove compact capture for smooth knot families, yielding homotopical and homological exhaustion of the ordinary knot space by finite ropelength levels. In the normalized Euclidean model we prove compactness of every $Y_Λ(K)$, right continuity of connected components, and attainment of connected merge levels; on components of the ideal stratum these levels define an ultrametric. We also prove that $Y_L(K)$ strongly deformation retracts onto its exact-length shell. This separates an attained connected merge scale from the path merge scale, the genuine min-max quantity for constrained deformation paths. For higher homotopy we introduce ropelength widths and relate them to known models of spaces of knots. We record mirror symmetry and the complete minimal-layer BFACF merge trees of $4_1$ and $6_3$ as certified discrete benchmarks, without identifying discrete and continuum barriers. Finally, we relate the path filtration to the companion swept-area construction: at fixed ropelength its infimal trace area defines a genuine extended metric on the corresponding moduli space, with flat-current and projected-area lower bounds. The paper also formulates open problems concerning Gordian phenomena, regularization, and quantitative topology of thick-knot spaces.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Makoto Ozawa. 2026-08-26. Density and Compression on Lattice-Knot Merge Trees. https://arxiv.org/abs/2605.29160

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

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT