Linear free divisors and the global logarithmic comparison theorem

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

46 pages, 2 figures, 5 tables, final version

Scientific paper

A complex hypersurface D in complex affine n-space C^n is a linear free divisor (LFD) if its module of logarithmic vector fields has a global basis of linear vector fields. We classify all LFDs for n at most 4. Analogous to Grothendieck's comparison theorem, we say that the global logarithmic comparison theorem (GLCT) holds for D if the complex of global logarithmic differential forms computes the complex cohomology of the complement of D in C^n. We develop a general criterion for the GLCT for LFDs and prove that it is fulfilled whenever the Lie algebra of linear logarithmic vector fields is reductive. For n at most 4, we show that the GLCT holds for all LFDs. We show that LFDs arising naturally as discriminants in quiver representation spaces (of real Schur roots) fulfill the GLCT. As a by-product we obtain a simplified proof of a theorem of V. Kac on the number of irreducible components of such discriminants.

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

Linear free divisors and the global logarithmic comparison theorem 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 Linear free divisors and the global logarithmic comparison theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear free divisors and the global logarithmic comparison theorem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-416176

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