中文
相关论文

相关论文: On the optimal conformal capacity of linked curves

200 篇论文

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…

几何拓扑 · 数学 2026-03-16 Alexander R. Klotz

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…

泛函分析 · 数学 2018-04-10 Juliana Gaiba Oliveira , Sergio Antonio Tozoni

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…

微分几何 · 数学 2026-02-13 Alberto Enciso , Wadim Gerner , Daniel Peralta-Salas

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…

几何拓扑 · 数学 2007-05-23 Marta M. Asaeda , Jozef H. Przytycki

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.…

几何拓扑 · 数学 2007-05-23 O. C. Durumeric

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…

几何拓扑 · 数学 2025-07-29 Alexander Klotz

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 $+$…

数据结构与算法 · 计算机科学 2017-04-04 Moses Charikar , Neha Gupta , Roy Schwartz

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…

数据结构与算法 · 计算机科学 2016-02-02 Song Yang , Stojan Trajanovski , Fernando A. Kuipers

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…

微分几何 · 数学 2009-03-02 Jason Cantarella , Joseph H G Fu , Rob Kusner , John M Sullivan , Nancy C Wrinkle

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…

几何拓扑 · 数学 2025-03-20 Michael H. Freedman

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…

最优化与控制 · 数学 2025-12-08 C. Yalçın Kaya , Lyle Noakes , Philip Schrader

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…

机器人学 · 计算机科学 2017-09-20 Hung Pham , Quang-Cuong Pham

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…

几何拓扑 · 数学 2026-01-16 Hyungkee Yoo

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…

计算复杂性 · 计算机科学 2016-10-11 Jérôme Javelle , Mehdi Mhalla , Simon Perdrix

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…

微分几何 · 数学 2016-04-05 Pablo Angulo Ardoy

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…

计算几何 · 计算机科学 2019-03-05 Ali Gholami Rudi

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…

微分几何 · 数学 2021-02-09 Ruadhaí Dervan , Lars Martin Sektnan

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…

最优化与控制 · 数学 2018-11-26 Sepideh Hassan-Moghaddam , Mihailo R. Jovanović

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…

量子物理 · 物理学 2023-10-31 Raffaele Salvia , Giacomo De Palma , Vittorio Giovannetti

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…

几何拓扑 · 数学 2019-12-02 John A. Baldwin , Steven Sivek , Yi Xie
‹ 上一页 1 2 3 10 下一页 ›