Verwandte Artikel zu Computational Excursions in Analysis and Number Theory:...
Inhaltsangabe
This introduction to computational number theory is centered on a number of problems that live at the interface of analytic, computational and Diophantine number theory, and provides a diverse collection of techniques for solving number- theoretic problems. There are many exercises and open research problems included.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Von der hinteren Coverseite
This book is designed for a computationally intensive graduate course based around a collection of classical unsolved extremal problems for polynomials. These problems, all of which lend themselves to extensive computational exploration, live at the interface of analysis, combinatorics and number theory so the techniques involved are diverse. A main computational tool used is the LLL algorithm for finding small vectors in a lattice.
Many exercises and open research problems are included. Indeed one aim of the book is to tempt the able reader into the rich possibilities for research in this area. Peter Borwein is Professor of Mathematics at Simon Fraser University and the Associate Director of the Centre for Experimental and Constructive Mathematics. He is also the recipient of the Mathematical Association of Americas Chauvenet Prize and the Merten M. Hasse Prize for expository writing in mathematics.„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 79,48
Gratis für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Computational Excursions in Analysis and Number Theory:...
Foto des Verkäufers
Computational Excursions in Analysis and Number Theory
Verlag:
Canadian Mathematical Society; Springer, 2002
ISBN 10: 0387954449
ISBN 13: 9780387954448
Gebraucht
Hardcover
Anbieter: Attic Books (ABAC, ILAB), London, ON, Kanada
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: ex library-good. CMS Books in Mathematics 10. x, 220 p. 24 cm. B&w illustrations. Ex library with labels on spine and front cover. Ink stamps on top edge and title. Artikel-Nr. 149487
Anzahl: 1 verfügbar
Foto des Verkäufers
Computational Excursions in Analysis and Number Theory
Anbieter: Attic Books (ABAC, ILAB), London, ON, Kanada
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Near fine. CMS Books in Mathematics. x, 220 p. 24 cm. Ink signature on first leaf. Artikel-Nr. 133660
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Computational Excursions In Analysis And Number Theory
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Artikel-Nr. ABNR-83982
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Computational Excursions in Analysis and Number Theory
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: Used. pp. 236 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Artikel-Nr. 7589918
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Computational Excursions in Analysis and Number Theory
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: Used. pp. 236. Artikel-Nr. 18290763
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Computational Excursions in Analysis and Number Theory (CMS Books in Mathematics)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Artikel-Nr. ria9780387954448_new
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Computational Excursions in Analysis and Number Theory
Verlag:
Springer New York, Springer US Jul 2002, 2002
ISBN 10: 0387954449
ISBN 13: 9780387954448
Neu
Hardcover
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. Neuware -This book is designed for a topics course in computational number theory. It is based around a number of difficult old problems that live at the interface of analysis and number theory. Some of these problems are the following: The Integer Chebyshev Problem. Find a nonzero polynomial of degree n with integer eoeffieients that has smallest possible supremum norm on the unit interval. Littlewood's Problem. Find a polynomial of degree n with eoeffieients in the set { + 1, -I} that has smallest possible supremum norm on the unit disko The Prouhet-Tarry-Escott Problem. Find a polynomial with integer co effieients that is divisible by (z - l)n and has smallest possible 1 norm. (That 1 is, the sum of the absolute values of the eoeffieients is minimal.) Lehmer's Problem. Show that any monie polynomial p, p(O) i- 0, with in teger coefficients that is irreducible and that is not a cyclotomic polynomial has Mahler measure at least 1.1762 . All of the above problems are at least forty years old; all are presumably very hard, certainly none are completely solved; and alllend themselves to extensive computational explorations. The techniques for tackling these problems are various and include proba bilistic methods, combinatorial methods, 'the circle method,' and Diophantine and analytic techniques. Computationally, the main tool is the LLL algorithm for finding small vectors in a lattice. The book is intended as an introduction to a diverse collection of techniques.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 236 pp. Englisch. Artikel-Nr. 9780387954448
Anzahl: 2 verfügbar
Foto des Verkäufers
Computational Excursions in Analysis and Number Theory
Verlag:
Springer New York, Springer US, 2002
ISBN 10: 0387954449
ISBN 13: 9780387954448
Neu
Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is designed for a topics course in computational number theory. It is based around a number of difficult old problems that live at the interface of analysis and number theory. Some of these problems are the following: The Integer Chebyshev Problem. Find a nonzero polynomial of degree n with integer eoeffieients that has smallest possible supremum norm on the unit interval. Littlewood's Problem. Find a polynomial of degree n with eoeffieients in the set { + 1, -I} that has smallest possible supremum norm on the unit disko The Prouhet-Tarry-Escott Problem. Find a polynomial with integer co effieients that is divisible by (z - l)n and has smallest possible 1 norm. (That 1 is, the sum of the absolute values of the eoeffieients is minimal.) Lehmer's Problem. Show that any monie polynomial p, p(O) i- 0, with in teger coefficients that is irreducible and that is not a cyclotomic polynomial has Mahler measure at least 1.1762 . All of the above problems are at least forty years old; all are presumably very hard, certainly none are completely solved; and alllend themselves to extensive computational explorations. The techniques for tackling these problems are various and include proba bilistic methods, combinatorial methods, 'the circle method,' and Diophantine and analytic techniques. Computationally, the main tool is the LLL algorithm for finding small vectors in a lattice. The book is intended as an introduction to a diverse collection of techniques. Artikel-Nr. 9780387954448
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Computational Excursions in Analysis and Number Theory
Anbieter: Buchpark, Trebbin, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Artikel-Nr. 1045453/202
Anzahl: 1 verfügbar