English
Related papers

Related papers: $Z$-knotted and $Z$-homogeneous triangulations of …

200 papers

The main objects of the paper are $z$-oriented triangulations of connected closed $2$-dimensional surfaces. A $z$-orientation of a map is a minimal collection of zigzags which double covers the set of edges. We have two possibilities for an…

Combinatorics · Mathematics 2020-02-07 Adam Tyc

We investigate zigzags in triangulations of connected closed $2$-dimensional surfaces and show that there is a one-to-one correspondence between triangulations with homogeneous zigzags and closed $2$-cell embeddings of directed Eulerian…

Combinatorics · Mathematics 2019-03-01 Mariusz Kwiatkowski , Mark Pankov , Adam Tyc

A zigzag in a map (a $2$-cell embedding of a connected graph in a connected closed $2$-dimensional surface) is a cyclic sequence of edges satisfying the following conditions: 1) any two consecutive edges lie on the same face and have a…

Combinatorics · Mathematics 2019-04-04 Mark Pankov , Adam Tyc

An embedded graph is called $z$-knotted if it contains the unique zigzag (up to reversing). We consider $z$-knotted triangulations, i.e. $z$-knotted embedded graphs whose faces are triangles, and describe all cases when the connected sum of…

Combinatorics · Mathematics 2017-08-15 Mark Pankov , Adam Tyc

Let $\Gamma$ be a triangulation of a connected closed $2$-dimensional (not necessarily orientable) surface. Using zigzags (closed left-right paths), for every face of $\Gamma$ we define the $z$-monodromy which acts on the oriented edges of…

Combinatorics · Mathematics 2018-11-06 Mark Pankov , Adam Tyc

We consider triangulations of closed $2$-dimensional (not necessarily orientable) surfaces. Any minimal set of zigzags that double covers the set of edges provides a $z$-orientation of the triangulation. We introduce Markov chains of…

Combinatorics · Mathematics 2026-01-27 Adam Tyc

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

Zigzags in graphs embedded in surfaces are cyclic sequences of edges whose any two consecutive edges are different, have a common vertex and belong to the same face. We investigate zigzags in randomly constructed combinatorial tetrahedral…

Combinatorics · Mathematics 2022-06-22 Adam Tyc

A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal faces, such that any hexagon is adjacent to its neighbors on…

Geometric Topology · Mathematics 2007-05-23 M. Deza , M. Dutour

A triangulation of a punctured or pinched surface is irreducible if no edge can be shrunk without producing multiple edges or changing the topological type of the surface. The finiteness of the set of (non-isomorphic) irreducible…

Combinatorics · Mathematics 2013-06-04 M. J. Chávez , S. Lawrencenko , A. Quintero , M. T. Villar

A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex while remaining in the category of simplicial complexes and preserving the topology of the surface. A complete list of…

Combinatorics · Mathematics 2021-03-09 S. Lawrencenko , T. Sulanke , M. T. Villar , L. V. Zgonnik , M. J. Chávez , J. R. Portillo

Meier and Zupan showed that every surface in the four-sphere admits a bridge trisection and can therefore be represented by three simple tangles. This raises the possibility of applying methods from link homology to knotted surfaces. We use…

Geometric Topology · Mathematics 2019-09-20 Adam Saltz

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

We show that any surface of infinite type admits an ideal triangulation. Furthermore, we show that a set of disjoint arcs can be completed into a triangulation if and only if, as a set, they intersect every simple closed curve a finite…

Geometric Topology · Mathematics 2021-02-19 Alan McLeay , Hugo Parlier

Tight triangulated manifolds are generalisations of neighborly triangulations of closed surfaces and are interesting objects in Combinatorial Topology. Tight triangulated manifolds are conjectured to be minimal. Except few, all the known…

Geometric Topology · Mathematics 2015-06-02 Basudeb Datta

The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of…

Combinatorics · Mathematics 2007-05-23 Thom Sulanke

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a…

Computational Geometry · Computer Science 2019-12-11 Vincent Despré , Jean-Marc Schlenker , Monique Teillaud

Squeezed knots are those knots that appear as slices of genus-minimizing oriented smooth cobordisms between positive and negative torus knots. We show that this class of knots is large and discuss how to obstruct squeezedness. The most…

Geometric Topology · Mathematics 2025-11-27 Peter Feller , Lukas Lewark , Andrew Lobb

We consider whether any two triangulations of a polygon or a point set on a non-planar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some remarkable…

Metric Geometry · Mathematics 2010-08-02 C. Cortes , C. I. Grima , F. Hurtado , A. Marquez , F. Santos , J. Valenzuela

A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…

Combinatorics · Mathematics 2017-11-06 Basudeb Datta , Subhojoy Gupta
‹ Prev 1 2 3 10 Next ›