CoChat

Hard Lefschetz theorem for nonrational polytopes

Open access
Karu, Kalle · 2004 · Inventiones mathematicae

The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.

Abstract

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.

Overview

Integrity signals

Registry

Crossref · 10.1007/s00222-004-0358-3

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Cited by

See all 115

Metadata

Authors
Karu, K.
Affiliations
University of British Columbia (CA)
Corresponding author
Karu, Kalle
Venue
Inventiones mathematicae
Published
2004-08
Volume
157
Issue
2
Pages
419-447
ISSN
  • 0020-9910 (ISSN-L)
  • 1432-1297
OpenAlex
W1969324981
Cited by
73
References
13
Citations by year
2026: 2 · 2025: 3 · 2024: 1 · 2023: 2 · 2022: 2 · 2021: 3 · 2020: 2 · 2019: 3 · 2018: 1 · 2017: 2 · 2016: 6 · 2015: 3 · 2014: 2 · 2013: 1 · 2012: 1
FWCI
11.24
Type
journal article
Language
en
Open access
Licence
www.springer.com/tdm (tdm)
Locations
  • Inventiones mathematicae (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
  • Physical Sciences › Mathematics › Geometry and Topology › Algebraic Geometry and Number Theory
  • Physical Sciences › Mathematics › Algebra and Number Theory › Commutative Algebra and Its Applications
Keywords
Hard Lefschetz theorem, intersection cohomology, toric varieties, polytopes

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.