English
Related papers

Related papers: On a computer recognition of 3-manifolds

200 papers

We prove a finiteness result for the $\partial$-patterned guts decomposition of all 3-manifolds obtained by splitting a given orientable, irreducible and $\partial$-irreducible 3-manifold along a closed incompressible surface. Then using…

Geometric Topology · Mathematics 2011-06-01 Michel Boileau , J. Hyam Rubinstein , Shicheng Wang

Heegaard splittings provide a natural representation of closed 3-manifolds by gluing two handlebodies along a common surface. These splittings can be equivalently given by two finite sets of meridians lying on the surface, which define a…

Computational Geometry · Computer Science 2026-01-01 Henrique Ennes , Clément Maria

In this work we ask when a group is a 3-manifold group, or more specifically, when does a group presentation come naturally from a Heegaard diagram for a 3-manifold? We will give some conditions for partial answers to this form of the…

Geometric Topology · Mathematics 2016-11-25 Karoline P. Null

We describe the images of multilinear polynomials of arbitrary degree evaluated on the $3\times 3$ upper triangular matrix algebra over an infinite field.

Rings and Algebras · Mathematics 2022-08-09 Thiago Castilho de Mello

Despite high-dimensionality of images, the sets of images of 3D objects have long been hypothesized to form low-dimensional manifolds. What is the nature of such manifolds? How do they differ across objects and object classes? Answering…

Computer Vision and Pattern Recognition · Computer Science 2025-03-11 Benjamin Beaudett , Shenyuan Liang , Anuj Srivastava

Many proposed applications of neural networks in machine learning, cognitive/brain science, and society hinge on the feasibility of inner interpretability via circuit discovery. This calls for empirical and theoretical explorations of…

Artificial Intelligence · Computer Science 2025-04-02 Federico Adolfi , Martina G. Vilas , Todd Wareham

Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing…

General Relativity and Quantum Cosmology · Physics 2007-05-23 James R. van Meter

Starting with the irreducible triangulations of a fixed surface and splitting vertices, all the triangulations of the surface up to a given number of vertices can be generated. The irreducible triangulations have previously been determined…

Combinatorics · Mathematics 2007-05-23 Thom Sulanke

We introduce the concept of pseudo-trisections of smooth oriented compact 4-manifolds with boundary. The main feature of pseudo-trisections is that they have lower complexity than relative trisections for given 4-manifolds. We prove…

Geometric Topology · Mathematics 2025-02-19 Shintaro Fushida-Hardy

Let M be a (possibly non-orientable) compact 3-manifold with (possibly empty) boundary consisting of tori and Klein bottles. Let $X\subset\partial M$ be a trivalent graph such that $\partial M\setminus X$ is a union of one disc for each…

Geometric Topology · Mathematics 2007-05-23 Bruno Martelli , Carlo Petronio

We consider threefolds that admit a fibration by K3 surfaces over a nonsingular curve, equipped with a divisorial sheaf that defines a polarisation of degree two on the general fibre. Under certain assumptions on the threefold we show that…

Algebraic Geometry · Mathematics 2019-08-15 Alan Thompson

In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of boundary is given either as a list of…

Complex Variables · Mathematics 2007-05-23 Ilia Binder , Mark Braverman , Michael Yampolsky

We describe an algorithm to subdivide automatically a given set of PL n-manifolds (via coloured triangulations or, equivalently, via crystallizations) into classes whose elements are PL-homeomorphic. The algorithm, implemented in the case…

Geometric Topology · Mathematics 2017-12-18 M. R. Casali , P. Cristofori

In this note, we discuss embeddings of $3$--manifolds via open books. First we show that every open book of every closed orientable $3$--manifold admits an open book embedding in any open book decompistion of $S^2 \times S^3$ and $S^2…

Geometric Topology · Mathematics 2018-09-12 Dishant M. Pancholi , Suhas Pandit , Kuldeep Saha

We consider mirror symmetry for Fano manifolds, and describe how one can recover the classification of 3-dimensional Fano manifolds from the study of their mirrors. We sketch a program to classify 4-dimensional Fano manifolds using these…

Algebraic Geometry · Mathematics 2021-06-02 Tom Coates , Alessio Corti , Sergey Galkin , Vasily Golyshev , Alexander Kasprzyk

After surveying existing proofs that every closed, orientable 3-manifold is parallelizable, we give three proofs using minimal background. In particular, our proofs use neither spin structures nor the theory of Stiefel-Whitney classes.

Geometric Topology · Mathematics 2018-08-07 Riccardo Benedetti , Paolo Lisca

Suppose that the 3-manifold M is given by integral surgery along a link L in S^3. In the following we construct a stable map from M to the plane, whose singular set is canonically oriented. We obtain upper bounds for the minimal numbers of…

Geometric Topology · Mathematics 2015-03-20 Boldizsar Kalmar , Andras I. Stipsicz

The Recognition Theorem for graded Lie algebras is an essential ingredient in the classification of finite-dimensional simple Lie algebras over an algebraically closed field of characteristic p > 3. The main goal of this monograph is to…

Rings and Algebras · Mathematics 2007-05-23 Georgia Benkart , Thomas Gregory , Alexander Premet

Cosymplectic and normal almost contact structures are analogues of symplectic and complex structures that can be defined on 3-manifolds. Their existence imposes strong topological constraints. Generalized geometry offers a natural common…

Differential Geometry · Mathematics 2026-05-21 Joan Porti , Roberto Rubio

We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…

Logic in Computer Science · Computer Science 2015-07-01 Guillaume Bonfante , Yves Guiraud