Constructive Commutative Algebra: Projective Modules Over Polynomial Rings and Dynamical Gröbner Bases: Lecture Notes in Mathematics, cartea 2138
Autor Ihsen Yenguien Limba Engleză Paperback – 12 dec 2015
Simple and constructive proofs of some results in the theory of projective modules over polynomial rings are also given, and light is cast upon recent progress on the Hermite ring and Gröbner ring conjectures. New conjectures on unimodular completion arising from our constructive approach to the unimodular completion problem are presented.
Constructive algebra can be understood as a first preprocessing step for computer algebra that leads to the discovery of general algorithms, even if they are sometimes not efficient. From a logical point of view, the dynamical evaluation gives a constructive substitute for two highly nonconstructive toolsof abstract algebra: the Law of Excluded Middle and Zorn's Lemma. For instance, these tools are required in order to construct the complete prime factorization of an ideal in a Dedekind ring, whereas the dynamical method reveals the computational content of this construction. These lecture notes follow this dynamical philosophy.
Din seria Lecture Notes in Mathematics
- 17% Preț: 360.42 lei
- Preț: 116.79 lei
- 20% Preț: 380.29 lei
- Preț: 131.65 lei
- Preț: 442.62 lei
- Preț: 175.68 lei
- Preț: 477.63 lei
- 17% Preț: 361.88 lei
- Preț: 252.37 lei
- Preț: 343.94 lei
- Preț: 138.88 lei
- Preț: 152.60 lei
- Preț: 116.67 lei
- Preț: 102.77 lei
- Preț: 119.02 lei
- 17% Preț: 365.52 lei
- Preț: 396.75 lei
- 17% Preț: 362.12 lei
- Preț: 396.11 lei
- Preț: 357.78 lei
- 17% Preț: 362.31 lei
- Preț: 403.80 lei
- 17% Preț: 361.70 lei
- Preț: 481.05 lei
- Preț: 444.01 lei
- Preț: 395.90 lei
- Preț: 469.21 lei
- Preț: 408.06 lei
- Preț: 469.21 lei
- Preț: 321.16 lei
- Preț: 313.55 lei
- Preț: 337.17 lei
- Preț: 321.90 lei
- Preț: 393.02 lei
- Preț: 315.97 lei
- Preț: 405.45 lei
- Preț: 265.57 lei
- Preț: 408.64 lei
- Preț: 406.18 lei
- Preț: 485.97 lei
- Preț: 406.18 lei
- Preț: 264.46 lei
- Preț: 322.60 lei
- Preț: 406.38 lei
- Preț: 478.76 lei
- Preț: 264.95 lei
- Preț: 411.95 lei
- Preț: 365.51 lei
- Preț: 414.95 lei
- Preț: 313.71 lei
Preț: 404.75 lei
Nou
Puncte Express: 607
Preț estimativ în valută:
77.46€ • 81.72$ • 64.55£
77.46€ • 81.72$ • 64.55£
Carte tipărită la comandă
Livrare economică 03-17 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319194936
ISBN-10: 3319194933
Pagini: 250
Ilustrații: VII, 271 p. 5 illus.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.4 kg
Ediția:1st ed. 2015
Editura: Springer International Publishing
Colecția Springer
Seria Lecture Notes in Mathematics
Locul publicării:Cham, Switzerland
ISBN-10: 3319194933
Pagini: 250
Ilustrații: VII, 271 p. 5 illus.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.4 kg
Ediția:1st ed. 2015
Editura: Springer International Publishing
Colecția Springer
Seria Lecture Notes in Mathematics
Locul publicării:Cham, Switzerland
Public țintă
ResearchCuprins
Projective modules over polynomial rings.- Dynamical Gr¨obner bases.- Syzygies in polynomial rings over valuation domains.- Exercises.- Detailed solutions to the exercises.
Recenzii
“Each chapter is self-contained. All the proofs are constructive and many illustrative examples are included. The book is well-written and easy to read. The book also contains some original and significant research results of the author. The book is highly recommended for researchers and students interesting in constructive commutative algebra.” (Chen Sheng, zbMATH 1360.13002, 2017)
“The purpose of this book is twofold: to find the computational content hidden in abstract proofs of concrete theorems in commutative algebra, and to give general algorithms for solving theorems of abstract algebra. … The book is based on lectures on constructive algebra that the author previously gave on two different occasions. Each chapter is self-contained. All the proofs are constructive and many illustrative examples are included.” (HaohaoWang, Mathematical Reviews, August, 2016)
“The purpose of this book is twofold: to find the computational content hidden in abstract proofs of concrete theorems in commutative algebra, and to give general algorithms for solving theorems of abstract algebra. … The book is based on lectures on constructive algebra that the author previously gave on two different occasions. Each chapter is self-contained. All the proofs are constructive and many illustrative examples are included.” (HaohaoWang, Mathematical Reviews, August, 2016)
Textul de pe ultima copertă
The main goal of this book is to find the constructive content hidden in abstract proofs of concrete theorems in Commutative Algebra, especially in well-known theorems concerning projective modules over polynomial rings (mainly the Quillen-Suslin theorem) and syzygies of multivariate polynomials with coefficients in a valuation ring.
Simple and constructive proofs of some results in the theory of projective modules over polynomial rings are also given, and light is cast upon recent progress on the Hermite ring and Gröbner ring conjectures. New conjectures on unimodular completion arising from our constructive approach to the unimodular completion problem are presented.
Constructive algebra can be understood as a first preprocessing step for computer algebra that leads to the discovery of general algorithms, even if they are sometimes not efficient. From a logical point of view, the dynamical evaluation gives a constructive substitute for two highly nonconstructive toolsof abstract algebra: the Law of Excluded Middle and Zorn's Lemma. For instance, these tools are required in order to construct the complete prime factorization of an ideal in a Dedekind ring, whereas the dynamical method reveals the computational content of this construction. These lecture notes follow this dynamical philosophy.
Simple and constructive proofs of some results in the theory of projective modules over polynomial rings are also given, and light is cast upon recent progress on the Hermite ring and Gröbner ring conjectures. New conjectures on unimodular completion arising from our constructive approach to the unimodular completion problem are presented.
Constructive algebra can be understood as a first preprocessing step for computer algebra that leads to the discovery of general algorithms, even if they are sometimes not efficient. From a logical point of view, the dynamical evaluation gives a constructive substitute for two highly nonconstructive toolsof abstract algebra: the Law of Excluded Middle and Zorn's Lemma. For instance, these tools are required in order to construct the complete prime factorization of an ideal in a Dedekind ring, whereas the dynamical method reveals the computational content of this construction. These lecture notes follow this dynamical philosophy.
Caracteristici
Presents a new point of view concerning problems in Commutative Algebra and Algebraic Geometry All the proofs are constructive (algorithms) and simple The reader can easily implement the presented algorithms in his preferred Computer Algebra System