Related papers: How Many Links Fit in a Box?

A digraph $D$ is $k$-linked if for any pair of two disjoint sets $\{x_{1},x_{2},\ldots,x_{k}\}$ and $\{y_{1},y_{2},\ldots,y_{k}\}$ of vertices in $D$, there exist vertex disjoint dipaths $P_{1},P_{2},\ldots,P_{k}$ such that $P_{i}$ is a…

We generalize the Guth--Katz joints theorem from lines to varieties. A special case says that $N$ planes (2-flats) in 6 dimensions (over any field) have $O(N^{3/2})$ joints, where a joint is a point contained in a triple of these planes not…

Oleg Viro studied in arXiv:math/0204290 two interpretations of the (multivariable) Alexander polynomial as a quantum link invariant: either by considering the quasi triangular Hopf algebra associated to $U_q sl(2)$ at fourth roots of unity,…

We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…

The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering…

A linked bar chart is the augmentation of a traditional bar chart where each bar is partitioned into blocks and pairs of blocks are linked using orthogonal lines that pass over intermediate bars. The order of the blocks readily influences…

One of the fundamental results in graph minor theory is that for every planar graph $H$, there is a minimum integer $f(H)$ such that graphs with no minor isomorphic to $H$ have treewidth at most $f(H)$. A lower bound for ${f(H)}$ can be…

We introduce a new link invariant called the algebraic genus, which gives an upper bound for the topological slice genus of links. In fact, the algebraic genus is an upper bound for another version of the slice genus proposed here: the…

The ropelength of a knot is the minimum contour length of a tube of unit radius that traces out the knot in three dimensional space without self-overlap, colloquially the minimum amount of rope needed to tie a given knot. Theoretical upper…

Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as follows: there exist five perfect matchings of G such that each edge of G is contained in at least one of them. Here, we prove that in each…

Link equivalence up to isotopy in a 3-space is the problem that lies at the root of knot theory, and is important in 3-dimensional topology and geometry. We consider its restriction to alternating links, given by two alternating diagrams…

We show a combinatorial argument in the diagram of large class of links, including satellite and hyperbolic links, where for each of which the tunnel number is the minimum possible, the number of its components minus one.

In this article we introduce the study of the number of pairs of non-comparable elements in a distributive lattice $\L$. We give several tight lower and upper bounds for the number and give as an application the lattices precisely for which…

We reprove and extend a result of David Krebes (J. Knot Theory Ramif. 8 (1999), 321-352) giving an obstruction to embedding a tangle T into a link L. Closing the tangle up in the two obvious ways gives rise to two links, the numerator and…

We introduce a new numerical invariant of knots and links from the descending diagrams. It is considered to live between the unknotting number and the bridge number.

Links in lens spaces may be defined to be equivalent by ambient isotopy or by diffeomorphism of pairs. In the first case, for all the combinatorial representations of links, there is a set of Reidemeister-type moves on diagrams connecting…

A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…

Here we prove some special cases of the following conjecture: that the sum of the Betti numbers of a 1-connected elliptic space is greater than the total rank of its homotopy groups. Our main tool is Sullivan's minimal model.

It is proved that the rectilinear crossing number of every graph with bounded tree-width and bounded degree is linear in the number of vertices. **** This paper has been withdrawn by the author. **** The results have been superseeded by the…

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…