English
Related papers

Related papers: Dehn surgeries on the figure eight knot: an upper …

200 papers

We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number of cut edges or their total length. We show that this…

Computational Geometry · Computer Science 2007-05-23 Jeff Erickson , Sariel Har-Peled

Assume that $V_h$ is a space of piecewise polynomials of degree less than $r\geq 1$ on a family of quasi-uniform triangulation of size $h$. Then the following well-known upper bound holds for a sufficiently smooth function $u$ and $p\in [1,…

Numerical Analysis · Mathematics 2011-06-23 Qun Lin , Hehu Xie , Jinchao Xu

We determine all Chern numbers of smooth complex projective varieties of dimension at least four which are determined up to finite ambiguity by the underlying smooth manifold. We also give an upper bound on the dimension of the space of…

Algebraic Geometry · Mathematics 2018-10-31 Stefan Schreieder , Luca Tasin

This paper concerns the Dehn surgery construction, especially those Dehn surgeries leaving the manifold unchanged. In particular, we describe an oriented 1-cusped hyperbolic 3-manifold X with a pair of slopes r_1, r_2 such that the Dehn…

Geometric Topology · Mathematics 2016-09-07 Steven A. Bleiler , Craig D. Hodgson , Jeffrey R. Weeks

Let K be a knot in the 3-sphere. A slope p/q is said to be characterising for K if whenever p/q surgery on K is homeomorphic, via an orientation-preserving homeomorphism, to p/q surgery on another knot K' in the 3-sphere, then K and K' are…

Geometric Topology · Mathematics 2018-08-08 Marc Lackenby

A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining…

Computational Geometry · Computer Science 2014-10-24 Stylianos C. Despotakis , Ioannis Z. Emiris

The reach of a submanifold of $\mathbb{R}^N$ is defined as the largest radius of a tubular neighbourhood around the submanifold that avoids self-intersections. While essential in geometric and topological applications, computing the reach…

Numerical Analysis · Mathematics 2025-05-14 Daniel Platt , Raúl Sánchez Galán

We prove that all rational slopes are characterizing for the knot $5_2$, except possibly for positive integers. Along the way, we classify the Dehn surgeries on knots in $S^3$ that produce the Brieskorn sphere $\Sigma(2,3,11)$, and we study…

Geometric Topology · Mathematics 2024-06-10 John A. Baldwin , Steven Sivek

Let $d\geq 3$ be a constant and let $F$ be a $d$-regular graph on $[n]$ with not too many symmetries. By the union bound, the probability threshold for the existence of a spanning subgraph in $G(n,p)$ isomorphic to $F$ is at least…

Combinatorics · Mathematics 2023-03-10 Maksim Zhukovskii

In this paper we clarify an issue in the knot surgery construction of Fintushel and Stern. Using knot surgery, they construct an infinite number of smooth structures on 4-manifolds satisfying certain conditions, but they do not explicitly…

Geometric Topology · Mathematics 2013-10-09 Nathan Sunukjian

It is known that any contact 3-manifold can be obtained by rational contact Dehn surgery along a Legendrian link L in the standard tight contact 3-sphere. We define and study various versions of contact surgery numbers, the minimal number…

Geometric Topology · Mathematics 2026-02-10 John Etnyre , Marc Kegel , Sinem Onaran

Research about crossings is typically about minimization. In this paper, we consider \emph{maximizing} the number of crossings over all possible ways to draw a given graph in the plane. Alpert et al. [Electron. J. Combin., 2009] conjectured…

Computational Geometry · Computer Science 2017-05-16 Markus Chimani , Stefan Felsner , Stephen Kobourov , Torsten Ueckerdt , Pavel Valtr , Alexander Wolff

In an earlier paper, we used the absolute grading on Heegaard Floer homology to give restrictions on knots in $S^3$ which admit lens space surgeries. The aim of the present article is to exhibit stronger restrictions on such knots, arising…

Geometric Topology · Mathematics 2007-05-23 Peter Ozsvath , Zoltan Szabo

We show that any exceptional non-trivial Dehn surgery on a hyperbolic two-bridge knot yields a 3-manifold whose fundamental group is left-orderable. This gives a new supporting evidence for a conjecture of Boyer, Gordon and Watson.

Geometric Topology · Mathematics 2011-10-05 Adam Clay , Masakazu Teragaito

Given a closed four-manifold $X$ with an indefinite intersection form, we consider smoothly embedded surfaces in $X \setminus $int$(B^4)$, with boundary a knot $K \subset S^3$. We give several methods to bound the genus of such surfaces in…

Geometric Topology · Mathematics 2023-12-11 Ciprian Manolescu , Marco Marengon , Lisa Piccirillo

We give a simple argument showing that the number of edges in the intersection graph $G$ of a family of $n$ sets in the plane with a linear union-complexity is $O(\omega(G)n)$. In particular, we prove $\chi(G)\leq \text{col}(G)<…

Combinatorics · Mathematics 2014-10-21 Piotr Micek , Rom Pinchasi

Let V be a smooth projective 3-fold of general type. Denote by $K^3$, a rational number, the self-intersection of the canonical sheaf of any minimal model of V. One defines $K^3$ as the canonical volume of $V$. Assume $p_g\ge 2$. We show…

Algebraic Geometry · Mathematics 2007-05-23 Meng Chen

Ropelength, L, is a parameter characterizing the minimum contour length of a knot or link. There exist upper and lower bounds on ropelength with respect to crossing number, C, including a universal lower bound constraining $L\geq\alpha_0…

Geometric Topology · Mathematics 2026-03-16 Alexander R. Klotz

We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.

Combinatorics · Mathematics 2009-06-04 Michael Goff

We prove a general lower bound on the average-case complexity of Shellsort: the average number of data-movements (and comparisons) made by a $p$-pass Shellsort for any incremental sequence is $\Omega (pn^{1 + 1/p})$ for every $p$. The proof…

Computational Complexity · Computer Science 2015-01-29 Tao Jiang , Ming Li , Paul Vitanyi