Numerical polar calculus and cohomology of line bundles (Q1661487)

The authors provide a probabilistic algorithm to compute the degree of any intersection of polar classes of a non singular projective variety and they state, in a separate procedure, the special case of the degree of the individual polar classes. This algorithm is formulated by using a starting procedure that returns the equations defining the power of a polar class. As an immediate application, two important invariants of a projective variety that can be expressed in terms of degrees of polar classes are computed: the degree of the discriminant locus and the Euclidean distance degree. Another interesting application for applied and computational algebraic geometry is presented: the developing of an algorithm for computing the Euler Characteristic of linear combinations of line bundles on a smooth complex variety. The input, in this Euler algorithm, consists of generators for the homogeneous ideals defining the variety and the divisors representing the line bundles. The algorithms may be implemented using symbolic software or Numerical Algebraic Geometry software. Finally, a gallery of examples is also given.