Related papers: Ball packings for links
A virtual link may be defined as an equivalence class of diagrams, or alternatively as a stable equivalence class of links in thickened surfaces. We prove that a minimal crossing virtual link diagram has minimal genus across representatives…
A necklace can be considered as a cyclic list of $n$ red and $n$ blue beads in an arbitrary order, and the goal is to fold it into two and find a large cross-free matching of pairs of beads of different colors. We give a counterexample for…
We study the smallest intersecting and enclosing ball problems in Euclidean spaces for input objects that are compact and convex. They link and unify many problems in computational geometry and machine learning. We show that both problems…
The incipient infinite cluster appearing at the bond percolation threshold can be decomposed into singly-connected ``links'' and multiply-connected ``blobs.'' Here we decompose blobs into objects known in graph theory as 3-blocks. A 3-block…
The locating rainbow connection number of a graph is defined as the minimum number of colors required to color vertices such that every two vertices there exists a rainbow vertex path and every vertex has a distinct rainbow code. This…
Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset)$ that covers almost every element of $2^{[n]}$:…
The Nil geometry, which is one of the eight 3-dimensional Thurston geometries, can be derived from {W. Heisenberg}'s famous real matrix group. The aim of this paper to study {\it lattice coverings} in Nil space. We introduce the notion of…
We prove that the Morse-Novikov number of a link L in a 3-sphere is less than or equal to twice the tunnel number of L.
We enumerate and show tables of minimal diagrams for all prime knots up to the triple-crossing number equal to five. We derive a minimal generating set of oriented moves connecting triple-crossing diagrams of the same oriented knot. We also…
A necklace is an equivalence class of words of length $n$ over an alphabet under the cyclic shift (rotation) operation. As a classical object, there have been many algorithmic results for key operations on necklaces, including counting,…
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…
If many micelles adsorb onto the same polymer molecule then they are said to form a necklace. A minimal model of such a necklace is proposed and shown to be almost equivalent to a 1-dimensional fluid with nearest-neighbour interactions. The…
Given $n$ points in a $d$ dimensional Euclidean space, the Minimum Enclosing Ball (MEB) problem is to find the ball with the smallest radius which contains all $n$ points. We give a $O(nd\Qcal/\sqrt{\epsilon})$ approximation algorithm for…
Let $G$ be a connected graph and $W=\{ w_1, w_2, \ldots, w_k \} \subseteq V(G)$ be an ordered set. For every vertex $v$, the metric representation of $v$ with respect to $W$ is an ordered $k$-vector defined as $r(v|W):=(d(v,w_1), d(v,w_2),…
Let $L$ be a oriented link such that $\Sigma_n(L)$, the $n$-fold cyclic cover of $S^3$ branched over $L$, is an L-space for some $n \geq 2$. We show that if either $L$ is a strongly quasipositive link other than one with Alexander…
An exact formula for the minimal coordination numbers of the parallel packed bundle of rods is presented based on an optimal thickening scenario. Hexagonal and square lattices are considered.
Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletion of e results in a graph that is not a brick. We prove a…
In this paper we study the Nil geometry that is one of the eight homogeneous Thurston 3-geomet\-ri\-es. We determine the equation of the translation-like bisector surface of any two points. We prove, that the isosceles property of a…
A 3-$(n,4,1)$ packing design consists of an $n$-element set $X$ and a collection of $4$-element subsets of $X$, called {\it blocks}, such that every $3$-element subset of $X$ is contained in at most one block. The packing number of…