Abstract
We describe a parallel polynomial time algorithm for computing the topological Betti numbers of a smooth complex projective variety . It is the first single exponential time algorithm for computing the Betti numbers of a significant class of complex varieties of arbitrary dimension. Our main theoretical result is that the Castelnuovo-Mumford regularity of the sheaf of differential -forms on is bounded by , where , , and are the maximal codimension, dimension, and degree, respectively, of all irreducible components of . It follows that, for a union of generic hyperplane sections in , the algebraic de Rham cohomology of is described by differential forms with poles along of single exponential order. This yields a similar description of the de Rham cohomology of , which allows its efficient computation. Furthermore, we give a parallel polynomial time algorithm for testing whether a projective variety is smooth.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.