Math-1821 · mathematics · Group theory

Math-1821

Questions in Geometric Group Theory — Q 13.7

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Let $k\geq1$ and let $L$ be a finite simplicial complex whose underlying topological space is homeomorphic to the sphere $S^{2k-1}$. The complex is flag if every finite set of vertices which are pairwise joined by edges spans a simplex. This condition rules out a collection of mutually adjacent vertices whose expected simplex is missing.

For $0\leq i\leq2k-1$, let $f_i(L)$ be the number of $i$-dimensional simplices, counted without orientations. Define the rational number \[ C(L)=1-\sum_{i=0}^{2k-1}(-1)^i\frac{f_i(L)}{2^{i+1}}. \] The Charney--Davis question asks whether every such flag triangulation satisfies \[ (-1)^k C(L)\geq0. \] The initial constant $1$ is part of this expression; $C(L)$ is not simply the ordinary Euler characteristic of the sphere. The exponent $k$ is half of one more than the sphere dimension, exactly as displayed.

Both the integer $k$ and the finite triangulation vary universally. No assumption that the sphere is the boundary of a convex polytope is made, and no particular flag subdivision is prescribed. A proof for polytopal spheres or low dimensions would therefore cover only a restricted family. The assertion is non-strict, so equality is permitted. All the quantities depend on the simplicial face numbers, and the problem asks for a numerical inequality valid for every permissible combinatorial realization of the sphere, rather than invariance of this number under arbitrary subdivisions.

Short English statement

Does every flag triangulation of an odd-dimensional sphere satisfy the signed Charney–Davis face-number inequality?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.