Siirry suoraan sisältöön
Joins and Intersections
Tallenna

Joins and Intersections

The central topic of the book is refined Intersection Theory and its applications, the central tool of investigation being the Stuckrad-Vogel Intersection Algorithm, based on the join construction. This algorithm is used to present a general version of Bezout's Theorem, in classical and refined form. Connections with the Intersection Theory of Fulton-MacPherson are treated, using work of van Gastel employing Segre classes. Bertini theorems and Connectedness theorems form another major theme, as do various measures of multiplicity. We mix local algebraic techniques as e.g. the theory of residual intersections with more geometrical methods, and present a wide range of geometrical and algebraic applications and illustrative examples. The book incorporates methods from Commutative Algebra and Algebraic Geometry and therefore it will deepen the understanding of Algebraists in geometrical methods and widen the interest of Geometers in major tools from Commutative Algebra.
Painos
Softcover reprint of hardcover 1st ed. 1999
ISBN
9783642085628
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
6.12.2010
Sivumäärä
301