English
Related papers

Related papers: Trisecting a 4-dimensional book into three chapter…

200 papers

This book is addressed to students, professors and researchers of geometry, who will find herein many interesting and original results. The originality of the book The Geometry of Homological Triangles consists in using the homology of…

General Mathematics · Mathematics 2012-04-10 Florentin Smarandache , Ion Patrascu

As an application of the construction of open books on plumbed 3-manifolds, we construct elliptic open books on torus bundles over the circle. In certain cases these open books are compatible with Stein fillable contact structures and have…

Geometric Topology · Mathematics 2008-12-01 Tolga Etgü

We introduce the notion of a nested open book, a submanifold equipped with an open book structure compatible with an ambient open book, and describe in detail the special case of a push-off of the binding of an open book. This enables us to…

Geometric Topology · Mathematics 2019-11-04 Sebastian Durst , Mirko Klukas

This is the announcement, and the long summary, of a series of articles on the algorithmic study of Thurston maps. We describe branched coverings of the sphere in terms of group-theoretical objects called bisets, and develop a theory of…

Computational Complexity · Computer Science 2017-06-20 Laurent Bartholdi , Dzmitry Dudko

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

In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…

Computational Geometry · Computer Science 2019-11-20 Alberto Paoluzzi , Vadim Shapiro , Antonio DiCarlo , Francesco Furiani , Giulio Martella , Giorgio Scorzelli

This book on Distributed Computing aims to benefit a diverse audience, ranging from aspiring engineers, and seasoned researchers, to a wide range of professionals. Driven by my passion for making the core concepts of distributed computing…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-11-27 Kenneth Odoh

We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…

Combinatorics · Mathematics 2019-01-30 Gennaro Amendola

We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3-manifolds up to complexity 8. The program can treat also not necessarily closed 3-manifolds of bigger complexities, but here some…

Geometric Topology · Mathematics 2009-09-25 Sergei V. Matveev

A combinatorial presentation of closed orientable 3-manifolds as bi-tricolored links is given together with two versions of a calculus via moves to manipulate bi-tricolored links without changing the represented manifold. That is, we…

Geometric Topology · Mathematics 2007-05-23 Nikos Apostolakis

A connected graph is 4-connected if it contains at least five vertices and removing any three of them does not disconnect it. A frequent preprocessing step in graph drawing is to decompose a plane graph into its 4-connected components and…

Data Structures and Algorithms · Computer Science 2023-08-31 Sabine Cornelsen , Gregor Diatzko

We study the structure induced on a smooth manifold by a continuous selection of smooth functions. In case such selection is suitably generic, it provides a stratification of the manifold, whose strata are algebraically defined smooth…

Geometric Topology · Mathematics 2023-10-09 Eva Horvat

In this paper we generalize previous work on decomposition in three-dimensional orbifolds by 2-groups realized as analogues of central extensions, to orbifolds by more general 2-groups. We describe the computation of such orbifolds in…

High Energy Physics - Theory · Physics 2023-08-23 Alonso Perez-Lona , Eric Sharpe

The problem of decomposing non-manifold object has already been studied in solid modeling. However, the few proposed solutions are limited to the problem of decomposing solids described through their boundaries. In this thesis we study the…

Graphics · Computer Science 2019-04-03 Franco Morando

We show that any smooth, closed, oriented, connected 4--manifold can be trisected into three copies of $\natural^k (S^1 \times B^3)$, intersecting pairwise in 3--dimensional handlebodies, with triple intersection a closed 2--dimensional…

Geometric Topology · Mathematics 2017-01-04 David T. Gay , Robion Kirby

In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new…

Commutative Algebra · Mathematics 2015-05-19 Thomas Bächler , Vladimir Gerdt , Markus Lange-Hegermann , Daniel Robertz

We present new computational methods for proving diffeomorphy of triangulated 4-manifolds, including algorithms and topological software that can for the first time effectively handle the complexities that arise in dimension four and be…

Geometric Topology · Mathematics 2018-10-24 Benjamin A. Burton , Jonathan Spreer

Gay and Kirby introduced trisections which describe any closed oriented smooth 4-manifold $X$ as a union of three four-dimensional handlebodies. A trisection is encoded in a diagram, namely three collections of curves in a closed oriented…

Geometric Topology · Mathematics 2021-06-21 Vincent Florens , Delphine Moussard

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

Computational Geometry · Computer Science 2010-01-21 Erik D. Demaine , David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke

We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…

Symbolic Computation · Computer Science 2011-04-06 Changbo Chen , Marc Moreno Maza