
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
The central topic of the book is refined Intersection Theory and its applications, the central tool of investigation being the Stückrad-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.
This book investigates the refined Intersection Theory and its applications, primarily through the lens of the Stückrad-Vogel Intersection Algorithm. The author, H. Flenner, utilizes this algorithm, built upon the join construction, to present a generalized Bezout's Theorem in both classical and refined forms. The work further explores connections with the Intersection Theory of Fulton-MacPherson, drawing on van Gastel's work with Segre classes, and delves into Bertini theorems, Connectedness theorems, and various measures of multiplicity. It synthesizes local algebraic techniques, such as the theory of residual intersections, with geometrical methods to provide a broad array of applications and examples.
The book is structured to bridge the understanding between algebraists and geometers, offering insights into geometrical methods for the former and key tools from commutative algebra for the latter. Its comprehensive approach to intersection theory, incorporating diverse techniques and applications, suggests it is a valuable resource for advanced students and researchers in mathematics. The detailed exploration of algorithms and theorems indicates a rigorous and in-depth treatment of the subject matter.
Page Count:
316
Publication Date:
2010-01-01
ISBN-10:
3642085628
ISBN-13:
9783642085628
No comments yet. Be the first to share your thoughts!