Champs algébriques

Champs algébriques

EnglishHardback
Laumon, Gérard
Springer, Berlin
EAN: 9783540657613
On order
Delivery on Friday, 28. of August 2026
CZK 3,056
Common price CZK 3,396
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

The theory of algebraic stacks emerged in the late sixties and early seventies in the works of P. Deligne, D. Mumford, and M. Artin. The language of algebraic stacks has been used repeatedly since then, mostly in connection with moduli problems: the increasing demand for an accurate description of moduli "spaces" came from various areas of mathematics and mathematical physics. Unfortunately the basic results on algebraic stacks were scattered in the literature and sometimes stated without proofs. The aim of this book is to fill this reference gap by providing mathematicians with the first systematic account of the general theory of (quasiseparated) algebraic stacks over an arbitrary base scheme. It covers the basic definitions and constructions, techniques for extending scheme-theoretic notions to stacks, Artin's representability theorems, but also new topics such as the "lisse-étale" topology.
EAN 9783540657613
ISBN 3540657614
Binding Hardback
Publisher Springer, Berlin
Publication date November 22, 1999
Pages 208
Language English
Dimensions 235 x 155
Country Germany
Readership Professional & Scholarly
Authors Laumon, Gerard; Moret-Bailly, L.
Illustrations XII, 208 p.
Edition 2000 ed.
Series Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge / A Series of Modern Surveys in Mathematics
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.