A characterization of triangulations of closed surfaces

zbMATH Open1301.52027arXiv1303.3674MaRDI QIDQ5419969FDOQ5419969

Authors: Javier Bracho, Isabel Hubard, Jorge L. Arocha, Natalia García-Colín 

Publication date: 11 June 2014

Abstract: In this paper we prove that a finite triangulation of a connected closed surface is completely determined by its intersection matrix. The emph{intersection matrix} of a finite triangulation, $K$, is defined as $M_K=(dim(s_{i}cap{s}_j){)}_{0leqi,0leqj}^{n-1}$, where $K_2=s_0,ldots{s}_{n-1}$ is a labelling of the triangles of $K$.

Full work available at URL: https://arxiv.org/abs/1303.3674

Recommendations

• Reconstructing surface triangulations by their intersection matrices
• Gewisse einfache Polytope sind durch ihren Graph eindeutig bestimmt. (Certain simple polytopes are uniquely determined by their graphs)
• A simple way to tell a simple polytope from its graph
• Examples and counterexamples for the Perles conjecture
• scientific article; zbMATH DE number 1538125

zbMATH Keywords

simplicial complextriangulation

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Combinatorial aspects of simplicial complexes (05E45)

Cited In (8)

• Infinite series of triangulations on closed surfaces with vertex covers of given degree
• A local characterization for perfect plane near-triangulations
• Title not available (Why is that?)
• Title not available (Why is that?)
• On triangulations of surfaces
• Reconstructing surface triangulations by their intersection matrices
• Tight and untight triangulations of surfaces by complete graphs
• The approximation of closed manifolds by triangulated manifolds and the triangulation of closed manifolds

This page was built for publication: A characterization of triangulations of closed surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419969)