English
Related papers

Related papers: Ball packings for links

200 papers

A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove…

Geometric Topology · Mathematics 2012-09-05 Colin Adams

With the idea of an eventual classification of 3-bridge links,\ we define a very nice class of 3-balls (called butterflies) with faces identified by pairs, such that the identification space is $S^{3},$ and the image of a prefered set of…

Algebraic Topology · Mathematics 2012-03-12 H. M. Hilden , J. M. Montesinos , D. M. Tejada , M. M. Toro

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

Knots and links have been considered to be useful models for structural analysis of molecular chains such as DNA and proteins. One quantity that we are interested on molecular links is the minimum number of monomers necessary to realize…

Geometric Topology · Mathematics 2015-06-18 Kyungpyo Hong , Sungjong No , Seungsang Oh

Let $L \subset {\Bbb R}^3$ be the union of unit balls, whose centres lie on the $z$-axis, and are equidistant with distance $2d \in [2, 2\sqrt{2}]$. Then a packing of unit balls in ${\Bbb R}^3$ consisting of translates of $L$ has a density…

Metric Geometry · Mathematics 2017-06-19 K. Böröczky , A. Heppes , E. Makai

The lattice stick number of knots is defined to be the minimal number of straight sticks in the cubic lattice required to construct a lattice stick presentation of the knot. We similarly define the lattice stick number $s_{L}(G)$ of spatial…

Geometric Topology · Mathematics 2018-06-27 Hyungkee Yoo , Chaeryn Lee , Seungsang Oh

In the 1980's Daryl Cooper introduced the notion of a C-complex (or clasp-complex) bounded by a link and explained how to compute signatures and polynomial invariants using a C-complex. Since then this was extended by works of Cimasoni,…

Geometric Topology · Mathematics 2019-07-30 Jonah Amundsen , Eric Anderson , Christopher William Davis , Daniel Guyer

The lattice stick number $s_L(L)$ of a link $L$ is defined to be the minimal number of straight line segments required to construct a stick presentation of $L$ in the cubic lattice. Hong, No and Oh found a general upper bound $s_L(K) \leq 3…

Geometric Topology · Mathematics 2018-05-02 Hyoungjun Kim , Sungjong No

An $n$-crossing projection of a link $L$ is a projection of $L$ onto a plane such that $n$ points on $L$ are superimposed on top of each other at every crossing. We prove that for all $k \in \mathbb{N}$ and all links $L$, the inequality…

Geometric Topology · Mathematics 2020-10-30 Anshul Guha

In the course of our work on low-volume hyperbolic 3-manifolds, we came upon a linking problem for horoball necklaces in $\mathbb{H}^3$. A horoball necklace is a collection of sequentially tangent beards (i.e. spheres) with disjoint…

Geometric Topology · Mathematics 2018-05-08 David Gabai , Robert Meyerhoff , Andrew Yarmola

We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.

Computational Geometry · Computer Science 2019-08-13 Arnaud de Mesmay , Marcus Schaefer , Eric Sedgwick

The minimum $k$-enclosing ball problem seeks the ball with smallest radius that contains at least~$k$ of~$m$ given points in a general $n$-dimensional Euclidean space. This problem is NP-hard. We present a branch-and-bound algorithm on the…

Optimization and Control · Mathematics 2017-07-12 Marta Cavaleiro , Farid Alizadeh

For a knot or link K, let L(K) be the ropelength of K and Cr(K) be the crossing number of K. In this paper, we show that there exists a constant a>0 such that L(K) is bounded above by a Cr(K) ln^5 (Cr(K)) for any knot K. This result shows…

Geometric Topology · Mathematics 2009-12-18 Yuanan Diao , Claus Ernst , Attila Por , Uta Ziegler

The lattice stick number $s_L(K)$ of a knot $K$ is defined to be the minimal number of straight line segments required to construct a stick presentation of $K$ in the cubic lattice. In this paper, we find an upper bound on the lattice stick…

Geometric Topology · Mathematics 2017-05-17 KyungPyo Hong , SungJong No , SeungSang Oh

Given an initial configuration of pebbles on a graph, one can move pebbles in pairs along edges, at the cost of one of the pebbles moved, with the objective of reaching a specified target vertex. The pebbling number of a graph is the…

Combinatorics · Mathematics 2009-09-29 Airat Bekmetjev , Glenn Hurlbert

The n-th hull of a union of curves in R^3 is the set of points with the property: Any plane passing through the point intersects the curves at least 2n times. The hull number u(L) of a link L is defined as the minimum number of non-empty…

Geometric Topology · Mathematics 2007-05-23 Ivan Izmestiev

The Thurston norm is a seminorm on the second real homology group of a compact orientable 3-manifold. The unit ball of this norm is a convex polyhedron, whose shape's data (e.g. number of vertices, regularity) measures the complexity of the…

Geometric Topology · Mathematics 2024-12-05 Alessandro V. Cigna

For any link in the 3-sphere, there is a natural lower bound for the unlinking number in terms of the classical signature. We prove that if this lower bound is sharp for a special alternating link $L$, then the unlinking number of $L$ is…

Geometric Topology · Mathematics 2026-03-25 Duncan McCoy , JungHwan Park

A quadruple crossing is a crossing in a projection of a knot or link that has four strands of the knot passing straight through it. A quadruple crossing projection is a projection such that all of the crossings are quadruple crossings. In a…

Geometric Topology · Mathematics 2019-02-20 Colin Adams

Determining the minimum density of a covering of $\mathbb{R}^{n}$ by Euclidean unit balls as $n\to\infty$ is a major open problem, with the best known results being the lower bound of $\left(\mathrm{e}^{-3/2}+o(1)\right)n$ by Coxeter, Few…

Combinatorics · Mathematics 2025-10-30 Boris Bukh , Jun Gao , Xizhi Liu , Oleg Pikhurko , Shumin Sun
‹ Prev 1 2 3 10 Next ›