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
RP2 and
S1×S1
have 11 and 12 vertices, respectively. In general, we show that
8+3k
(resp. 8+4k)
vertices suffice to obtain a flag triangulation of the connected sum of
k copies
of
RP2
(resp. S1×S1).
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,
γ2:=f1−5f0+16≥16β1, where
fi is the number of
i-dimensional faces
and
β1 is the first Betti
number over a field
k.
The conjecture is tight in the sense that for any value of
β1, there
exists a flag 3-manifold for which the equality holds.
Keywords
flag complexes, triangulations of manifolds, Charney–Davis
conjecture