pith. sign in

arxiv: 1303.3674 · v1 · pith:KA4CAUTMnew · submitted 2013-03-15 · 🧮 math.CO

A characterization of triangulations of closed surfaces

classification 🧮 math.CO
keywords closedfiniteintersectionmatrixtriangulationcharacterizationcompletelyconnected
0
0 comments X
read the original 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}))_{0\leq i,0\leq j}^{n-1}$, where $K_{2}=\{s_{0}, \ldots s_{n-1}\}$ is a labelling of the triangles of $K$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.