Sinossi
This book is designed for a course in computational number theory. It is based around a number of difficult old problems that live at the interface of analytic, computational and Diophantine number theory. The techniques for tackling these problems are various and include probabilistic methods, combinatorial methods, Diophantine and analytic techniques. The main computational tool used is the LLL algorithm for finding small vectors in a lattice. The book is intended as an introduction to a diverse collection of techniques for solving number- theoretic problems. For all chapters, the author has suggested related research papers where additional details may be pursued. There are many exercises and open research problems included. Indeed
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Dalla quarta di copertina
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Computational Excursions in Analysis and Number Theory
Foto dell'editore
Computational Excursions in Analysis and Number Theory (CMS Books in Mathematics)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar2411530294613
Compra nuovo
EUR 103,81
Spese di spedizione:
EUR 3,46
In U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Computational Excursions in Analysis and Number Theory
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 11874466-n
Compra nuovo
EUR 105,00
Spese di spedizione:
EUR 2,29
In U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Computational Excursions in Analysis and Number Theory (CMS Books in Mathematics)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9781441930002_new
Compra nuovo
EUR 110,27
Spese di spedizione:
EUR 13,63
Da: Regno Unito a: U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Computational Excursions in Analysis and Number Theory
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 11874466-n
Compra nuovo
EUR 110,26
Spese di spedizione:
EUR 17,06
Da: Regno Unito a: U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Computational Excursions in Analysis and Number Theory
Editore:
Springer New York Dez 2010, 2010
ISBN 10: 1441930000
ISBN 13: 9781441930002
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 232 pp. Englisch. Codice articolo 9781441930002
Compra nuovo
EUR 106,99
Spese di spedizione:
EUR 23,00
Da: Germania a: U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Computational Excursions in Analysis and Number Theory
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 proble. Codice articolo 4173464
Compra nuovo
EUR 92,27
Spese di spedizione:
EUR 48,99
Da: Germania a: U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Computational Excursions in Analysis and Number Theory
Da: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Computational Excursions in Analysis and Number Theory | Peter Borwein | Taschenbuch | x | Englisch | 2010 | Humana | EAN 9781441930002 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Codice articolo 107252950
Compra nuovo
EUR 95,80
Spese di spedizione:
EUR 70,00
Da: Germania a: U.S.A.
Quantità: 5 disponibili
Immagini fornite dal venditore
Computational Excursions in Analysis and Number Theory
Editore:
Springer US, Springer New York Dez 2010, 2010
ISBN 10: 1441930000
ISBN 13: 9781441930002
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. 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 232 pp. Englisch. Codice articolo 9781441930002
Compra nuovo
EUR 106,99
Spese di spedizione:
EUR 60,00
Da: Germania a: U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Computational Excursions in Analysis and Number Theory
Editore:
Springer US, Springer New York, 2010
ISBN 10: 1441930000
ISBN 13: 9781441930002
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9781441930002
Compra nuovo
EUR 111,35
Spese di spedizione:
EUR 61,80
Da: Germania a: U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Computational Excursions in Analysis and Number Theory
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 11874466
Compra usato
EUR 174,55
Spese di spedizione:
EUR 17,06
Da: Regno Unito a: U.S.A.
Quantità: Più di 20 disponibili