English
Related papers

Related papers: The size of triangulations supporting a given link

200 papers

Given an special type of triangulation $T$ for an oriented closed 3-manifold $M^3$ we produce a framed link in $S^3$ which induces the same $M^3$ by an algorithm of complexity $O(n^2)$ where $n$ is the number of tetrahedra in $T$ . The…

Geometric Topology · Mathematics 2013-02-21 Sóstenes Lins , Ricardo Machado

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

It is conjectured that every cusped hyperbolic 3-manifold admits a geometric triangulation, i.e. it is decomposed into positive volume ideal hyperbolic tetrahedra. Here, we show that sufficiently highly twisted knots admit a geometric…

Geometric Topology · Mathematics 2023-06-14 Sophie L. Ham , Jessica S. Purcell

A {\em $1-$vertex triangulation} of an oriented compact surface $S$ of genus $g$ is an embedded graph $T\subset S$ with a unique vertex such that all connected components of $S\setminus T$ are triangles (adjacent to exactly 3 edges of $T$).…

Combinatorics · Mathematics 2007-05-23 Roland Bacher , Alina Vdovina

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

Given a compact oriented triangulated $3$-manifold we find a non-trivial condition satisfied by certain labelings of the tetrahedra by elements of an arbitrary abelian group which we call angle structures. Smoothness of the manifold is used…

Geometric Topology · Mathematics 2020-11-25 Anton Mellit

Let X^{circ} be the space of all labeled tetrahedra in P^{3}. In [BGS] we constructed a smooth symmetric compactification X-tilde of X^{circ}. In this article we show that the complement X-tilde smallsetminus X^{circ} is a divisor with…

Algebraic Geometry · Mathematics 2007-05-23 Eric Babson , Paul E. Gunnells , Richard Scott

We consider the problem of minimising the number of edges that are contained in triangles, among $n$-vertex graphs with a given number of edges. We prove a conjecture of F\"uredi and Maleki that gives an exact formula for this minimum, for…

Combinatorics · Mathematics 2016-05-03 Vytautas Gruslys , Shoham Letzter

By using a suitable triple cover we show how to possibly model the construction of a minimal surface with positive genus spanning all six edges of a tetrahedron, working in the space of BV functions and interpreting the film as the boundary…

Geometric Topology · Mathematics 2017-07-06 Giovanni Bellettini , Maurizio Paolini , Franco Pasquarelli

A diagonal surface in a link exterior M is a properly embedded, incompressible, boundary incompressible surface which furthermore has the same number of boundary components and same slope on each component of the boundary of M. We derive a…

Geometric Topology · Mathematics 2007-05-23 Jim E. Hoste , Patrick D. Shanahan

This paper introduces even triangulations of n-dimensional pseudo-manifolds and links their combinatorics to the topology of the pseudo-manifolds. This is done via normal hypersurface theory and the study of certain symmetric…

Geometric Topology · Mathematics 2015-11-25 J. Hyam Rubinstein , Stephan Tillmann

We often rely on censuses of triangulations to guide our intuition in $3$-manifold topology. However, this can lead to misplaced faith in conjectures if the smallest counterexamples are too large to appear in our census. Since the number of…

Geometric Topology · Mathematics 2024-03-08 Benjamin A. Burton , Alexander He

In this paper, we introduce the notion of a t-norm on bounded pseudo-ordered sets and in particular on bounded trellises (also known as weakly associative lattices), and provide some basic examples. The impact of abandoning transitivity is…

Rings and Algebras · Mathematics 2023-01-05 Lemnaouar Zedam , Bernard De Baets

Hyperideal tetrahedra are the fundamental building blocks of hyperbolic 3-manifolds with geodesic boundary. The study of their geometric properties (in particular, of their volume) has applications also in other areas of low-dimensional…

Geometric Topology · Mathematics 2019-04-12 Roberto Frigerio , Marco Moraschini

We prove that for any knot $K$, there exists a one-vertex triangulation of the $3$-sphere containing an edge forming $K$. The proof is constructive, and based on fully augmented links. We use our method to produce ``complicated'' simplicial…

Geometric Topology · Mathematics 2024-12-02 Dionne Ibarra , Daniel V. Mathews , Jessica S. Purcell , Jonathan Spreer

In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…

Combinatorics · Mathematics 2007-05-23 Frank H. Lutz

We study lower bounds for the number of vertices in a PL-triangulation of a given manifold $M$. While most of the previous estimates are based on the dimension and the connectivity of $M$, we show that further information can be extracted…

Geometric Topology · Mathematics 2018-01-17 Petar Pavešić

We show that if a knot or link has n thin levels when put in thin position then its exterior contains a collection of n disjoint, non-parallel, planar, meridional, essential surfaces. A corollary is that there are at least n/3 tetrahedra in…

Geometric Topology · Mathematics 2007-05-23 David Bachman

A new lower bound on the complexity of a 3-manifold is given using the Z2-Thurston norm. This bound is shown to be sharp, and the minimal triangulations realising it are characterised using normal surfaces consisting entirely of…

Geometric Topology · Mathematics 2009-06-29 William Jaco , J. Hyam Rubinstein , Stephan Tillmann

We show that the size of a 4-critical graph of girth at least five is bounded by a linear function of its genus. This strengthens the previous bound on the size of such graphs given by Thomassen. It also serves as the basic case for the…

Combinatorics · Mathematics 2019-04-17 Zdeněk Dvořák , Daniel Kráľ , Robin Thomas
‹ Prev 1 4 5 6 7 8 10 Next ›