Average order of coloured triangulations: The general case (Q1392659)

For any triangulated 3-manifold, there holds a lower bound for the number of edges in terms of the number of vertices or, alternatively, the number of triangles. This was known as the `Lower Bound Theorem' for a while. Then by \textit{F. Luo} and \textit{R. Stong} [Trans. Am. Math. Soc. 337, No. 2, 891-906 (1993; Zbl 0785.57007)] it was transformed into an inequality for the so-called average edge order \(\mu_0\). For 3-manifolds with boundary the same was done by \textit{M. Tamura} [Osaka J. Math. 33, No. 3, 761-773 (1996; Zbl 0878.57020)]. The author gave analogous results for coloured triangulations of 3-manifolds instead of ordinary (i.e., simplicial) triangulations in [Can. Math. Bull. 37, No. 2, 154-161 (1994; Zbl 0819.57003)]. In the present paper, similar inequalities are obtained for coloured triangulations of \(n\)-manifolds with or without boundary. In this case the average edge order is replaced by the average \((n-2)\)-simplex order.