Related papers: An Algorithmic Definition of Gabai Width
We study the properties of glued knots, a sub-class of real rational knots, that can be constructed by gluing ellipses. We define an invariant called the gluing degree and relate it to various classical properties of knots and classify all…
We show that, for an alternating knot, the ratio of the diameter of the set of boundary slopes to the crossing number can be arbitrarily large.
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
Gaussian graphical models are widely used to infer dependence structures. Bayesian methods are appealing to quantify uncertainty associated with structural learning, i.e., the plausibility of conditional independence statements given the…
The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander…
We introduce the notion of slice depth of a 2-knot K, which is the minimal integer n such that K is n-slice. We give an upper bound for the slice depth of the n-twist spin of a classical knot which belongs to several specific classes,…
We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…
This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are shown to be tighter than existing…
One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph…
In this note, we consider the problem of counting and verifying abelian border arrays of binary words. We show that the number of valid abelian border arrays of length \(n\) is \(2^{n-1}\). We also show that verifying whether a given array…
The ropelength of a knot or link is the minimal number of inches of 1-inch-thick rope that it takes to tie it. The relationship of this measurement to knot and link invariants has been studied by various authors. We give the first results…
Computing unlinking number is usually very difficult and complex problem, therefore we define BJ-unlinking number and recall Bernhard-Jablan conjecture stating that the classical unknotting/unlinking number is equal to the BJ-unlinking…
In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth two, does it represent the unknot? We also show that for a…
We report on the geometry and mechanics of knotted stiff strings. We discuss both closed and open knots. Our two main results are: (i) Their equilibrium energy as well as the equilibrium tension for open knots depend on the type of knot as…
Given any closed, connected, orientable $3$--manifold and integers $g\geq g(M), D > 0$, we show the existence of knots in $M$ whose genus $g$ bridge number is greater than $D$. These knots lie in a page of an open book decomposition of $M$,…
The metric dimension of a graph is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. Bailey and Meagher obtained an upper bound on the…
Graphs on integer points of polytopes whose edges come from a set of allowed differences are studied. It is shown that any simple graph can be embedded in that way. The minimal dimension of such a representation is the fiber dimension of…
The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a…
An implementation of BFACF-style algorithms on knotted polygons in the simple cubic, face centered cubic and body centered cubic lattice is used to estimate the statistics and writhe of minimal length knotted polygons in each of the…
Given a simple connected undirected graph G, the Wiener index W(G) of G is defined as half the sum of the distances over all pairs of vertices of G. In practice, G corresponds to what is known as the molecular graph of an organic compound.…