2007 · 10 citations · 8 references
Natural SciencesMathematicsComputational GeometryGeometryTopologyAlgebraic GeometryCohomology TheoryConvex GeometryGeometric TopologyBilinear FormsConvex FunctionsIntersection CohomologyLefschetz Duality
The key to the Hard Lefschetz Theorem for combinatorial intersection cohomology of polytopes is to prove the Hodge-Riemann bilinear relations. In these notes, we strive to present an easily accessible proof. The strategy essentially follows the original approach of [Ka], applying induction à la [BreLu2], but our guiding principle here is to emphasize the geometry behind the algebraic arguments by consequently stressing polytopes rather than fans endowed with a strictly convex conewise linear function. It is our belief that this approach makes the exposition more transparent since polytopes are more appealing to our geometric intuition than convex functions on a fan. 1
8
Peter McMullen · Inventiones mathematicae · 1993 · 180 citations
Combinatorial intersection cohomology for fans
Gottfried Barthel, Jean‐Paul Brasselet, Karl-Heinz Fieseler et al. · Tohoku Mathematical Journal · 2002 · 83 citations · Full text
The structure of the polytope algebra
Michel Brion · Tohoku Mathematical Journal · 1997 · 70 citations · Full text