Related papers: Computing boundary slopes of 2-bridge links
We define the Thurston-Bennequin polytope of a two-component link as the convex hull of all pairs of integers that arise as framings of a Legendrian representative. The main result of this paper is a description of the Thurston-Bennequin…
This paper presents a new algorithm "A" for constructing Seifert surfaces from n-bridge projections of links. The algorithm produces minimal complexity surfaces for large classes of braids and alternating links. In addition, we consider a…
We propose a method for computing upper bounds for the Heilbronn problem for triangles.
Surgery on a knot in $S^3$ is said to be an alternating surgery if it yields the double branched cover of an alternating link. The main theoretical contribution is to show that the set of alternating surgery slopes is algorithmically…
We give diagrammatic algorithms for computing the group trisection, homology groups, and intersection form of a closed, orientable, smooth 4-manifold, presented as a branched cover of a bridge-trisected surface in $\mathbb{S}^{4}$. The…
We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…
We compute the maximal Thurston-Bennequin number for a Legendrian two-bridge knot or oriented two-bridge link in standard contact R^3, by showing that the upper bound given by the Kauffman polynomial is sharp. As an application, we present…
A formula for the Alexander polynomial of a 2-bridge knot or link given by Hartley and also by Minkus has a beautiful interpretation as a walk on the integers. We extend this to the 2-variable Alexander polynomial of a 2-bridge link,…
In a previous work, the first and third authors studied a random knot model for all two-bridge knots using billiard table diagrams. Here we present a closed formula for the distribution of the crossing numbers of such random knots. We also…
Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is…
We give upper and lower bounds on the leading coefficients of the $L^2$-Alexander torsions of a $3$-manifold $M$ in terms of hyperbolic volumes and of relative $L^2$-torsions of sutured manifolds obtained by cutting $M$ along certain…
We study the equivariant concordance classes of two-bridge knots, providing an easy formula to compute their butterfly polynomial, and we give two different proofs that no two-bridge knot is equivariantly slice. Finally, we introduce a new…
Computer-based attempts to construct lower bounds for small Ramsey numbers are discussed. A systematic review of cyclic Ramsey graphs is attempted. Many known lower bounds are reproduced. Several new bounds are reported.
We give several algorithms addressing computations of intersections of conjugate subgroups.
We use twisted Alexander polynomials to show that certain algebraically slice 2-bridge knots are not topologically slice, even though all prime power Casson-Gordon signatures vanish. We also provide some computations indicating the efficacy…
We give an upper bound on the z-degree of the Kauffman polynomial of a link, using bridges of length greater than one which are separated in some tangle decomposition of a link diagram. We construct some examples by wiring together rational…
Circular layouts are a popular graph drawing style, where vertices are placed on a circle and edges are drawn as straight chords. Crossing minimization in circular layouts is \NP-hard. One way to allow for fewer crossings in practice are…
We give a list of hyperbolic two-bridge links which includes all such links with complete exceptional surgeries, i.e., Dehn surgeries on both components which yield non-hyperbolic manifolds but whose all the proper sub-fillings give…
We show that a finite numerical boundary slope of an essential surface in the exterior of a Montesinos knot is bounded above and below in terms of the numbers of positive/negative crossings of a specific minimal diagram of the knot.
In this contribution we derive an explicit formula for the boundary non-crossing probabilities for Slepian processes associated with the piecewise linear boundary function. This formula is used to develop an approximation formula to the…