<電子ブック>
Ideals, Varieties, and Algorithms : An Introduction to Computational Algebraic Geometry and Commutative Algebra / by David Cox, John Little, DONAL OSHEA
(Undergraduate Texts in Mathematics. ISSN:21975604)
版 | 1st ed. 1992. |
---|---|
出版者 | (New York, NY : Springer New York : Imprint: Springer) |
出版年 | 1992 |
本文言語 | 英語 |
大きさ | XI, 514 p. 43 illus : online resource |
著者標目 | *Cox, David author Little, John author OSHEA, DONAL author SpringerLink (Online service) |
件 名 | LCSH:Algebraic geometry FREE:Algebraic Geometry |
一般注記 | 1 Geometry, Algebra, and Algorithms -- 2 Groebner Bases -- 3 Elimination Theory -- 4 The Algebra-Geometry Dictionary -- 5 Polynomial and Rational Functions on a Variety -- 6 Robotics and Automatic Geometric Theorem Proving -- 7 Invariant Theory of Finite Groups -- 8 Projective Algebraic Geometry -- 9 The Dimension of a Variety -- Appendix A Some Concepts from Algebra -- §1. Fields and Rings -- §2. Groups -- §3. Determinants -- Appendix B Pseudocode -- §1. Inputs, Outputs, Variables, and Constants -- §2. Assignment Statements -- §3. Looping Structures -- §4. Branching Structures -- Appendix C Computer Algebra Systems -- §1. Maple -- §2. Mathematica -- §3. REDUCE -- §4. Other Systems -- Appendix D Independent Projects -- §1. General Comments -- §2. Suggested Projects -- References We wrote this book to introduce undergraduates to some interesting ideas in algebraic geometry and commutative algebra. Until recently, these topics involved a lot of abstract mathematics and were only taught in graduate school. But in the 1960's, Buchberger and Hironaka discovered new algorithms for manipulating systems of polynomial equations. Fueled by the development of computers fast enough to run these algorithms, the last two decades have seen a minor revolution in commutative algebra. The ability to compute efficiently with polynomial equations has made it possible to investigate complicated examples that would be impossible to do by hand, and has changed the practice of much research in algebraic geometry. This has also enhanced the importance of the subject for computer scientists and engineers, who have begun to use these techniques in a whole range of problems. It is our belief that the growing importance of these computational techniques warrants their introduction into the undergraduate (and graduate) mathematics curricu lum. Many undergraduates enjoy the concrete, almost nineteenth century, flavor that a computational emphasis brings to the subject. At the same time, one can do some substantial mathematics, including the Hilbert Basis Theorem, Elimination Theory and the Nullstellensatz. The mathematical prerequisites of the book are modest: the students should have had a course in linear algebra and a course where they learned how to do proofs. Examples of the latter sort of course include discrete math and abstract algebra HTTP:URL=https://doi.org/10.1007/978-1-4757-2181-2 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9781475721812 |
|
電子リソース |
|
EB00227893 |
類似資料
この資料の利用統計
このページへのアクセス回数:4回
※2017年9月4日以降