English
Related papers

Related papers: $\partial$-reducible handle additions

200 papers

We develop Teichmuller theoretical methods to construct new minimal surfaces in $\BE^3$ by adding handles and planar ends to existing minimal surfaces in $\BE^3$. We exhibit this method on an interesting class of minimal surfaces which are…

Differential Geometry · Mathematics 2009-09-25 Matthias Weber , Michael Wolf

We show that the number of stabilizations needed to interchange the handlebodies of a Heegaard splitting of a closed 3-manifold by an isotopy is bounded below by the smaller of twice its genus or half its Hempel distance. This is a…

Geometric Topology · Mathematics 2008-05-30 Jesse Johnson

A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…

Logic · Mathematics 2019-09-27 Nikolay Bazhenov , Manat Mustafa , Luca San Mauro , Mars Yamaleev

We have found the minimal difference $\Delta(k) = \min\limits_P (f_{d-1}(P) - f_{0}(P))$ between the number of facets and the number of vertices of a $k$-neighborly $d$-polytope $P$ for the case $f_{0}(P) = d+3$: $\Delta(2) = 4$, $\Delta(3)…

Combinatorics · Mathematics 2018-08-27 Aleksandr Maksimenko

We show that the number of partial triangulations of a set of $n$ points on the plane is at least the $(n-2)$-nd Catalan number. This is tight for convex $n$-gons. We also describe all the equality cases.

Combinatorics · Mathematics 2021-04-14 Andrey Kupavskii , Aleksei Volostnov , Yury Yarovikov

For almost all Riemannian metrics (in the $C^\infty$ Baire sense) on a compact manifold with boundary $(M^{n+1},\partial M)$, $3\leq (n + 1)\leq 7$, we prove that, for any open subset $V$ of $\partial M$, there exists a compact, properly…

Differential Geometry · Mathematics 2019-09-05 Zhichao Wang

Let $G$ be a finite group and let $\mathcal{M}$ be a set of maximal subgroups of $G$. We say that $\mathcal{M}$ is irredundant if the intersection of the subgroups in $\mathcal{M}$ is not equal to the intersection of any proper subset. The…

Group Theory · Mathematics 2019-11-11 Timothy C. Burness , Martino Garonzi , Andrea Lucchini

We study several natural instances of the geometric hitting set problem for input consisting of sets of line segments (and rays, lines) having a small number of distinct slopes. These problems model path monitoring (e.g., on road networks)…

Computational Geometry · Computer Science 2016-12-20 Sándor P. Fekete , Kan Huang , Joseph S. B. Mitchell , Ojas Parekh , Cynthia A. Phillips

We solve a certain case of the minimal genus problem for embedded surfaces in elliptic 4-manifolds. The proofs involve a restricted transitivity property of the action of the orientation preserving diffeomorphism group on the second…

Geometric Topology · Mathematics 2019-03-05 M. J. D. Hamilton

Suppose that $M$ is a $2$-dimensional oriented Riemannian manifold, and let $\gamma$ be a simple closed curve on $M$. Let $m \gamma$ denote the curve formed by tracing $\gamma$ $m$ times. We prove that if $m \gamma$ is contractible through…

Differential Geometry · Mathematics 2015-10-14 Gregory R. Chambers , Yevgeny Liokumovich

It is well known that a three dimensional (closed, connected and compact) manifold is obtained by identifying boundary faces from a polyhedron P. The study of (\partial P)/~, the boundary \partial P with the polygonal faces identified in…

General Mathematics · Mathematics 2007-05-23 Sergey Nikitin

We define a trisection of a closed, orientable three dimensional manifold into three handlebodies, and a notion of stabilization for these trisections. Several examples of trisections are described in detail. We define the trisection genus…

Geometric Topology · Mathematics 2018-06-13 Dale Koenig

Let $X$ be a minimal projective 3-fold of general type. The pluricanonical section index $\delta(X)$ is defined to be the minimal integer $m$ so that $P_{m}(X)\geq 2$. According to Chen-Chen, one has either $1\leq \delta(X)\leq 15$ or…

Algebraic Geometry · Mathematics 2017-06-06 Meng Chen

We show that every orthogonal polyhedron of genus at most 2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges). This is the first result on unfolding general orthogonal…

Computational Geometry · Computer Science 2016-11-02 Mirela Damian , Erik Demaine , Robin Flatland , Joseph O'Rourke

Let M be a connected orientable 3-manifold, and F a compact connected orientable surface properly embedded in M. If F cuts M into two connected 3-manifolds X and Y, that is, M=X \cup_F Y, we say that M is an amalgamation of X and Y along F;…

Geometric Topology · Mathematics 2025-05-29 Siqi Ding , Fengchun Lei , Wei Lin , Andrei Vesnin

It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct edge-slopes in such a drawing of a planar…

In this paper, we prove that if a quasi-Fuchsian 3-manifold $M$ contains a simple closed geodesic with complex length $\Lscr=l+i\theta$ such that $\theta/l\gg{}1$, then it contains at least two minimal surfaces which are incompressible in…

Differential Geometry · Mathematics 2009-03-31 Biao Wang

Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.

Combinatorics · Mathematics 2017-09-19 Ferran Hurtado , Eduardo Rivera-Campo

Let X be a minuscule Schubert variety and $\alpha$ a class of 1-cycle on X. In this article we describe the irreducible components of the scheme of morphisms of class $\alpha$ from a rational curve to X. The irreducible components are…

Algebraic Geometry · Mathematics 2007-05-23 Nicolas Perrin

Given a set $P$ of $n$ points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate $n$ points, picked randomly…

Computational Geometry · Computer Science 2017-06-08 Sariel Har-Peled , Mitchell Jones