相关论文: Minimal triangulations of circle bundles

We investigate a PL topology question: which circle bundles can be triangulated over a given triangulation of the base? The question got a simple answer emphasizing the role of minimal triangulations encoded by local systems of circular…

We determine the minimum number of vertices needed to provide balanced triangulations of $\mathbb S^{d-2}$-bundles over $\mathbb S^1$. If $d$ is odd and the bundle is orientable, or $d$ is even and the bundle is non-orientable, the minimum…

For a compact 3-manifold $M$ which is a circle bundle over a compact Riemann surface $\Sigma$ with even Euler number $e(M)$, and with a Riemannian metric compatible with the bundle projection, there exists a compact minimal surface $S$ in…

We proof that having boundary of standard 3-dimensional simplex $\partial \Delta^3$ as a base of triangulation one can triangulate only trivial and Hopf circle bundles.

For integers $d \geq 2$ and $\epsilon = 0$ or 1, let $S^{1, d - 1}(\epsilon)$ denote the sphere product $S^{1} \times S^{d - 1}$ if $\epsilon = 0$ and the twisted $S^{d - 1}$ bundle over $S^{1}$ if $\epsilon = 1$. The main results of this…

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…

Casual structure can take the form of cone bundles on a manifold, more general local preorders on a topological space, or simplicial orientations implicit in a simplicial set. This note takes a triangulation of a conal manifold M to mean an…

We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and…

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…

This paper studies the minimal number of vertices $\lambda(n,d)$ required in a triangulation of the $n$-sphere to admit a simplicial map to the boundary of a $(n+1)$-simplex with a given degree $d$. We establish upper bounds for…

It is known that an ideal triangulation of a compact $3$-manifold with nonempty boundary is minimal if and only if it contains the minimum number of edges among all ideal triangulations of the manifold. Therefore, any ideal one-edge…

We give a complete characterization of all possible pairs (v,e), where v is the number of vertices and e is the number of edges, of any simplicial triangulation of an S^k-bundle over S^1. The main point is that Kuhnel's triangulations of…

For a 3-dimensional manifold $M^3$, its complexity $c(M^3)$, introduced by S.Matveev, is the minimal number of vertices of an almost simple spine of $M^3$; in many cases it is equal to the minimal number of tetrahedra in a singular…

For positive integers $n,d$, let $\lambda(n,d)$ be the minimal number of vertices of a triangulation of $n$-sphere which admits a degree $d$ simplicial map to the boundary of $(n+1)$-simplex. We show that…

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…

A submanifold is said to be tangentially biharmonic if the bitension field of the isometric immersion that defines the submanifold has vanishing tangential component. The purpose of this paper is to prove that a surface in Euclidean…

In answering questions from arXiv:0901.2337v1 we prove a triangulation result that is of independent interest. In more detail, let R be an o-minimal field with a proper convex subring V, and let st: V \to k be the corresponding standard…

Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…

One measure of the complexity of a 3-manifold is its triangulation complexity: the minimal number of tetrahedra in a triangulation of it. A natural question is whether we can relate this quantity to its topology. We determine the…

Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…