Balakrishnan / Elkies / Hassett | Arithmetic Geometry, Number Theory, and Computation | E-Book | sack.de
E-Book

E-Book, Englisch, 587 Seiten, eBook

Reihe: Simons Symposia

Balakrishnan / Elkies / Hassett Arithmetic Geometry, Number Theory, and Computation

E-Book, Englisch, 587 Seiten, eBook

Reihe: Simons Symposia

ISBN: 978-3-030-80914-0
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark



This volume contains articles related to the work of the Simons Collaboration “Arithmetic Geometry, Number Theory, and Computation.” The papers present mathematical results and algorithms necessary for the development of large-scale databases like the L-functions and Modular Forms Database (LMFDB). The authors aim to develop systematic tools for analyzing Diophantine properties of curves, surfaces, and abelian varieties over number fields and finite fields. The articles also explore examples important for future research.Specific topics include? algebraic varieties over finite fields? the Chabauty-Coleman method? modular forms? rational points on curves of small genus? S-unit equations and integral points.
Balakrishnan / Elkies / Hassett Arithmetic Geometry, Number Theory, and Computation jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


A robust implementation for solving the S-unit equation and several application (C. Rasmussen).- Computing classical modular forms for arbitrary congruence subgroups (E. Assaf).- Square root time Coleman integration on superelliptic curves (A. Best).- Computing classical modular forms ( A. Sutherland).- Elliptic curves with good reduction outside of the first six primes (B. Matschke).- Efficient computation of BSD invariants in genus 2 (R. van Bommel).- Restrictions on Weil polynomials of Jacobians of hyperelliptic curves (E. Costa).- Zen and the art of database maintenance (D. Roe).- Effective obstructions to lifting Tate classes from positive characteristic (E. Costa).- Conjecture: 100% of elliptic surfaces over Q have rank zero (A. Cowan).- On rational Bianchi newforms and abelian surfaces with quaternionic multiplication (J. Voight).- A database of Hilbert modular forms (J. Voight).- Isogeny classes of Abelian Varieties over Finite Fields in the LMFDB (D. Roe).- Computing rational points on genus 3 hyperelliptic curves (S. Hashimoto).- Curves with sharp Chabauty-Coleman bound (S. Gajovic).- Chabauty-Coleman computations on rank 1 Picard curves (S. Hashimoto).- Linear dependence among Hecke eigenvalues (D. Kim).- Congruent number triangles with the same hypotenuse (D. Lowry-Duda).- Visualizing modular forms (D. Lowry-Duda).- A Prym variety with everywhere good reduction over Q(v 61) ( J. Voight).- The S-integral points on the projective line minus three points via étale covers and Skolem's method (B. Poonen).


Jennifer Balakrishnan is Clare Boothe Luce Associate Professor of Mathematics and Statistics at Boston University. She holds a Ph.D. in Mathematics from the Massachusetts Institute of Technology.Noam Elkies is Professor of Mathematics at Harvard University. He holds a Ph.D. in Mathematics from Harvard University.Brendan Hassett is Professor of Mathematics at Brown University and Director of the Institute for Computational and Experimental Research in Mathematics. He holds a Ph.D. in Mathematics from Harvard University.Bjorn Poonen is Distinguished Professor in Science at the Massachusetts Institute of Technology. He holds a Ph.D. in Mathematics from the University of California at Berkeley.Andrew Sutherland is Principal Research Scientist at the Massachusetts Institute of Technology. He holds a Ph.D. in Mathematics from the Massachusetts Institute of Technology.John Voight is Professor of Mathematics at Dartmouth College. He holds a Ph.D. in Mathematics from the University of California at Berkeley.


Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.