03849nam 22006732 450 991078604130332120151005020621.01-107-23864-11-139-56576-11-107-25588-01-107-30195-51-107-30704-X1-107-31259-01-299-00635-31-107-31479-81-107-30924-7(CKB)2670000000327068(EBL)1113118(OCoLC)827210294(SSID)ssj0000850078(PQKBManifestationID)11531579(PQKBTitleCode)TC0000850078(PQKBWorkID)10825034(PQKB)11609607(UkCbUP)CR9781139565769(Au-PeEL)EBL1113118(CaPaEBR)ebr10649565(CaONFJC)MIL431885(MiAaPQ)EBC1113118(PPN)261277367(EXLCZ)99267000000032706820141103d2013|||| uy| 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierA first course in computational algebraic geometry /Wolfram Decker and Gerhard Pfister ; with pictures by Oliver Labs[electronic resource]Cambridge :Cambridge University Press,2013.1 online resource (viii, 118 pages) digital, PDF file(s)AIMS library seriesTitle from publisher's bibliographic system (viewed on 05 Oct 2015).Includes bibliographical references and index.Cover; Contents; Preface; Prologue: General Remarks on Computer Algebra Systems; 1 The Geometry-Algebra Dictionary; 1.1 Affine Algebraic Geometry; 1.1.1 Ideals in Polynomial Rings; 1.1.2 Affine Algebraic Sets; 1.1.3 Hilbert's Nullstellensatz; 1.1.4 Irreducible Algebraic Sets; 1.1.5 Removing Algebraic Sets; 1.1.6 Polynomial Maps; 1.1.7 The Geometry of Elimination; 1.1.8 Noether Normalization and Dimension; 1.1.9 Local Studies; 1.2 Projective Algebraic Geometry; 1.2.1 The Projective Space; 1.2.2 Projective Algebraic Sets; 1.2.3 Affine Charts and the Projective Closure1.2.4 The Hilbert Polynomial2 Computing; 2.1 Standard Bases and Singular; 2.2 Applications; 2.2.1 Ideal Membership; 2.2.2 Elimination; 2.2.3 Radical Membership; 2.2.4 Ideal Intersections; 2.2.5 Ideal Quotients; 2.2.6 Kernel of a Ring Map; 2.2.7 Integrality Criterion; 2.2.8 Noether Normalization; 2.2.9 Subalgebra Membership; 2.2.10 Homogenization; 2.3 Dimension and the Hilbert Function; 2.4 Primary Decomposition and Radicals; 2.5 Buchberger's Algorithm and Field Extensions; 3 Sudoku; 4 A Problem in Group Theory Solved by Computer Algebra; 4.1 Finite Groups and Thompson's Theorem4.2 Characterization of Finite Solvable GroupsBibliography; IndexA First Course in Computational Algebraic Geometry is designed for young students with some background in algebra who wish to perform their first experiments in computational geometry. Originating from a course taught at the African Institute for Mathematical Sciences, the book gives a compact presentation of the basic theory, with particular emphasis on explicit computational examples using the freely available computer algebra system, Singular. Readers will quickly gain the confidence to begin performing their own experiments.AIMS library series.Geometry, AlgebraicData processingTextbooksGeometry, AlgebraicData processing516.3/5Decker W.1479266Pfister GerhardUkCbUPUkCbUPBOOK9910786041303321A first course in computational algebraic geometry3695312UNINA