相关论文: Some $\ZZ_3^n$-equivariant triangulations of $\CP^…

We study several properties of $\ZZ_2^n$-equivariant triangulations of $\RR P^n$. We show that a $\ZZ_2^n$-equivariant triangulation of $\RR P^n$ induces a triangulated subdivision of the orbit space $\bigtriangleup^n$. We show that any…

P. Arnoux and A. Marin showed that any triangulation of $\mathbb{RP}^n$ contains more than $\frac{(n+1)(n+2)}{2}$ vertices if $n \geq 3$. We construct some natural triangulation of $\mathbb{RP}^n$ with $\frac{n(n+5)}{2}-1$ vertices for all…

Quasitoric manifolds, introduced by M. Davis and T. Januskiewicz in 1991, are topological generalizations of smooth complex projective spaces. In 1992, Banchoff and K\"uhnel constructed a 10-vertex equilibrium triangulations of $\CP^2$. We…

In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…

We give three constructions of a vertex-minimal triangulation of $4$-dimensional real projective space $\mathbb{R}P^4$. The first construction describes a $4$-dimensional sphere on $32$ vertices, which is a double cover of a triangulated…

In 1987 Brehm and K\"uhnel showed that any triangulation of a $d$-manifold (without boundary) that is not homeomorphic to the sphere has at least $3d/2+3$ vertices. Moreover, triangulations with exactly $3d/2+3$ vertices may exist only for…

We show that the maximum number of convex polygons in a triangulation of $n$ points in the plane is $O(1.5029^n)$. This improves an earlier bound of $O(1.6181^n)$ established by van Kreveld, L\"offler, and Pach (2012) and almost matches the…

We prove the following results on flag triangulations of 2- and 3-manifolds. In dimension 2, we prove that the vertex-minimal flag triangulations of $\mathbb{R} P^2$ and $\mathbb{S}^1\times \mathbb{S}^1$ have 11 and 12 vertices,…

In this paper, we study certain properties of $\mathbb{Z}_2^n$-equivariant triangulations of small covers. We show that any $\mathbb{Z}_2^n$-equivariant triangulation of a small cover naturally induces a triangulation of the orbit space.…

The number of triangulations of a planar n point set is known to be $c^n$, where the base $c$ lies between $2.43$ and $30.$ The fastest known algorithm for counting triangulations of a planar n point set runs in $O^*(2^n)$ time. The fastest…

We present small triangulations of all connected sums of $\mathbb{CP}^2$ and $S^2 \times S^2$ with the standard piecewise linear structure. Our triangulations have $2\beta_2+2$ pentachora, where $\beta_2$ is the second Betti number of the…

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…

A triangulated $d$-manifold $K$, satisfies the inequality $\binom{f_0(K)-d-1}{2}\geq \binom{d+2}{2}\beta_1(K;\mathbb{Z}_2)$ for $d\geq 3$. The triangulated $d$-manifolds that meet the bound with equality are called {\em tight neighborly}.…

Small covers were introduced by Davis and Januszkiewicz in 1991. We introduce the notion of equilibrium triangulations for small covers. We study equilibrium and vertex minimal $\mathbb{Z}_2^2$-equivariant triangulations of $2$-dimensional…

We study the maximal number of triangulations that a planar set of $n$ points can have, and show that it is at most $30^n$. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has…

According to a well-known result in geometric topology, we have \linebreak $\left (\mathbb{S}^2 \right)^{n}\!\!/\operatorname{Sym}(n) = \mathbb{CP}^{n}$, where $\operatorname{Sym}(n)$ acts on $\left (\mathbb{S}^2 \right)^{n}$ by coordinate…

The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein in earlier work, and, unless the lens space is L(3,1), a layered triangulation with the minimal number of tetrahedra was shown to be unique and termed…

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…

We show that the number of partial triangulations of a set of $n$ points on the plane is at least the $(n-2)$-nd Catalan number. This is tight for convex $n$-gons. We also describe all the equality cases.

It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is…