arXiv subjects

Henrik Schumacher

Publications and source records attributed to Henrik Schumacher.

At least 19 recordsLinked to original sources

arXiv2026

Hard unknots are often easy from a different perspective

Recent attempts to train AI models to recognize knots have produced millions of ``hard'' unknot diagrams resistant to simplification by Reidemeister moves, pass moves, or random walks on the Reidemeister graph. Most are easy for the methods based on triangulations of the knot complement found in Regina and SnapPy, but more difficult for simplifiers based on diagrammatic moves. We present ReAPR (Re-embedding And Pass Rerouting), a semi-diagrammatic simplifier which alternates pass-move reduction on a knot diagram with a geometric re-embedding step. The re-embedding minimizes the total variation of a height function on the diagram subject to crossing constraints. We show that for an n-crossing diagram, the minimum total variation is 2(n-k), where k is the least number of crossings one must virtualize to make the diagram virtually alternating; this is a combinatorial invariant of the diagram. Reprojecting the resulting embedding from a new viewpoint reveals previously hidden simplifications. ReAPR successfully simplifies every published hard-unknot example we are aware of, as well as several new collections (~2.6 million examples in total) in under 30 seconds of total CPU time, making it as effective as the best non-diagrammatic unknot recognition method (SnapPy) and about 60x faster. ReAPR is just as effective at simplifying diagrams of random knots, where it is regularly used to simplify diagrams with tens of millions of crossings.

math.GT↗

arXiv2026

Inverse obstacle scattering regularized by the tangent-point energy

We employ the so-called tangent-point energy as Tikhonov regularizer for ill-conditioned inverse scattering problems in 3D. The tangent-point energy is a self-avoiding functional on the space of embedded surfaces that also penalizes surface roughness. Moreover, it features nice compactness and continuity properties. These allow us to show the well-posedness of the regularized problems and the convergence of the regularized solutions to the true solution in the limit of vanishing noise level. We also provide a reconstruction algorithm of iteratively regularized Gauss-Newton type. Our numerical experiments demonstrate that our method is numerically feasible and effective in producing reconstructions of unprecedented quality.

math.NA↗

arXiv2026

On the Palais-Smale condition in geometric knot theory

We prove that various families of energies relevant in geometric knot theory satisfy the Palais-Smale condition (PS) on submanifolds of arclength para\-metrized knots. These energies include linear combinations of the Euler-Bernoulli bending energy with a wide variety of non-local knot energies, such as O'Hara's self-repulsive potentials $E^{α,p}$, generalized tangent-point energies $\TP^{(p,q)}$, and generalized integral Menger curvature functionals $\intM^{(p,q)}$. Even the tangent-point energies $\TP^{(p,2)}$ for $p\in (4,5)$ alone are shown to fulfill the (PS)-condition. For all energies mentioned we can therefore prove existence of minimizing knots in any prescribed ambient isotopy class, and we provide long-time existence of their Hilbert-gradient flows, and subconvergence to critical knots as time goes to infinity. In addition, we prove $C^\infty$-smoothness of all arclength constrained critical knots, which shows in particular that these critical knots are also critical for the energies on the larger open set of regular knots under a fixed-length constraint.

math.CA↗

arXiv2026

Random knotting in very long off-lattice self-avoiding polygons

We present experimental results on knotting in off-lattice self-avoiding polygons in the bead-chain model. Using Clisby's tree data structure and the scale-free pivot algorithm, for each $k$ between $10$ and $27$ we generated $2^{43-k}$ polygons of size $n=2^k$. Using a new knot diagram simplification and invariant-free knot classification code, we were able to determine the precise knot type of each polygon. The results show that the number of prime summands of knot type $K$ in a random $n$-gon is very well described by a Poisson distribution. We estimate the characteristic length of knotting as $656500 \pm 2500$. We use the count of summands for large $n$ to measure knotting rates and amplitude ratios of knot probabilities more accurately than previous experiments. Our calculations agree quite well with previous on-lattice computations, and support both knot localization and the knot entropy conjecture.

cond-mat.stat-mech↗

arXiv2025

On a Complete Riemannian Metric on the Space of Embedded Curves

We propose a new strong Riemannian metric on the manifold of (parametrized) embedded curves of regularity $H^s$, $s\in(3/2,2)$. We highlight its close relationship to the (generalized) tangent-point energies and employ it to show that this metric is complete in the following senses: (i) bounded sets are relatively compact with respect to the weak $H^s$ topology; (ii) every Cauchy sequence with respect to the induced geodesic distance converges; (iii) solutions of the geodesic initial-value problem exist for all times; and (iv) there are length-minimizing geodesics between every pair of curves in the same path component (i.e., in the same knot class). As a by-product, we show $C^\infty$-smoothness of the tangent-point energies in the Hilbert case.

math.DG↗

arXiv2025

New Upper Bounds for Stick Numbers

We use a version of simulated annealing with knot-type preserving moves to find polygonal representatives of various knot types with low stick number. These give better bounds on stick numbers of prime knots through 10 crossings, and for the first time give a comprehensive table of stick number bounds on all knots through 13 crossings. These are equal to existing lower bounds (and hence determine the stick number exactly) for 19 knot types whose exact stick number was not known previously.

math.GT↗

arXiv2024

On the average squared radius of gyration of a family of embeddings of subdivision graphs

Suppose we have an embedding of a graph $\mathbf{G}$ created by subdividing the edges of a simpler graph $\mathbf{G'}$. The edges of $\mathbf{G}$ can be divided into subsets which join pairs of ``junction'' vertices in $\mathbf{G'}$. The displacement vectors of the edges in each subset sum to the displacement between junctions. We can construct a family of embeddings of $\mathbf{G}$ with the same junction positions by rearranging the displacements in each group. In this paper, we show that the average (squared) radius of gyration of these embeddings is given by a simple formula involving a weighted (squared) radius of gyration of the positions of the junctions and the sum of the squares of the lengths of the edges of $\mathbf{G}$ and $\mathbf{G'}$. This ensemble of graph embeddings arises naturally in polymer science.

math.CO↗

arXiv2024

A faster direct sampling algorithm for equilateral closed polygons and the probability of knotting

We present a faster direct sampling algorithm for random equilateral closed polygons in three-dimensional space. This method improves on the moment polytope sampling algorithm of Cantarella, Duplantier, Shonkwiler, and Uehara (2016) and has (expected) time per sample quadratic in the number of edges in the polygon. We use our new sampling method and a new code for computing invariants based on the Alexander polynomial to investigate the probability of finding unknots among equilateral closed polygons.

cond-mat.stat-mech↗

arXiv2023

CoBarS: Fast reweighted sampling for polygon spaces in any dimension

We present the first algorithm for sampling random configurations of closed $n$-gons with any fixed edgelengths $r_1, \dots, r_n$ in any dimension $d$ which is proved to sample correctly from standard probability measures on these spaces. We generate open $n$-gons as weighted sets of edge vectors on the unit sphere and close them by taking a Möbius transformation of the sphere which moves the center of mass of the edges to the origin. Using previous results of the authors, such a Möbius transformation can be found in $O(n)$ time. The resulting closed polygons are distributed according to a pushforward measure. The main contribution of the present paper is the explicit calculation of reweighting factors which transform this pushforward measure to any one of a family of standard measures on closed polygon space, including the symplectic volume for polygons in $\mathbb{R}^3$. For fixed dimension, these reweighting factors may be computed in $O(n)$ time. Experimental results show that our algorithm is efficient and accurate in practice, and an open-source reference implementation is provided.

math.DG↗

arXiv2021

Repulsive Surfaces

Functionals that penalize bending or stretching of a surface play a key role in geometric and scientific computing, but to date have ignored a very basic requirement: in many situations, surfaces must not pass through themselves or each other. This paper develops a numerical framework for optimization of surface geometry while avoiding (self-)collision. The starting point is the tangent-point energy, which effectively pushes apart pairs of points that are close in space but distant along the surface. We develop a discretization of this energy for triangle meshes, and introduce a novel acceleration scheme based on a fractional Sobolev inner product. In contrast to similar schemes developed for curves, we avoid the complexity of building a multiresolution mesh hierarchy by decomposing our preconditioner into two ordinary Poisson equations, plus forward application of a fractional differential operator. We further accelerate this scheme via hierarchical approximation, and describe how to incorporate a variety of constraints (on area, volume, etc.). Finally, we explore how this machinery might be applied to problems in mathematical visualization, geometric modeling, and geometry processing.

cs.GR↗

arXiv2021

Sobolev Gradients for the Möbius Energy

Aiming at optimizing the shape of closed embedded curves within prescribed isotopy classes, we use a gradient-based approach to approximate stationary points of the Möbius energy. The gradients are computed with respect to Sobolev inner products similar to the $W^{3/2,2}$-inner product. This leads to optimization methods that are significantly more efficient and robust than standard techniques based on $L^2$-gradients.

math.NA↗

arXiv2021

A speed preserving Hilbert gradient flow for generalized integral Menger curvature

We establish long-time existence for a projected Sobolev gradient flow of generalized integral Menger curvature in the Hilbert case, and provide $C^{1,1}$-bounds in time for the solution that only depend on the initial curve. The self-avoidance property of integral Menger curvature guarantees that the knot class of the initial curve is preserved under the flow, and the projection ensures that each curve along the flow is parametrized with the same speed as the initial configuration. Finally, we describe how to simulate this flow numerically with substantially higher efficiency than in the corresponding numerical $L^2$ gradient descent or other optimization methods.

math.CA↗

arXiv2020

Repulsive Curves

Curves play a fundamental role across computer graphics, physical simulation, and mathematical visualization, yet most tools for curve design do nothing to prevent crossings or self-intersections. This paper develops efficient algorithms for (self-)repulsion of plane and space curves that are well-suited to problems in computational design. Our starting point is the so-called tangent-point energy, which provides an infinite barrier to self-intersection. In contrast to local collision detection strategies used in, e.g., physical simulation, this energy considers interactions between all pairs of points, and is hence useful for global shape optimization: local minima tend to be aesthetically pleasing, physically valid, and nicely distributed in space. A reformulation of gradient descent, based on a Sobolev-Slobodeckij inner product enables us to make rapid progress toward local minima---independent of curve resolution. We also develop a hierarchical multigrid scheme that significantly reduces the per-step cost of optimization. The energy is easily integrated with a variety of constraints and penalties (e.g., inextensibility, or obstacle avoidance), which we use for applications including curve packing, knot untangling, graph embedding, non-crossing spline interpolation, flow visualization, and robotic path planning.

cs.GR↗

arXiv2020

Computing the conformal barycenter

The conformal barycenter of a point cloud on the sphere at infinity of the Poincaré ball model of hyperbolic space is a hyperbolic analogue of the geometric median of a point cloud in Euclidean space. It was defined by Douady and Earle as part of a construction of a conformally natural way to extend homeomorphisms of the circle to homeomorphisms of the disk, and it plays a central role in Millson and Kapovich's model of the configuration space of cyclic linkages with fixed edgelengths. In this paper we consider the problem of computing the conformal barycenter. Abikoff and Ye have given an iterative algorithm for measures on $\mathbb{S}^1$ which is guaranteed to converge. We analyze Riemannian versions of Newton's method computed in the intrinsic geometry of the Poincare ball model. We give Newton-Kantorovich (NK) conditions under which we show that Newton's method with fixed step size is guaranteed to converge quadratically to the conformal barycenter for measures on any $\mathbb{S}^d$ (including infinite-dimensional spheres). For measures given by $n$ atoms on a finite dimensional sphere which obey the NK conditions, we give an explicit linear bound on the computation time required to approximate the conformal barycenter to fixed error. We prove that our NK conditions hold for all but exponentially few $n$ atom measures. For all measures with a unique conformal barycenter we show that a regularized Newton's method with line search will always converge (eventually superlinearly) to the conformal barycenter. Though we do not have hard time bounds for this algorithm, experiments show that it is extremely efficient in practice and in particular much faster than the Abikoff-Ye iteration.

math.DG↗

arXiv2019

Maximal discrete sparsity in parabolic optimal control with measures

We consider variational discretization of a parabolic optimal control problem governed by space-time measure controls. For the state discretization we use a Petrov-Galerkin method employing piecewise constant states and piecewise linear and continuous test functions in time. For the space discretization we use piecewise linear and continuous functions. As a result the controls are composed of Dirac measures in space-time, centered at points on the discrete space-time grid. We prove that the optimal discrete states and controls converge strongly in $L^q$ and weakly-$*$ in $\mathcal{M}$, respectively, to their smooth counterparts, where $q \in (1,\min\{2,1+2/d\}]$ is the spatial dimension. Furthermore, we compare our approach to a approach by Casas, E. and Kunisch, K., where the corresponding control problem is discretized employing a discontinuous Galerkin method for the state discretization and where the discrete controls are piecewise constant in time and Dirac measures in space. Numerical experiments highlight the features of our discrete approach.

math.OC↗

arXiv2019

Elastic energy regularization for inverse obstacle scattering problems

By introducing a shape manifold as a solution set to solve inverse obstacle scattering problems we allow the reconstruction of general, not necessarily star-shaped curves. The bending energy is used as a stabilizing term in Tikhonov regularization to gain independence of the parametrization. Moreover, we discuss how self-intersections can be avoided by penalization with the Möbius energy and prove the regularizing property of our approach as well as convergence rates under variational source conditions. In the second part of the paper the discrete setting is introduced, and we describe a numerical method for finding the minimizer of the Tikhonov functional on a shape-manifold. Numerical examples demonstrate the feasibility of reconstructing non-star-shaped obstacles.

math.NA↗

arXiv2019

Variational Convergence of Discrete Elasticae

We discuss a discretization by polygonal lines of the Euler-Bernoulli bending energy and of Euler elasticae under clamped boundary conditions. We show Hausdorff convergence of the set of almost minimizers of the discrete bending energy to the set of smooth Euler elasticae under mesh refinement in (i) the $W^{1,\infty}$-topology for piecewise-linear interpolation and in (ii) the $W^{2,p}$-topology, $p \in{[2,\infty[}$, using a suitable smoothing operator to create $W^{2,p}$-curves from polygons.

math.NA↗

arXiv2017

On $H^2$-gradient Flows for the Willmore Energy

We show that the concept of $H^2$-gradient flow for the Willmore energy and other functionals that depend at most quadratically on the second fundamental form is well-defined in the space of immersions of Sobolev class $W^{2,p}$ from a compact, $n$-dimensional manifold into Euclidean space, provided that $p \geq 2$ and $p>n$. We also discuss why this is not true for Sobolev class $H^2=W^{2,2}$. In the case of equality constraints, we provide sufficient conditions for the existence of the projected $H^2$-gradient flow and demonstrate its usability for optimization with several numerical examples.

math.NA↗