Related papers: Links and Hurwitz curves

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…

In the present paper a criteria for a rectangular diagram to admit a simplification is given in terms of Legendrian knots. It is shown that there are two types of simplifications which are mutually independent in a sense. A new proof of the…

This is an expository article on diagrammatic representations of knots and links in various settings via braids.

We show that for a large class of hyperbolic knots and links, we can determine bounds on the volume of the link complement from combinatorial information given by a link diagram. Specifically, there is a universal constant C such that if a…

We show that all sufficiently large (2k+3)-connected graphs of bounded tree-width are k-linked. Thomassen has conjectured that all sufficiently large (2k+2)-connected graphs are k-linked.

Combining $2$-descent techniques with Riemann-Roch and B\'ezout's theorems, we give an upper bound on the number of rational points of bounded height on elliptic and hyperelliptic curves over function fields of characteristic $\neq 2$. We…

The threshold network model is a type of finite random graphs. In this paper, we introduce a generalized threshold network model. A pair of vertices with random weights is connected by an edge when real-valued functions of the pair of…

We present a new proof of Witten's conjecture. The proof is based on the analysis of the relationship between intersection indices on moduli spaces of complex curves and Hurwitz numbers enumerating ramified coverings of the 2-sphere.

We establish new Bonferroni-type lower bounds for the probability of a union of finitely many events where the selection of intersections in the estimates is determined by the clique complex of a chordal graph.

We show that if one can compute a little more than a particular moment for some family of L-functions, then one has upper bounds of the conjectured order of magnitude for all smaller (positive, real) moments and a one-sided central limit…

The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…

We show that a transverse link in a contact structure supported by an open book decomposition can be transversely braided. We also generalize Markov's theorem on when the closures of two braids represent (transversely) isotopic links.

This is a recreational paper showing that certain linked graphs cannot be separated. The proofs employ elementary covering space theory, an appeal to a theorem of Scharlemann (concerning the band sums of two unknots), and a Jones polynomial…

Eisermann has shown that the Jones polynomial of a $n$-component ribbon link $L\subset S^3$ is divided by the Jones polynomial of the trivial $n$-component link. We improve this theorem by extending its range of application from links in…

We obtain new lower and upper bounds for probabilities of unions of events.These bounds are sharp. They are stronger than earlier ones. General bounds maybe applied in arbitrary measurable spaces.We have improved the method that has been…

The ropelength of a knot is the quotient of its length and its thickness, the radius of the largest embedded normal tube around the knot. We prove existence and regularity for ropelength minimizers in any knot or link type; these are…

Assuming that Brouwers Conjecture the upper bound for the sum of t< n largest eigenvalues of Laplacian graph on n vertices true for n <n_0, we prove the Brouwers Conjecture BC for n > n_0 for some fixed n_0

We study Kauffman's model of folded ribbon knots: knots made of a thin strip of paper folded flat in the plane. The folded ribbonlength is the length to width ratio of such a ribbon knot. We give upper bounds on the folded ribbonlength of…

We give a shorter and simpler proof of the result of [2], which gives a necessary and sufficient condition for when a lattice diagram is the projection of a lattice link.

We give a stack-theoretic proof for some results on families of hyperelliptic curves.