English
Related papers

Related papers: Face enumeration on simplicial complexes

200 papers

In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these…

Geometric Topology · Mathematics 2018-10-24 Benjamin A. Burton , João Paixão , Jonathan Spreer

Let $M$ be a simple 3-manifold, and $F$ be a component of $\partial M$ of genus at least 2. Let $\alpha$ and $\beta$ be separating slopes on $F$. Let $M(\alpha)$ (resp. $M(\beta)$) be the manifold obtained by adding a 2-handle along…

Geometric Topology · Mathematics 2018-10-31 Han Lou , Mingxing Zhang

We prove two results on stacked triangulated manifolds in this paper: (a) every stacked triangulation of a connected manifold with or without boundary is obtained from a simplex or the boundary of a simplex by certain combinatorial…

Geometric Topology · Mathematics 2016-06-16 Basudeb Datta , Satoshi Murai

We define a new combinatorial class of triangulations of closed 3-manifolds, satisfying a weak version of 0-efficiency combined with a weak version of minimality, and study them using twisted squares. As an application, we obtain strong…

Geometric Topology · Mathematics 2015-12-23 Feng Luo , Stephan Tillmann

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…

Combinatorics · Mathematics 2024-01-17 Gunnar Fløystad

We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial identity due to W.T. Tutte.

Combinatorics · Mathematics 2011-11-10 Maxim Krikun

A simplicial complex $\Delta$ is called flag if all minimal nonfaces of $\Delta$ have at most two elements. The following are proved: First, if $\Delta$ is a flag simplicial pseudomanifold of dimension $d-1$, then the graph of $\Delta$ (i)…

Combinatorics · Mathematics 2015-05-13 Christos A. Athanasiadis

We describe an algorithm for the enumeration of (candidates of) vertex-transitive combinatorial $d$-manifolds. With an implementation of our algorithm, we determine, up to combinatorial equivalence, all combinatorial manifolds with a…

Geometric Topology · Mathematics 2007-05-23 Ekkehard G. Köhler , Frank H. Lutz

We investigate slicings of combinatorial manifolds as properly embedded co-dimension 1 submanifolds. A focus is given to dimension 3 where slicings are normal surfaces. In the case of 2-neighborly 3-manifolds and quadrangulated slicings, a…

Combinatorics · Mathematics 2012-03-16 Jonathan Spreer

Fine and Gill (1973) introduced the geometric representation for those comparative probability orders on n atoms that have an underlying probability measure. In this representation every such comparative probability order is represented by…

Combinatorics · Mathematics 2023-08-23 Ilya Chevyrev , Dominic Searles , Arkadii Slinko

In 1962, Tutte provided a formula for the number of combinatorial triangulations, that is, maximal planar graphs with a fixed triangular face and $n$ additional vertices. In this note, we study how many ways a combinatorial triangulation…

Combinatorics · Mathematics 2025-04-25 Belén Cruces , Clemens Huemer , Dolores Lara

It is well-known that the triangulations of the disc with $n+2$ vertices on its boundary are counted by the $n$th Catalan number $C(n)=\frac{1}{n+1}{2n \choose n}$. This paper deals with the generalisation of this problem to any arbitrary…

Combinatorics · Mathematics 2012-03-14 Olivier Bernardi , Juanjo Rué

A numerical characterization is given of the so-called h-triangles of sequentially Cohen-Macaulay simplicial complexes. This result characterizes the number of faces of various dimensions and codimensions in such a complex, generalizing the…

Combinatorics · Mathematics 2017-03-06 Karim A. Adiprasito , Anders Björner , Afshin Goodarzi

We briefly introduce several problems: (1) a generalization of the convex fair partition conjecture, (2) on non-trivial invariants among polyhedrons that can be formed from the same set of face polygons, (3) two questions on assembling…

Metric Geometry · Mathematics 2015-02-16 R. Nandakumar

A census is presented of all closed non-orientable 3-manifold triangulations formed from at most seven tetrahedra satisfying the additional constraints of minimality and P^2-irreducibility. The eight different 3-manifolds represented by…

Geometric Topology · Mathematics 2010-12-21 Benjamin A. Burton

The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this…

Geometric Topology · Mathematics 2021-03-01 Jorge L. Arocha , Jorge Fernández-Hidalgo

The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. The underlying procedure is the enumeration of admissible vertices of a high-dimensional polytope, where admissibility is a powerful but…

Geometric Topology · Mathematics 2011-01-24 Benjamin A. Burton

We explicitly construct small triangulations for a number of well-known 3-dimensional manifolds and give a brief outline of some aspects of the underlying theory of 3-manifolds and its historical development.

Geometric Topology · Mathematics 2007-05-23 Frank H. Lutz

Suppose a group $G$ acts properly on a simplicial complex $\Gamma$. Let $l$ be the number of $G$-invariant vertices and $p_1, p_2, ... p_m$ be the sizes of the $G$-orbits having size greater than 1. Then $\Gamma$ must be a subcomplex of…

Combinatorics · Mathematics 2008-12-25 Jonathan Browder

The aim of this paper is to develop the combinatorics of constructions associated to what we call \emph{triangular partitions}. As introduced in arXiv:2102.07931, these are the partitions whose cells are those lying below the line joining…

Combinatorics · Mathematics 2022-03-31 François Bergeron , Mikhail Mazin