| 000 | 02936nam a2200361 i 4500 | ||
|---|---|---|---|
| 008 | 031210s2005 nyua b 001 0 eng | ||
| 010 | _a2003070363 | ||
| 020 |
_a0387207066 _qalk. paper |
||
| 020 |
_a0387207333 _qpbk. : alk. paper |
||
| 040 |
_aDLC _cDLC _dYDX _dCIN |
||
| 049 | _aBAUN_MERKEZ | ||
| 050 | 0 | 4 |
_aQA564 _b.C688 2005 |
| 082 | 0 | 0 | _222 |
| 100 | 1 | _aCox, David A | |
| 245 | 1 | 0 |
_aUsing algebraic geometry / _cDavid A. Cox, John Little, Donal O'Shea |
| 250 | _a2nd ed | ||
| 264 | 1 |
_aNew York : _bSpringer, _c[2005] |
|
| 264 | 4 | _c©2005 | |
| 300 |
_axii, 572 pages : _billustrations ; _c25 cm |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_aunmediated _bn _2rdamedia |
||
| 338 |
_avolume _bnc _2rdacarrier |
||
| 490 | 1 |
_aGraduate texts in mathematics ; _v185 |
|
| 504 | _aIncludes bibliographical references (pages 533-545) and index | ||
| 505 | 0 | 0 |
_tTable Of Contents: _tPreface to the Second Edition _tPreface to the First Edition _t1 Introduction _t1 Polynomials and Ideals _t2 Monomial Orders and Polynomial Division _t3 Grobner Bases _t4 Affine Varieties _t2 Solving Polynomial Equations _t1 Solving Polynomial Systems by Elimination _t2 Finite-Dimensional Algebras _t3 Grobner Basis Conversion _t4 Solving Equations via Eigenvalues and Eigenvectors _t5 Real Root Location and Isolation _t3 Resultants _t1 The Resultant of Two Polynomials _t2 Multipolynomial Resultants _t3 Properties of Resultants _t4 Computing Resultants _t5 Solving Equations via Resultants _t6 Solving Equations via Eigenvalues and Eigenvectors _t4 Computation in Local Rings _t1 Local Rings _t2 Multiplicities and Milnor Numbers _t3 Term Orders and Division in Local Rings _t4 Standard Bases in Local Rings _t5 Applications of Standard Bases _t5 Modules _tl Modules over Rings _t2 Monomial Orders and Grobner Bases for Modules _t3 Computing Syzygies _t4 Modules over Local Rings _t6 Free Resolutions _t1 Presentations and Resolutions of Modules _t2 Hilbert's Syzygy Theorem _t3 Graded Resolutions _t4 Hilbert Polynomials and Geometric Applications _t7 Polytopes, Resultants, and Equations _t1 Geometry of Polytopes _t2 Sparse Resultants _t3 Toric Varieties _t4 Minkowski Sums and Mixed Volumes _t5 Bernstein's Theorem _t6 Computing Resultants and Solving Equations _t8 Polyhedral Regions and Polynomials _t1 Integer Programming _t2 Integer Programming and Combinatorics _t3 Multivariate Polynomial Splines _t4 The Grobner Fan of an Ideal _t5 The Grobner Walk _t9 Algebraic Coding Theory _t1 Finite Fields _t2 Error-Correcting Codes _t3 Cyclic Codes _t4 Reed-Solomon Decoding Algorithms _t10 The Berlekamp-Massey-Sakata Decoding Algorithm _t1 Codes from Order Domains _t2 The Overall Structure of the BMS Algorithm _t3 The Details of the BMS Algorithm _tReferences _tIndex |
| 650 | 0 | _aGeometry, Algebraic | |
| 700 | 1 | _aLittle, John B | |
| 700 | 1 | _aO'Shea, Donal | |
| 830 | 0 |
_919347 _aGraduate texts in mathematics ; _v185 |
|
| 900 | _a28414 | ||
| 900 | _bsatın | ||
| 942 |
_2lcc _cKT |
||
| 999 |
_c25111 _d25111 |
||