Computations in algebraic geometry with macaulay 2 / Eisenbud , David ; Grayson , Daniel R. (2002)

Public ISBD Titre : Computations in algebraic geometry with macaulay 2 Type de document : texte imprimé Auteurs : Eisenbud , David, Éditeur scientifique ; Grayson , Daniel R., Éditeur scientifique ; Stillman , Michael, Éditeur scientifique Editeur : Berlin ; London ; Cham : Springer Année de publication : 2002 Collection : Algorithms and computation in mathematics, ISSN 1431-1550 num. Vol. 8 Importance : XIII-329 p. Format : 24 cm ISBN/ISSN/EAN : 978-3-540-42230-3 Note générale : Bibliogr. Index Langues : Anglais (eng) Mots-clés : Macaulay 2 Geometry, Algebraic -- Data processing Géométrie -- Informatique Géométrie algébrique Index. décimale : 519.6 Mathématique numérique. Analyse numérique. Programmation. (informatique). Science des ordinateurs. Résumé : This book presents algorithmic tools for algebraic geometry and experimental applications of them. It also introduces a software system in which the tools have been implemented and with which the experiments can be carried out. Macaulay 2 is a computer algebra system devoted to supporting research in algebraic geometry, commutative algebra, and their applications. The reader of this book will encounter Macaulay 2 in the context of concrete applications and practical computations in algebraic geometry. The expositions of the algorithmic tools presented here are designed to serve as a useful guide for those wishing to bring such tools to bear on their own problems. These expositions will be valuable to both the users of other programs similar to Macaulay 2 (for example, Singular and CoCoA) and those who are not interested in explicit machine computations at all. The first part of the book is primarily concerned with introducing Macaulay2, whereas the second part emphasizes the mathematics. Note de contenu : - Introducing Macaulay 2 Ideals, varieties and Macaulay 2 Projective geometry and homological algebra Data types, functions, and programmingv Teaching the geometrfy of schemes - Mathematical computations Monomial ideas From enumerative geometry to solving systems of polynomial equations Resolutions and cohomology over complete intersections Algorithms for the Toric Hilbert scheme Sheaf algorithms using the exterior algebra Needles in a haystack : special varieties via small fields D-modules and cohomology of varieties Computations in algebraic geometry with macaulay 2 [texte imprimé] / Eisenbud , David, Éditeur scientifique ; Grayson , Daniel R., Éditeur scientifique ; Stillman , Michael, Éditeur scientifique . - Berlin ; London ; Cham : Springer, 2002 . - XIII-329 p. ; 24 cm. - (Algorithms and computation in mathematics, ISSN 1431-1550; Vol. 8) . ISBN : 978-3-540-42230-3 Bibliogr. Index Langues : Anglais (eng) Mots-clés : Macaulay 2 Geometry, Algebraic -- Data processing Géométrie -- Informatique Géométrie algébrique Index. décimale : 519.6 Mathématique numérique. Analyse numérique. Programmation. (informatique). Science des ordinateurs. Résumé : This book presents algorithmic tools for algebraic geometry and experimental applications of them. It also introduces a software system in which the tools have been implemented and with which the experiments can be carried out. Macaulay 2 is a computer algebra system devoted to supporting research in algebraic geometry, commutative algebra, and their applications. The reader of this book will encounter Macaulay 2 in the context of concrete applications and practical computations in algebraic geometry. The expositions of the algorithmic tools presented here are designed to serve as a useful guide for those wishing to bring such tools to bear on their own problems. These expositions will be valuable to both the users of other programs similar to Macaulay 2 (for example, Singular and CoCoA) and those who are not interested in explicit machine computations at all. The first part of the book is primarily concerned with introducing Macaulay2, whereas the second part emphasizes the mathematics. Note de contenu : - Introducing Macaulay 2 Ideals, varieties and Macaulay 2 Projective geometry and homological algebra Data types, functions, and programmingv Teaching the geometrfy of schemes - Mathematical computations Monomial ideas From enumerative geometry to solving systems of polynomial equations Resolutions and cohomology over complete intersections Algorithms for the Toric Hilbert scheme Sheaf algorithms using the exterior algebra Needles in a haystack : special varieties via small fields D-modules and cohomology of varieties

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité	Etat_Exemplaire
046775	519.6 COM	Papier	Bibliothèque Centrale	Mathématiques	Disponible