English
Related papers

Related papers: Random collapsibility and 3-sphere recognition

200 papers

In this thesis, we use normal surface theory to understand certain properties of minimal triangulations of compact orientable 3-manifolds. We describe the collapsing process of normal 2-spheres and disks. Using some geometrical…

Geometric Topology · Mathematics 2009-09-29 Alexander Barchechat

The search for universality in random triangulations of manifolds, like those featuring in (Euclidean) Dynamical Triangulations, is central to the random geometry approach to quantum gravity. In case of the 3-sphere, or any other manifold…

Combinatorics · Mathematics 2022-03-31 Timothy Budd , Luca Lionni

1) We introduce random discrete Morse theory as a computational scheme to measure the complicatedness of a triangulation. The idea is to try to quantify the frequence of discrete Morse matchings with a certain number of critical cells. Our…

Computational Geometry · Computer Science 2014-04-21 Bruno Benedetti , Frank H. Lutz

Let $M$ be an $n$-vertex combinatorial triangulation of a $\ZZ_2$-homology $d$-sphere. In this paper we prove that if $n \leq d + 8$ then $M$ must be a combinatorial sphere. Further, if $n = d + 9$ and $M$ is not a combinatorial sphere then…

Geometric Topology · Mathematics 2012-05-29 Bhaskar Bagchi , Basudeb Datta

It is important to have fast and effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex…

Geometric Topology · Mathematics 2011-06-16 Benjamin A. Burton

We obtain a geometric realization of a minimal 8-vertex triangulation of the dunce hat in Euclidean 3-space. We show there is a simplicial 3-ball with 8 vertices that is collapsible, but also collapses onto the dunce hat, which is not…

Algebraic Topology · Mathematics 2013-02-04 Bruno Benedetti , Frank H. Lutz

We show that the following algorithmic problem is decidable: given a $2$-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in $\mathbf{R}^3$? By a known reduction, it suffices to decide…

Geometric Topology · Mathematics 2014-02-06 Jiří Matoušek , Eric Sedgwick , Martin Tancer , Uli Wagner

A census is presented of all closed non-orientable 3-manifold triangulations formed from at most seven tetrahedra satisfying the additional constraints of minimality and P^2-irreducibility. The eight different 3-manifolds represented by…

Geometric Topology · Mathematics 2010-12-21 Benjamin A. Burton

One measure of the complexity of a 3-manifold is its triangulation complexity: the minimal number of tetrahedra in a triangulation of it. A natural question is whether we can relate this quantity to its topology. We determine the…

Geometric Topology · Mathematics 2023-01-06 Adele Jackson

After surveying classical notions of PL topology of the Seventies, we clarify the relation between Morse theory and its discretization by Forman. We show that PL handles theory and discrete Morse theory are equivalent, in the sense that…

Geometric Topology · Mathematics 2014-12-11 Bruno Benedetti

The triangulation complexity of a compact 3-manifold is the minimal number of tetrahedra in any triangulation of the 3-manifold. We compute the triangulation complexity of all elliptic 3-manifolds and all sol 3-manifolds, to within a…

Geometric Topology · Mathematics 2022-12-12 Marc Lackenby , Jessica S. Purcell

The triangulation complexity of a closed orientable 3-manifold is the minimal number of tetrahedra in any triangulation of the manifold. The main theorem of the paper gives upper and lower bounds on the triangulation complexity of any…

Geometric Topology · Mathematics 2024-07-24 Marc Lackenby , Jessica S. Purcell

We characterize normal $3$-pseudomanifolds with $g_2\leq4$. We know that if a $3$-pseudomanifold with $g_2\leq4$ does not have any singular vertices then it is a $3$-sphere. We first prove that a normal $3$-pseudomanifold with $g_2\leq4$…

Combinatorics · Mathematics 2022-03-25 Biplab Basak , Raju Kumar Gupta

A typical census of 3-manifolds contains all manifolds (under various constraints) that can be triangulated with at most n tetrahedra. Al- though censuses are useful resources for mathematicians, constructing them is difficult: the best…

Geometric Topology · Mathematics 2019-09-10 Benjamin A. Burton , William Pettersson

It is important to have effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex before we…

Geometric Topology · Mathematics 2011-10-28 Benjamin A. Burton

It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is…

Metric Geometry · Mathematics 2019-02-08 Milica Stojanović

We show that three natural decision problems about links and 3-manifolds are computationally hard, assuming some conjectures in complexity theory. The first problem is determining whether a link in the 3-sphere bounds a Seifert surface with…

Geometric Topology · Mathematics 2017-04-28 Marc Lackenby

In bounding the homology of a manifold, Forman's Discrete Morse theory recovers the full precision of classical Morse theory: Given a PL triangulation of a manifold that admits a Morse function with c_i critical points of index i, we show…

Differential Geometry · Mathematics 2014-07-10 Bruno Benedetti

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…

Combinatorics · Mathematics 2023-06-06 Yixi Liao , Erxiao Wang

In this paper our main result states that there exist exactly three combinatorially distinct centrally-symmetric 12-vertex-triangulations of the product of two 2-spheres with a cyclic symmetry. We also compute the automorphism groups of the…

Combinatorics · Mathematics 2007-05-23 G. Lassmann , E. Sparla
‹ Prev 1 2 3 10 Next ›