相关论文: Geometric densities and compression radii of knot …
We study a family of scale-invariant $p$-densities of knot types in $R^3$, defined as the ratio of length to an $L^p$-type spread of pairwise distances along a curve. The first point of the paper is that the unconstrained theory has a…
We prove estimates for the optimal volume of thick embeddings of finite graphs into symmetric spaces, generalising results of Kolmogorov-Barzdin and Gromov-Guth for embeddings into Euclidean spaces. We distinguish two very different…
We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…
We prove the existence of families of distinct isotopy classes of physical unknots through the key concept of parametrised thickness. These unknots have prescribed length, tube thickness, a uniform bound on curvature, and cannot be…
While the problem of estimating a probability density function (pdf) from its observations is classical, the estimation under additional shape constraints is both important and challenging. We introduce an efficient, geometric approach for…
A main goal in the field of statistical shape analysis is to define computable and informative metrics on spaces of immersed manifolds, such as the space of curves in a Euclidean space. The approach taken in the elastic shape analysis…
We derive concentration inequalities for the supremum norm of the difference between a kernel density estimator (KDE) and its point-wise expectation that hold uniformly over the selection of the bandwidth and under weaker conditions on the…
We investigated the asymptotics of high-rate constrained quantization errors for a compactly supported probability measure P on Euclidean spaces whose quantizers are confined to a closed set S. The key tool is the metric projection of K…
We develop a new approach for distributed distance computation in planar graphs that is based on a variant of the metric compression problem recently introduced by Abboud et al. [SODA'18]. One of our key technical contributions is in…
We introduce swept-area pseudometrics on ropelength-filtered spaces of knot representatives. For a knot type \(K\) and a ropelength level \(\Lambda\), admissible isotopies are required to pass through curves of thickness at least one and…
We consider $L^2$ minimizing geodesics along the group of volume preserving maps $SDiff(D)$ of a given 3-dimensional domain $D$. The corresponding curves describe the motion of an ideal incompressible fluid inside $D$ and are (formally)…
The ropelength problem asks for the minimum-length configuration of a knotted diameter-one tube embedded in Euclidean three-space. The core curve of such a tube is called a tight knot, and its length is a knot invariant measuring…
Density based representations of atomic environments that are invariant under Euclidean symmetries have become a widely used tool in the machine learning of interatomic potentials, broader data-driven atomistic modelling and the…
The densest local packing (DLP) problem in d-dimensional Euclidean space Rd involves the placement of N nonoverlapping spheres of unit diameter near an additional fixed unit-diameter sphere such that the greatest distance from the center of…
We present new computations of approximately length-minimizing polygons with fixed thickness. These curves model the centerlines of "tight" knotted tubes with minimal length and fixed circular cross-section. Our curves approximately…
Optimal recursive decomposition (or DR-planning) is crucial for analyzing, designing, solving or finding realizations of geometric constraint sytems. While the optimal DR-planning problem is NP-hard even for general 2D bar-joint constraint…
The ever-increasing parameter counts of deep learning models necessitate effective compression techniques for deployment on resource-constrained devices. This paper explores the application of information geometry, the study of…
We establish sufficient conditions for existence of curves minimizing length as measured with respect to a degenerate metric on the plane while enclosing a specified amount of Euclidean area. Non-existence of minimizers can occur and…
Stochastic simulations are used to characterize the knotting distributions of random ring polymers confined in spheres of various radii. The approach is based on the use of multiple Markov chains and reweighting techniques, combined with…
In optimal transport, quadratic regularization is a sparse alternative to entropic regularization: the solution measure tends to have small support. Computational experience suggests that the support decreases monotonically to the…