相关论文: On the optimal conformal capacity of linked curves
Ropelength, L, is a parameter characterizing the minimum contour length of a knot or link. There exist upper and lower bounds on ropelength with respect to crossing number, C, including a universal lower bound constraining $L\geq\alpha_0…
Fixed a continuous kernel K on the $d$-dimensional torus, we consider a generalization of the univariate $sk$-spline to the torus, associated with the kernel K. It is proved an estimate which provides the rate of convergence of a given…
In this article we analyze the spectral properties of the curl operator on closed Riemannian 3-manifolds. Specifically, we study metrics that are optimal in the sense that they minimize the first curl eigenvalue among any other metric of…
We partially solve the conjecture by A.Shumakovitch about torsion in the Khovanov homology of prime, non-split links in S^3. We give a size restriction on the Khovanov homology of almost alternating links. We relate the Khovanov homology of…
Relatively extremal knots are the relative minima of the ropelength functional in C^1 topology. On the set curves of fixed length, they are the relative maxima of thickness (normal injectivity radius) functional, including the ideal knots.…
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…
Correlation Clustering is an elegant model that captures fundamental graph cut problems such as Min $s-t$ Cut, Multiway Cut, and Multicut, extensively studied in combinatorial optimization. Here, we are given a graph with edges labeled $+$…
Solving the shortest path and the min-cut problems are key in achieving high performance and robust communication networks. Those problems have often beeny studied in deterministic and independent networks both in their original…
In 1974, Gehring posed the problem of minimizing the length of two linked curves separated by unit distance. This constraint can be viewed as a measure of thickness for links, and the ratio of length over thickness as the ropelength. In…
In an earlier note [arXiv:2301.00295] it was shown that there is an upper bound to the number of disjoint Hopf links (and certain related links) that can be embedded in the unit cube where there is a fixed separation required between the…
We study the problem of finding curves of minimum pointwise-maximum arc-length derivative of curvature, here simply called curves of minimax spirality, among planar curves of fixed length with prescribed endpoints and tangents at the…
Finding the Time-Optimal Parameterization of a Path (TOPP) subject to second-order constraints (e.g. acceleration, torque, contact stability, etc.) is an important and well-studied problem in robotics. In comparison, TOPP subject to…
The ribbonlength of a link is a geometric invariant defined as the infimum of the ratio of the length to the width of a folded ribbon realization of the link. In this paper, we prove that if an alternating link admits an alternating diagram…
The local minimum degree of a graph is the minimum degree reached by means of a series of local complementations. In this paper, we investigate on this quantity which plays an important role in quantum computation and quantum error…
We present a new strategy for proving the Ambrose conjecture, a global version of the Cartan local lemma. A linking curve is defined as a curve in the tangent space whose composition with the exponential map is tree formed. This key idea is…
The goal in the min-\# curve simplification problem is to reduce the number of the vertices of a polygonal curve without changing its shape significantly. We study curve-restricted min-\# simplification of polygonal curves, in which the…
Consider a holomorphic submersion between compact K\"ahler manifolds, such that each fibre admits a constant scalar curvature K\"ahler metric. When the fibres admit continuous automorphisms, a choice of fibrewise constant scalar curvature…
We study an optimal control problem aimed at achieving a desired tradeoff between the network coherence and communication requirements in the distributed controller. Our objective is to add a certain number of edges to an undirected…
We investigate the problem of finding the local analogue of the ergotropy, that is the maximum work that can be extracted from a system if we can only apply local unitary transformation acting on a given subsystem. In particular, we provide…
We prove that any link in $S^3$ whose Khovanov homology is the same as that of a Hopf link must be isotopic to that Hopf link. This holds for both reduced and unreduced Khovanov homology, and with coefficients in either $\mathbb{Z}$ or…