Bas edixhoven (66 résultats)

Paperback. Etat : Near Fine. A nice, solid copy. ; Annals Of Mathematics Studies; Vol. 176; 6.5 X 1 X 9.5 inches; 425 pages.

Paperback. Etat : Near Fine. A nice, solid copy.; Annals of Mathematics Studies; 176; 6.5 X 1 X 9.5 inches; 425 pages.

Paperback. Etat : Very Good. Clean and solid.; Annals of Mathematics Studies; 176; 8vo; 425 pages.

Etat : New.

Hardcover. Etat : Acceptable. HARDCOVER Acceptable - This is a significantly damaged book. It should be considered a reading copy only. Please order this book only if you are interested in the content and not the condition. May be ex-library. Standard-sized.

Etat : Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,350grams, ISBN:9783540575283.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Softcover. Etat : Gut. 2. print. with minor corr. Ex-library with stamp and library-signature. GOOD condition, some traces of use. C-03066 3540575286 Sprache: Englisch Gewicht in Gramm: 550.

Hardcover. Etat : Very Good. In stock ready to dispatch from the UK.

Etat : New.

Paperback. Etat : Very Good. 75 pp. Tightly bound. Spine not compromised. Text is free of markings. No ownership markings.

kartoniert kartoniert. Etat : Sehr gut. 127 Seiten, mit Abbildungen, Zust: Gutes Exemplar. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 200.…

Etat : Gebraucht / Used. Paperback. Very good. Xii,127pp.

Etat : New.

PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - The 13 chapters of this book centre around the proof ofTheorem 1 of Faltings' paper 'Diophantine approximation onabelian varieties', Ann. Math.133 (1991) and together givean approach to the proof that is accessible to Ph.D-levelstudents in number theory and algebraic geometry. Eachchapter is based on an instructional lecture given by itsauthor ata special conference for graduate students, on thetopic of Faltings' paper.…

PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000.

Etat : As New. Unread book in perfect condition.

Etat : new.

Etat : New. Modular forms are tremendously important in various areas of mathematics, from number theory and algebraic geometry to combinatorics and lattices. This title gives an algorithm for computing coefficients of modular forms of level one in polynomial time. Editor(s): Edixhoven, Bas; Couveignes, Jean-Marc. Series: Annals of Mathematics Studies. Num Pages: 440 pages, 6 line illus. BIC Classification: PBH; PBMW. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 234 x 157 x 22. Weight in Grams: 622. . 2011. Paperback. . . . . …

Etat : New.

Paperback. Etat : New. Modular forms are tremendously important in various areas of mathematics, from number theory and algebraic geometry to combinatorics and lattices. Their Fourier coefficients, with Ramanujan's tau-function as a typical example, have deep arithmetic significance. Prior to this book, the fastest known algorithms for computing these Fourier coefficients took exponential time, except in some special cases. The case of elliptic curves (Schoof's algorithm) was at the birth of elliptic curve cryptography around 1985. This book gives an algorithm for computing coefficients of modular forms of level one in polynomial time. For example, Ramanujan's tau of a prime number p can be computed in time bounded by a fixed power of the logarithm of p. Such fast computation of Fourier coefficients is itself based on the main result of the book: the computation, in polynomial time, of Galois representations over finite fields attached to modular forms by the Langlands program. Because these Galois representations typically have a nonsolvable image, this result is a major step forward from explicit class field theory, and it could be described as the start of the explicit Langlands program.The computation of the Galois representations uses their realization, following Shimura and Deligne, in the torsion subgroup of Jacobian varieties of modular curves. The main challenge is then to perform the necessary computations in time polynomial in the dimension of these highly nonlinear algebraic varieties. Exact computations involving systems of polynomial equations in many variables take exponential time. This is avoided by numerical approximations with a precision that suffices to derive exact results from them. Bounds for the required precision--in other words, bounds for the height of the rational numbers that describe the Galois representation to be computed--are obtained from Arakelov theory. Two types of approximations are treated: one using complex uniformization and another one using geometry over finite fields. The book begins with a concise and concrete introduction that makes its accessible to readers without an extensive background in arithmetic geometry. And the book includes a chapter that describes actual computations.…

Etat : As New. Unread book in perfect condition.

Paperback. Etat : New. Modular forms are tremendously important in various areas of mathematics, from number theory and algebraic geometry to combinatorics and lattices. Their Fourier coefficients, with Ramanujan's tau-function as a typical example, have deep arithmetic significance. Prior to this book, the fastest known algorithms for computing these Fourier coefficients took exponential time, except in some special cases. The case of elliptic curves (Schoof's algorithm) was at the birth of elliptic curve cryptography around 1985. This book gives an algorithm for computing coefficients of modular forms of level one in polynomial time. For example, Ramanujan's tau of a prime number p can be computed in time bounded by a fixed power of the logarithm of p. Such fast computation of Fourier coefficients is itself based on the main result of the book: the computation, in polynomial time, of Galois representations over finite fields attached to modular forms by the Langlands program. Because these Galois representations typically have a nonsolvable image, this result is a major step forward from explicit class field theory, and it could be described as the start of the explicit Langlands program.The computation of the Galois representations uses their realization, following Shimura and Deligne, in the torsion subgroup of Jacobian varieties of modular curves. The main challenge is then to perform the necessary computations in time polynomial in the dimension of these highly nonlinear algebraic varieties. Exact computations involving systems of polynomial equations in many variables take exponential time. This is avoided by numerical approximations with a precision that suffices to derive exact results from them. Bounds for the required precision--in other words, bounds for the height of the rational numbers that describe the Galois representation to be computed--are obtained from Arakelov theory. Two types of approximations are treated: one using complex uniformization and another one using geometry over finite fields. The book begins with a concise and concrete introduction that makes its accessible to readers without an extensive background in arithmetic geometry. And the book includes a chapter that describes actual computations.…

Etat : New. pp. 440.

Etat : New. In English.