Minimal flag triangulations of lower-dimensional manifolds

Abstract: 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

m a t h b b R P^{2}

and

m a t h b b S^{1} i m e s m a t h b b S^{1}

have 11 and 12 vertices, respectively. In general, we show that

8 + 3 k

(resp.

8 + 4 k

) vertices suffice to obtain a flag triangulation of the connected sum of

k

copies of

m a t h b b R P^{2}

(resp.

m a t h b b S^{1} i m e s m a t h b b S^{1}

). In dimension 3, we describe an algorithm based on the Lutz-Nevo theorem which provides supporting computational evidence for the following generalization of the Charney-Davis conjecture: for any flag 3-manifold,

, where

f_{i}

is the number of

i

-dimensional faces and

is the first Betti number over a field. The conjecture is tight in the sense that for any value of

, there exists a flag 3-manifold for which the equality holds.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Minimal flag triangulations of lower-dimensional manifolds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2036680)