On Walkup's class \(\mathcal K(d)\) and a minimal triangulation of \((S^3 \utimes S^1)^{\#3}\) (Q536224)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On Walkup's class \(\mathcal K(d)\) and a minimal triangulation of \((S^3 \utimes S^1)^{\#3}\)
scientific article

    Statements

    On Walkup's class \(\mathcal K(d)\) and a minimal triangulation of \((S^3 \utimes S^1)^{\#3}\) (English)
    0 references
    0 references
    0 references
    16 May 2011
    0 references
    The authors present an interesting example of a 15-vertex triangulation of a 4-manifold with \(\chi= -4\). This satisfies equality in Walkup's inequality \(n\,(n- 11)\geq -15\chi\). Another example is an 11-vertex triangulation of \(S^1\times S^3\). A stronger inequality in this context is \({n-6\choose 2}\geq {6\choose 2}\beta_1\), where \(\beta_1\) denotes the first Betti number. The example shows that there are more instances of equality, so these inequalities are sharp in principle. Moreover, this triangulation is a tight triangulation, as recently shown by \textit{F. Effenberger} in [J. Comb. Theory, Ser. A 118, No. 6, 1843--1862 (2011; Zbl 1282.52015)]. In fact, any 2-neighborly member of Walkup's class \({\mathcal K}(d)\) is tight for \(d\geq 4\). The construction of the example follows the definition of Walkup's class: Start with a certain triangulated 5-stacked ball with 30 vertices. Then identify three pairs of appropriate 4-dimensional simplices of the boundary.
    0 references
    0 references
    0 references
    0 references
    0 references
    stacked polytope
    0 references
    tight triangulation
    0 references
    Walkup's class
    0 references
    combinatorial manifold
    0 references
    0 references
    0 references