# A Construction Principle for Tight and Minimal Triangulations of Manifolds

@article{Burton2018ACP, title={A Construction Principle for Tight and Minimal Triangulations of Manifolds}, author={Benjamin A. Burton and Basudeb Datta and Nitin Singh and Jonathan Spreer}, journal={Experimental Mathematics}, year={2018}, volume={27}, pages={22 - 36} }

ABSTRACT Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying manifold. Tight triangulations are conjectured to be strongly minimal and proven to be so for dimensions ⩽ 3. However, in spite of substantial theoretical results about such triangulations, there are precious few examples. In fact, apart from dimension two…

## 7 Citations

Efficient Algorithms to Decide Tightness

- Mathematics, Computer ScienceSoCG
- 2016

This article presents a new polynomial time procedure to decide tightness for triangulations of 3-manifolds – a problem which previously was thought to be hard.

Separation-type combinatorial invariants for triangulations of manifolds

- Mathematics
- 2018

We propose and study a variation of Bagchi and Datta's $\sigma$-vector of a simplicial complex C, whose entries are defined as weighted sums of Betti numbers of induced subcomplexes of C. We prove…

A necessary condition for the tightness of odd-dimensional combinatorial manifolds

- MathematicsEur. J. Comb.
- 2016

Golod and tight 3-manifolds

- Mathematics
- 2021

The notions Golodness and tightness for simplicial complexes come from algebra and geometry, respectively. We prove these two notions are equivalent for 3-manifold triangulations, through a…

Average Betti Numbers of Induced Subcomplexes in Triangulations of Manifolds

- MathematicsElectron. J. Comb.
- 2020

Upper bounds on $\sigma$ can be used to obtain lower bounds on the $f$-vector of triangulated $4$-manifolds with transitive symmetry on vertices and prescribed vector of Betti numbers.

## References

SHOWING 1-10 OF 37 REFERENCES

A CENSUS OF TIGHT TRIANGULATIONS

- Mathematics
- 2000

A triangulation of a manifold (or pseudomanifold) is called a tight triangulation if any simplexwise linear embedding into any Euclidean space is tight. Tightness of an embedding means that the…

Stacked polytopes and tight triangulations of manifolds

- MathematicsJ. Comb. Theory, Ser. A
- 2011

Efficient Algorithms to Decide Tightness

- Mathematics, Computer ScienceSoCG
- 2016

This article presents a new polynomial time procedure to decide tightness for triangulations of 3-manifolds – a problem which previously was thought to be hard.

The lower bound conjecture for 3- and 4-manifolds

- Mathematics
- 1970

For any closed connected d-manifold M let ](M) denote the set of vectors / (K)= (]0(K) ..... fd(K)), where K ranges over all triangulations of M and ]k(K) denotes the number of k-simplices of K. The…

On stellated spheres and a tightness criterion for combinatorial manifolds

- MathematicsEur. J. Comb.
- 2014

On Walkup’s class K(d) and a minimal triangulation of (S ⋉S)

- Mathematics
- 2013

For d ≥ 2, Walkup’s class K(d) consists of the d-dimensional simplicial complexes all whose vertex-links are stacked (d − 1)-spheres. Kalai showed that for d ≥ 4, all connected members of K(d) are…

Rigidity and the lower bound theorem 1

- Mathematics
- 1987

SummaryFor an arbitrary triangulated (d-1)-manifold without boundaryC withf0 vertices andf1 edges, define
$$\gamma (C) = f_1 - df_0 + \left( {\begin{array}{*{20}c} {d + 1} \\ 2 \\ \end{array} }…