Algorithmic Computation of de Rham Cohomology of Complements of Complex Affine Varieties

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

25 pages, amsart, uses verbatim, amsmath, latexsym, amssymb, xypic, fixed typos

Scientific paper

Let $X=\C^n$. In this paper we present an algorithm that computes the de Rham cohomology groups $H^i_{dR}(U,\C)$ where $U$ is the complement of an arbitrary Zariski-closed set $Y$ in $X$. Our algorithm is a merger of the algorithm given by T.~Oaku and N.~Takayama (\cite{O-T2}), who considered the case where $Y$ is a hypersurface, and our methods from \cite{W-1} for the computation of local cohomology. We further extend the algorithm to compute de Rham cohomology groups with support $H^i_{dR,Z}(U,\C)$ where again $U$ is an arbitrary Zariski-open subset of $X$ and $Z$ is an arbitrary Zariski-closed subset of $U$. Our main tool is the generalization of the restriction process from \cite{O-T1} to complexes of modules over the Weyl algebra. All presented algorithms are based on Gr\"obner basis computations in the Weyl algebra.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Algorithmic Computation of de Rham Cohomology of Complements of Complex Affine Varieties does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithmic Computation of de Rham Cohomology of Complements of Complex Affine Varieties, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic Computation of de Rham Cohomology of Complements of Complex Affine Varieties will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-208060

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.