Searcharxiv⌕ Search

arXiv subjects

Alexander Klotz

Publications and source records attributed to Alexander Klotz.

2 recordsLinked to original sources

LLM-Assisted Advances in the Ropelength Problem

This work summarizes some updates to the ropelength problem, concerning the shortest possible contour length of a unit-thickness knot, that were derived with the assistance of ChatGPT-5.6 Luna. The first of two main results is that the universal lower bound for a knot with crossing number C has been improved from $L\geq1.105C^{3/4}$ to $L\geq2.0996C^{3/4}$, achieved by further separating local and global terms in an optimization integral. The second main result is a bound relating ropelength to stick number (s), such that $L\geqπ(s-1)$. This implies stronger lower bounds for the ropelengths of at least 41 torus knots, and a specific class of pretzel knots. Other results include an improved packing-based lower bound for T(Q,Q) links and an optimized standard parameterization for torus knots. There were many problems for which the LLM was unable to render assistance, for example in reducing the numerical coefficients or scalings of known universal upper bounds.

math.GT↗

Geometric considerations for energy minimization of topological links and chainmail networks

Knot and link energies can be computed from sets of closed curves in three dimensional space, and each type of knot or link has a minimum energy associated with it. Here, we consider embeddings of links that locally or globally minimize the Möbius and Minimum Distance energies. By describing these energies as functions of a small number of free parameters, we can find configurations that minimize the energies with respect to these parameters. It has previous been demonstrated that such minimizers exist, but the specific embeddings have not necessarily been found. We find the geometries leading to minimal configurations of Hopf links and Borromean rings, as well as more complex structures such as chain links and chainmails. We find that scale-invariant properties of these energies can lead to ``non-physical'' minimizers, e.g. that a linear chain of Hopf links will subtend a finite length as its crossing number diverges. This incidentally allows us to derive a conjectural improved universal lower bound for the ropelength of knots and links. We also show that Japanese-style square chainmail networks are more efficient, in terms of excess energy, than square lattice ``4-in-1'' chainmail networks.

math.GT↗