English
Related papers

Related papers: Non-zero degree maps between closed orientable thr…

200 papers

We present a practical algorithm to test whether a 3-manifold given by a triangulation or an ideal triangulation contains a closed essential surface. This property has important theoretical and algorithmic consequences. As a testament to…

Geometric Topology · Mathematics 2025-07-01 Benjamin A. Burton , Stephan Tillmann

We give examples of closed orientable graph 3-manifolds with fundamental group which is not a subgroup of GL(4,k) for any field k. This answers a question in the Kirby problem list from 1977 which is credited to the late William Thurston.

Geometric Topology · Mathematics 2012-10-12 J. O. Button

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

We study the existence of geometrically controlled branched covering maps from $\mathbb R^3$ to open $3$-manifolds or to decomposition spaces $\mathbb S^3/G$, and from $\mathbb S^3/G$ to $\mathbb S^3$.

Complex Variables · Mathematics 2013-11-01 Pekka Pankka , Kai Rajala , Jang-Mei Wu

A graph is said to be well-edge-dominated if all its minimal edge dominating sets are minimum. It is known that every well-edge-dominated graph $G$ is also equimatchable, meaning that every maximal matching in $G$ is maximum. In this paper,…

Combinatorics · Mathematics 2021-10-15 Sarah E. Anderson , Kirsti Kuenzel , Douglas F. Rall

In this paper we consider two connected closed Haken manifolds denoted by M^3 and N^3, with the same Gromov simplicial volume. We give a simple homological criterion to decide when a given map f: M^3-->N^3 between M^3 and N^3 can be changed…

Geometric Topology · Mathematics 2014-10-01 Pierre Derbez

A set S of vertices in a graph G is a dominating set of G if every vertex not in S is adjacent to a vertex in S . The domination number of G, denoted by $\gamma$(G), is the minimum cardinality of a dominating set in G. In a breakthrough…

Discrete Mathematics · Computer Science 2024-10-07 Paul Dorbec , Michael Antony Henning

We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n+O(n/g)<3n/10+O(n/g).

Combinatorics · Mathematics 2009-07-08 Daniel Kral , Petr Skoda , Jan Volec

We find conditions which ensure that the topological complexity of a closed manifold $M$ with abelian fundamental group is nonmaximal, and see through examples that our conditions are sharp. This generalizes results of Costa and Farber on…

Algebraic Topology · Mathematics 2021-09-10 Daniel C. Cohen , Lucile Vandembroucq

Let $Crit M$ denote the minimal number of critical points (not necessarily non-degenerate) on a closed smooth manifold $M$. We are interested in the evaluation of $Crit$. It is worth noting that we do not know yet whether $Crit M$ is a…

Geometric Topology · Mathematics 2023-11-16 Deep Kundu , Yuli B. Rudyak

We discuss the rigidity (or lack thereof) imposed by different notions of having an abundance of zero curvature planes on a complete Riemannian 3-manifold. We prove a rank rigidity theorem for complete 3-manifolds, showing that having…

Differential Geometry · Mathematics 2017-12-29 Renato G. Bettiol , Benjamin Schmidt

A 3-manifold is Haken if it contains a topologically essential surface. The Virtual Haken Conjecture posits that every irreducible 3-manifold with infinite fundamental group has a finite cover which is Haken. In this paper, we study random…

Geometric Topology · Mathematics 2009-11-11 Nathan M. Dunfield , William P. Thurston

The work of Jorgensen and Thurston shows that there is a finite number N(v) of orientable hyperbolic 3-manifolds with any given volume v. We show that there is an infinite sequence of closed orientable hyperbolic 3-manifolds, obtained by…

Geometric Topology · Mathematics 2012-03-30 Craig Hodgson , Hidetoshi Masai

We establish a correspondence between trisections of smooth, compact, oriented $4$--manifolds with connected boundary and diagrams describing these trisected $4$--manifolds. Such a diagram comes in the form of a compact, oriented surface…

Geometric Topology · Mathematics 2017-07-27 Nickolas A. Castro , David T. Gay , Juanita Pinzón-Caicedo

This paper gives necessary and sufficient conditions on a compact, connected, orientable 3-manifold M for it to contain a knot K such that M-K is irreducible and pi_1(M) embeds in pi_1(M-K). This result provides counterexamples to a…

Geometric Topology · Mathematics 2007-05-23 Robert Myers

Matveev and Piergallini independently showed that, with a small number of known exceptions, any triangulation of a three-manifold can be transformed into any other triangulation of the same three-manifold with the same number of vertices,…

Geometric Topology · Mathematics 2016-09-21 Henry Segerman

The Nielsen Conjecture for Homeomorphisms asserts that any homeomorphism $f$ of a closed manifold is isotopic to a map realizing the Nielsen number of $f$, which is a lower bound for the number of fixed points among all maps homotopic to…

Geometric Topology · Mathematics 2016-09-06 Boju Jiang , Shicheng Wang , Ying-Qing Wu

In short geometrization conjecture of W.\,Thurston (finally proved by G.~Perelman) says that any oriented $3$-manifold can be canonically partitioned into pieces, which have a geometric structure of one of the eight types. In the seminal…

Geometric Topology · Mathematics 2021-08-06 Nikolai Erokhovets

We classify closed, conformally flat Lorentzian manifolds of dimension $n \geq 3$ with unipotent holonomy in PO(2,n). They are all Kleinian and fall into four different geometric types according to the intersection of the image of the…

Differential Geometry · Mathematics 2024-05-15 Rachel Lee , Karin Melnick

Given a set $F$ of oriented graphs, a graph $G$ is an $F$-graph if it admits an $F$-free orientation. Building on previous work by Bang-Jensen and Urrutia, we propose a master algorithm that determines if a graph admits an $F$-free…

Combinatorics · Mathematics 2023-01-16 Santiago Guzmán-Pro , César Hernández-Cruz