This book documents the history of pi from the dawn of mathematical time to the present. One of the beauties of the literature on pi is that it allows for the inclusion of very modern, yet accessible, mathematics. The articles on pi collected herein fall into various classes. First and foremost there is a selection from the mathematical and computational literature of four millennia. There is also a variety of historical studies on the cultural significance of the number. Additionally, there is a selection of pieces that are anecdotal, fanciful, or simply amusing.
For this...
This book documents the history of pi from the dawn of mathematical time to the present. One of the beauties of the literature on pi is that it all...
Polynomials pervade mathematics, virtually every branch of mathematics from algebraic number theory and algebraic geometry to applied analysis and computer science, has a corpus of theory arising from polynomials. The material explored in this book primarily concerns polynomials as they arise in analysis; it focuses on polynomials and rational functions of a single variable. The book is self-contained and assumes at most a senior-undergraduate familiarity with real and complex analysis. After an introduction to the geometry of polynomials and a discussion of refinements of the Fundamental...
Polynomials pervade mathematics, virtually every branch of mathematics from algebraic number theory and algebraic geometry to applied analysis and com...
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...
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 inter...
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...
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 inter...
This book presents the Riemann Hypothesis, connected problems, and a taste of the body of theory developed towards its solution. It is targeted at the educated non-expert. Almost all the material is accessible to any senior mathematics student, and much is accessible to anyone with some university mathematics. The appendices include a selection of original papers that encompass the most important milestones in the evolution of theory connected to the Riemann Hypothesis. The appendices also include some authoritative expository papers. These are the expert witnesses whose insight into this...
This book presents the Riemann Hypothesis, connected problems, and a taste of the body of theory developed towards its solution. It is targeted at ...
The research of Jonathan Borwein has had a profound impact on optimization, functional analysis, operations research, mathematical programming, number theory, and experimental mathematics. Having authored more than a dozen books and more than 300 publications, Jonathan Borwein is one of the most productive Canadian mathematicians ever. His research spans pure, applied, and computational mathematics as well as high performance computing, and continues to have an enormous impact: MathSciNet lists more than 2500 citations by more than 1250 authors, and Borwein is one of the 250 most cited...
The research of Jonathan Borwein has had a profound impact on optimization, functional analysis, operations research, mathematical programming, num...
After an introduction to the geometry of polynomials and a discussion of refinements of the Fundamental Theorem of Algebra, the book turns to a consideration of various special polynomials. Chebyshev and Descartes systems are then introduced, and Muntz systems and rational systems are examined in detail. Subsequent chapters discuss denseness questions and the inequalities satisfied by polynomials and rational functions. Appendices on algorithms and computational concerns, on the interpolation theorem, and on orthogonality and irrationality round off the text. The book is self-contained and...
After an introduction to the geometry of polynomials and a discussion of refinements of the Fundamental Theorem of Algebra, the book turns to a consid...
The research of Jonathan Borwein has had a profound impact on optimization, functional analysis, operations research, mathematical programming, number theory, and experimental mathematics. Having authored more than a dozen books and more than 300 publications, Jonathan Borwein is one of the most productive Canadian mathematicians ever. His research spans pure, applied, and computational mathematics as well as high performance computing, and continues to have an enormous impact: MathSciNet lists more than 2500 citations by more than 1250 authors, and Borwein is one of the 250 most cited...
The research of Jonathan Borwein has had a profound impact on optimization, functional analysis, operations research, mathematical programming, num...
