Numerical Polar calculus and cohomology of line bundles
Sandra Di Rocco, David Eklund, Chris Peterson

TL;DR
This paper introduces a probabilistic algorithm to compute intersection degrees of polar classes and the Euler characteristic of linear combinations of line bundles on smooth projective varieties.
Contribution
It presents a novel probabilistic method for calculating intersection degrees and Euler characteristics using generators of homogeneous ideals.
Findings
Algorithm effectively computes degrees of polar class intersections.
Method enables calculation of Euler characteristics of line bundle combinations.
Applicable to smooth varieties defined by homogeneous ideals.
Abstract
Let be line bundles on a smooth variety and let be divisors on such that represents . We give a probabilistic algorithm for computing the degree of intersections of polar classes which are in turn used for computing the Euler characteristic of linear combinations of . The input consists of generators for the homogeneous ideals defining and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
