English
Related papers

Related papers: Algorithms in 3-manifold theory

200 papers

We count the number of conjugacy classes of maximal, genus g, surface subroups in hyperbolic 3-manifold groups. For any closed hyperbolic 3-manifold, we show that there is an upper bound on this number which grows factorially with g. We…

Geometric Topology · Mathematics 2014-10-01 Joseph D. Masters

We prove that the problem of deciding whether a 2- or 3-dimensional simplicial complex embeds into $\mathbb{R}^3$ is NP-hard. Our construction also shows that deciding whether a 3-manifold with boundary tori admits an $\mathbb{S}^{3}$…

Geometric Topology · Mathematics 2018-08-23 Arnaud de Mesmay , Yo'av Rieck , Eric Sedgwick , Martin Tancer

In this paper we provide the first examples of arithmetic hyperbolic 3-manifolds that are rational homology spheres and bound geometrically either compact or cusped hyperbolic 4-manifolds.

Geometric Topology · Mathematics 2022-05-11 Leonardo Ferrari , Alexander Kolpakov , Alan W. Reid

Let M be a closed hyperbolic three manifold. We construct closed surfaces which map by immersions into M so that for each one the corresponding mapping on the universal covering spaces is an embedding, or, in other words, the corresponding…

Geometric Topology · Mathematics 2015-03-13 Jeremy Kahn , Vladimir Markovic

The past century has seen a steady increase in the need of estimating and predicting complex systems and making (possibly critical) decisions with limited information. Although computers have made possible the numerical evaluation of…

Statistics Theory · Mathematics 2017-01-13 Houman Owhadi , Clint Scovel

We extend to the context of hyperbolic 3-manifolds with geodesic boundary Thurston's approach to hyperbolization by means of geometric triangulations. In particular, we introduce moduli for (partially) truncated hyperbolic tetrahedra, and…

Geometric Topology · Mathematics 2007-05-23 R. Frigerio , C. Petronio

We settle two problems of reconstructing a biholomorphic type of a manifold. In the first problem we use graphs associated to Riemann surfaces of a particular class. In the second one we use the semigroup structure of analytic endomorphisms…

Complex Variables · Mathematics 2013-05-23 Sergei Merenkov

Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…

Algebraic Geometry · Mathematics 2015-04-24 Daniel Plaumann , Rainer Sinn , David E. Speyer , Cynthia Vinzant

We prove the convex combination theorem for hyperbolic n-manifolds. Applications are given both in high dimensions and in 3 dimensions. One consequence is that given two geometrically finite subgroups of a discrete group of isometries of…

Geometric Topology · Mathematics 2014-02-26 Mark Baker , Daryl Cooper

The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…

Group Theory · Mathematics 2025-06-18 Vladimir Shpilrain

We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms for computing the Betti numbers of semi-algebraic sets. Aside from…

Geometric Topology · Mathematics 2007-09-17 Saugata Basu

Hypergraphs, which belong to the family of higher-order networks, are a natural and powerful choice for modeling group interactions in the real world. For example, when modeling collaboration networks, which may involve not just two but…

Social and Information Networks · Computer Science 2025-02-19 Geon Lee , Fanchen Bu , Tina Eliassi-Rad , Kijung Shin

Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…

Group Theory · Mathematics 2025-05-06 Attila Egri-Nagy , Chrystopher L. Nehaniv

We suggest a new approach to the study of relatively hyperbolic groups based on relative isoperimetric inequalities. Various geometric, algebraic, and algorithmic properties are discussed.

Group Theory · Mathematics 2015-01-29 D. V. Osin

Let $M$ be a non-compact hyperbolic $3$-manifold with finite volume and totally geodesic boundary components. By subdividing mixed ideal polyhedral decompositions of $M$, under some certain topological conditions, we prove that $M$ has an…

Geometric Topology · Mathematics 2024-08-27 Ge Huabin , Jia Longsong , Zhang Faze

We prove that under some assumptions on how points escape to infinity in the universal cover, homeomorphisms of hyperbolic 3-manifolds are forced to have several invariant sets (in particular, they cannot be minimal). For this, we use some…

Dynamical Systems · Mathematics 2026-02-23 Elena Gomes , Santiago Martinchich , Rafael Potrie

This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a…

Algebraic Topology · Mathematics 2007-05-23 Michael Joswig

Homology features of spaces which appear in applications, for instance 3D meshes, are among the most important topological properties of these objects. Given a non-trivial cycle in a homology class, we consider the problem of computing a…

Computational Geometry · Computer Science 2022-03-18 Erin Wolf Chambers , Salman Parsa , Hannah Schreiber

This is a survey of the geometry of complex cubic fourfolds with a view toward rationality questions. Topics include classical constructions of rational examples, Hodge structures and special cubic fourfolds, associated K3 surfaces and…

Algebraic Geometry · Mathematics 2016-07-19 Brendan Hassett

3-manifolds are commonly represented as triangulations, consisting of abstract tetrahedra whose triangular faces are identified in pairs. The combinatorial sparsity of a triangulation, as measured by the treewidth of its dual graph, plays a…

Computational Geometry · Computer Science 2026-03-13 Kristóf Huszár , Clément Maria