Hard Lefschetz theorem for nonrational polytopes

By Kalle Karu. 2001

113 citations recorded by the source corpus.

The Hard Lefschetz theorem is known to hold for the intersection cohomology of the toric variety associated to a rational convex polytope. One can construct the intersection cohomology combinatorially from the polytope, hence it is well defined even for nonrational polytopes when there is no variety associated to it. We prove the Hard Lefschetz theorem for the intersection cohomology of a general polytope.

Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/284f74772b3f6312e101051c211aa988a4c23a7e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. Ben Elias
  2. T. Panov
  3. M. A. Cataldo
  4. L. Migliorini
  5. Geordie Williamson
  6. June Huh
  7. V. Buchstaber
  8. M. Masuda

In Discrete Mathematics and Combinatorics

  1. T. Panov
  2. Geordie Williamson
  3. V. Buchstaber
  4. Ben Elias
  5. June Huh
  6. L. Migliorini
  7. M. A. Cataldo
  8. M. Masuda

In Geometry and Topology

  1. Ben Elias
  2. Geordie Williamson
  3. M. A. Cataldo
  4. L. Migliorini
  5. T. Panov
  6. June Huh
  7. V. Buchstaber
  8. M. Masuda

Citations in the corpus