Searcharxiv⌕ Search

arXiv subjects

Joel Hass

Publications and source records attributed to Joel Hass.

At least 37 records · Page 2Linked to original sources

Stabilization of Heegaard splittings

For each g greater than one there is a 3-manifold with two genus g Heegaard splittings that require g stabilizations to become equivalent. Previously known examples required at most one stabilization. Control of families of Heegaard surfaces is obtained through a deformation to harmonic maps.

math.GT↗

Invariants of Knot Diagrams

We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal number of Reidemeister moves needed to pass between certain pairs of knot diagrams.

math.GT↗

Knots and k-width

We investigate several integer invariants of curves in 3-space. We demonstrate relationships of these invariants to crossing number and to total curvature.

math.GT↗

The Computational Complexity of Knot Genus and Spanning Area

We investigate the computational complexity of some problems in three-dimensional topology and geometry. We show that the problem of determining a bound on the genus of a knot in a 3-manifold, is NP-complete. Using similar ideas, we show that deciding whether a curve in a metrized PL 3-manifold bounds a surface of area less than a given constant C is NP-hard.

math.GT↗

Area Inequalities for Embedded Disks Spanning Unknotted Curves

We show that a smooth unknotted curve in R^3 satisfies an isoperimetric inequality that bounds the area of an embedded disk spanning the curve in terms of two parameters: the length L of the curve and the thickness r (maximal radius of an embedded tubular neighborhood) of the curve. For fixed length, the expression giving the upper bound on the area grows exponentially in 1/r^2. In the direction of lower bounds, we give a sequence of length one curves with r approaching 0 for which the area of any spanning disk is bounded from below by a function that grows exponentially with 1/r. In particular, given any constant A, there is a smooth, unknotted length one curve for which the area of a smallest embedded spanning disk is greater than A.

math.DG↗

The Number of Triangles Needed to Span a Polygon Embedded in R^d

Given a closed polygon P having n edges, embedded in R^d, we give upper and lower bounds for the minimal number of triangles t needed to form a triangulated PL surface in R^d having P as its geometric boundary. The most interesting case is dimension 3, where the polygon may be knotted. We use the Seifert suface construction to show there always exists an embedded surface requiring at most 7n^2 triangles. We complement this result by showing there are polygons in R^3 for which any embedded surface requires at least 1/2n^2 - O(n) triangles. In dimension 2 only n-2 triangles are needed, and in dimensions 5 or more there exists an embedded surface requiring at most n triangles. In dimension 4 we obtain a partial answer, with an O(n^2) upper bound for embedded surfaces, and a construction of an immersed disk requiring at most 3n triangles. These results can be interpreted as giving qualitiative discrete analogues of the isoperimetric inequality for piecewise linear manifolds.

math.GT↗

The size of spanning disks for polygonal curves

Let $K$ be a closed polygonal curve in $\RR^3$ consisting of $n$ line segments. Assume that $K$ is unknotted, so that it is the boundary of an embedded disk in $\RR^3$. This paper considers the question: How many triangles are needed to triangulate a Piecewise-Linear (PL) spanning disk of $K$? The main result exhibits a family of unknotted polygons with $n$ edges, $n \to \infty$, such that the minimal number of triangles needed in any triangulated spanning disk grows exponentially with $n$. For each integer $n \ge 0$, there is a closed, unknotted, polygonal curve $K_n$ in $R^3$ having less than $10n+9$ edges, with the property that any Piecewise-Linear triangulated disk spanning the curve contains at least $2^{n-1}$ triangles.

math.GT↗

Affine isoperimetric inequalities for piecewise linear surfaces

This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles needed to forma triangulated embedded orientable surface in R^d having P as its geometric boundary. The most interesting case is dimension dimension 3, where we give an upper bound of 7 n^2 triangles, and a lower bound for some polygons P that require at least 1/2 n^2 triangles. In dimension 2 and dimensions 5 and above one needs only O(n) triangles. The case of dimension 4 is not completely resolved.

math.GT↗

Double Bubbles Minimize

The classical isoperimetric inequality in R^3 states that the surface of smallest area enclosing a given volume is a sphere. We show that the least area surface enclosing two equal volumes is a double bubble, a surface made of two pieces of round spheres separated by a flat disk, meeting along a single circle at an angle of 120 degrees.

math.DG↗

On finiteness of the number of boundary slopes of immersed surfaces in 3-manifolds

For any hyperbolic 3-manifold $M$ with totally geodesic boundary, there are finitely many boundary slopes for essential immersed surfaces of a given genus. There is a uniform bound for the number of such boundary slopes if the genus of $\partial M$ or the volume of $M$ is bounded above. When the volume is bounded above, then area of $\partial M$ is bounded above and the length of closed geodesic on $\partial M$ is bounded below.

math.GT↗

Configurations of curves and geodesics on surfaces

We study configurations of immersed curves in surfaces and surfaces in 3-manifolds. Among other results, we show that primitive curves have only finitely many configurations which minimize the number of double points. We give examples of minimal configurations not realized by geodesics in any hyperbolic metric.

math.GT↗

Boundary slopes of immersed surfaces in 3-manifolds

This paper presents some finiteness results for the number of boundary slopes of immersed essential surfaces of given genus g in a compact 3-manifold with torus boundary. In the case of hyperbolic 3-manifolds we obtain uniform quadratic bounds in g for the number of possible slopes, independent of the 3-manifold. We also look at some related quantities, such as how many times the slopes of two such surfaces of specified genus can intersect.

math.GT↗

Emerging Challenges in Computational Topology

Here we present the results of the NSF-funded Workshop on Computational Topology, which met on June 11 and 12 in Miami Beach, Florida. This report identifies important problems involving both computation and topology.

cs.CG↗

The Computational Complexity of Knot and Link Problems

We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, {\sc unknotting problem} is in {\bf NP}. We also consider the problem, {\sc unknotting problem} of determining whether two or more such polygons can be split, or continuously deformed without self-intersection so that they occupy both sides of a plane without intersecting it. We show that it also is in NP. Finally, we show that the problem of determining the genus of a polygonal knot (a generalization of the problem of determining whether it is unknotted) is in {\bf PSPACE}. We also give exponential worst-case running time bounds for deterministic algorithms to solve each of these problems. These algorithms are based on the use of normal surfaces and decision procedures due to W. Haken, with recent extensions by W. Jaco and J. L. Tollefson.

math.GT↗

The number of Reidemeister Moves Needed for Unknotting

There is a positive constant $c_1$ such that for any diagram $D$ representing the unknot, there is a sequence of at most $2^{c_1 n}$ Reidemeister moves that will convert it to a trivial knot diagram, $n$ is the number of crossings in $D$. A similar result holds for elementary moves on a polygonal knot $K$ embedded in the 1-skeleton of the interior of a compact, orientable, triangulated $PL$ 3-manifold $M$. There is a positive constant $c_2$ such that for each $t \geq 1$, if $M$ consists of $t$ tetrahedra, and $K$ is unknotted, then there is a sequence of at most $2^{c_2 t}$ elementary moves in $M$ which transforms $K$ to a triangle contained inside one tetrahedron of $M$. We obtain explicit values for $c_1$ and $c_2$.

math.GT↗

Simple Closed Geodesics in Hyperbolic 3-Manifolds

This paper determines which orientable hyperbolic 3-manifolds contain simple closed geodesics. The Fuchsian group corresponding to the thrice-punctured sphere generates the only example of a complete non-elementary orientable hyperbolic 3-manifold that does not contain a simple closed geodesic. We do not assume that the manifold is geometrically finite or that it has finitely generated fundamental group.

math.GT↗