Cycles, Transfers, and Motivic Homology Theories
Seiten
2000
Princeton University Press (Verlag)
978-0-691-04814-7 (ISBN)
Princeton University Press (Verlag)
978-0-691-04814-7 (ISBN)
- Titel ist leider vergriffen;
keine Neuauflage - Artikel merken
A collection of papers which come together to construct a motovic cohomology theory and provide the foundation for a proof of Voevodsky's Milnor Conjecture. The title is number 143 in the ANNALS OF MATHEMATICS STUDIES series.
The original goal that ultimately led to this volume was the construction of "motivic cohomology theory" whose existence was conjectured by A. Beilinson and S. Lichtenbaum. This is achieved in the book's fourth paper, using the results of the other papers, whose additional role is to contribute to our understanding of various properties of algebraic cycles. The material presented provides the foundations for the recent proof of the celebrated "Milnor Conjecture" by Vladimir Voevodsky.
The original goal that ultimately led to this volume was the construction of "motivic cohomology theory" whose existence was conjectured by A. Beilinson and S. Lichtenbaum. This is achieved in the book's fourth paper, using the results of the other papers, whose additional role is to contribute to our understanding of various properties of algebraic cycles. The material presented provides the foundations for the recent proof of the celebrated "Milnor Conjecture" by Vladimir Voevodsky.
Vladimir Voeodsky is at the Institute for Advanced Study, Princeton. Andrei Suslin and Eric M. Friedlander teach in the Department of Mathematics at Northwestern University.
| Erscheint lt. Verlag | 24.4.2000 |
|---|---|
| Reihe/Serie | Annals of Mathematics Studies |
| Zusatzinfo | Ill. |
| Verlagsort | New Jersey |
| Sprache | englisch |
| Maße | 152 x 235 mm |
| Gewicht | 510 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Algebra |
| ISBN-10 | 0-691-04814-2 / 0691048142 |
| ISBN-13 | 978-0-691-04814-7 / 9780691048147 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
