Experimental Mathematics is a recently structured field of Mathematics that uses a computer and advanced computing technology as tools to perform experiments such as analysis of examples, testing of new ideas, and the search of patterns.
These proceedings reflect the special session on Experimental Mathematics held January 5, 2009, at the Joint Mathematics Meetings in Washington, DC as well as some papers specially solicited for this volume. Experimental Mathematics is a recently structured field of Mathematics that uses the computer and advanced computing technology as a tool to perform experiments. These include the analysis of examples, testing of new ideas, and the search of patterns to suggest results and to complement existing analytical rigor. The development of a broad spectrum of mathematical software products, such as MathematicaR and MapleTM, has allowed mathematicians of diverse backgrounds and interests to use the computer as an essential tool as part of their daily work environment. This volume reflects a wide range of topics related to the young field of Experimental Mathematics. The use of computation varies from aiming to exclude human input in the solution of a problem to traditional mathematical questions for which computation is a prominent tool.
A quiet revolution in mathematical computing and scientific visualization took place in the latter half of the 20th century. These developments have dramatically enhanced modes of mathematical insight and opportunities for "exploratory" computational experimentation. This volume collects the experimental and computational contributions of Jonathan and Peter Borwein over the past quarter century.
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 mathematicians of the period 1980-1999. He has served the Canadian Mathematics Community through his presidency (2000–02) as well as his 15 years of editing the CMS book series. Jonathan Borwein’s vision and initiative have been crucial in initiating and developing several institutions that provide support for researchers with a wide range of scientific interests. A few notable examples include the Centre for Experimental and Constructive Mathematics and the IRMACS Centre at Simon Fraser University, the Dalhousie Distributed Research Institute at Dalhousie University, the Western Canada Research Grid, and the Centre for Computer Assisted Research Mathematics and its Applications, University of Newcastle. The workshops that were held over the years in Dr. Borwein’s honor attracted high-caliber scientists from a wide range of mathematical fields. This present volume is an outgrowth of the workshop on ‘Computational and Analytical Mathematics’ held in May 2011 in celebration of Dr. Borwein’s 60th Birthday. The collection contains various state-of-the-art research manuscripts and surveys presenting contributions that have risen from the conference, and is an excellent opportunity to survey state-of-the-art research and discuss promising research directions and approaches.
This volume contains the proceedings of a conference held in July, 2007 at the University of Minnesota, Duluth, in honor of Joseph A. Gallian's 65th birthday and the 30th anniversary of the Duluth Research Experience for Undergraduates. In keeping with Gallian's extraordinary expository ability and broad mathematical interests, the articles in this volume span a wide variety of mathematical topics, including algebraic topology, combinatorics, design theory, forcing, game theory, geometry, graph theory, group theory, optimization, and probability. Some of the papers are purely expository while others are research articles. The papers are intended to be accessible to a general mathematics audience, including first-year or second-year graduate students. This volume should be especially useful for mathematicians seeking a new research area, as well as those looking to enrich themselves and their research programs by learning about problems and techniques used in other areas of mathematics.
Developmental biology and tumour growth are two important areas of current research where mathematics increasingly provides powerful new techniques and insights. The unfolding complexity of living structures from egg to embryo gives rise to a number of difficult quantitative problems that are ripe for mathematical models and analysis. Understanding this early development process involves the study of pattern formation, which mathematicians view through the lens of dynamical systems. This book addresses several issues in developmental biology, including Notch signalling pathway integration and mesenchymal compartment formation. Tumour growth is one of the primary challenges of cancer research. Its study requires interdisciplinary approaches involving the close collaboration of mathematicians, biologists and physicians. The summer school addressed angiogenesis, modelling issues arising in radiotherapy, and tumour growth viewed from the individual cell and the relation to a multiphase-fluid flow picture of that process. This book is suitable for researchers, graduate students, and advanced undergraduates interested in mathematical methods of developmental biology or tumour growth.
This book presents the basic concepts and algorithms of computer algebra using practical examples that illustrate their actual use in symbolic computation. A wide range of topics are presented, including: Groebner bases, real algebraic geometry, lie algebras, factorization of polynomials, integer programming, permutation groups, differential equations, coding theory, automatic theorem proving, and polyhedral geometry. This book is a must read for anyone working in the area of computer algebra, symbolic computation, and computer science.
"This volume contains articles based on talks presented at the Thirteenth Conference of African American Researchers in the Mathematical Sciences (CAARMS), held at Northeastern University and the University of Massachusetts, Boston on June 19-22, 2007. The representation theory of Lie groups and its applications were a major focus of the talks."--BOOK JACKET.
In the spring of 1976, George Andrews of Pennsylvania State University visited the library at Trinity College, Cambridge, to examine the papers of the late G.N. Watson. Among these papers, Andrews discovered a sheaf of 138 pages in the handwriting of Srinivasa Ramanujan. This manuscript was soon designated, "Ramanujan's lost notebook." Its discovery has frequently been deemed the mathematical equivalent of finding Beethoven's tenth symphony. This volume is the fourth of five volumes that the authors plan to write on Ramanujan’s lost notebook. In contrast to the first three books on Ramanujan's Lost Notebook, the fourth book does not focus on q-series. Most of the entries examined in this volume fall under the purviews of number theory and classical analysis. Several incomplete manuscripts of Ramanujan published by Narosa with the lost notebook are discussed. Three of the partial manuscripts are on diophantine approximation, and others are in classical Fourier analysis and prime number theory. Most of the entries in number theory fall under the umbrella of classical analytic number theory. Perhaps the most intriguing entries are connected with the classical, unsolved circle and divisor problems. Review from the second volume: "Fans of Ramanujan's mathematics are sure to be delighted by this book. While some of the content is taken directly from published papers, most chapters contain new material and some previously published proofs have been improved. Many entries are just begging for further study and will undoubtedly be inspiring research for decades to come. The next installment in this series is eagerly awaited." - MathSciNet Review from the first volume: "Andrews and Berndt are to be congratulated on the job they are doing. This is the first step...on the way to an understanding of the work of the genius Ramanujan. It should act as an inspiration to future generations of mathematicians to tackle a job that will never be complete." - Gazette of the Australian Mathematical Society
This book contains a compendium of 25 papers published since the 1970s dealing with pi and associated topics of mathematics and computer science. The collection begins with a Foreword by Bruce Berndt. Each contribution is preceded by a brief summary of its content as well as a short key word list indicating how the content relates to others in the collection. The volume includes articles on actual computations of pi, articles on mathematical questions related to pi (e.g., “Is pi normal?”), articles presenting new and often amazing techniques for computing digits of pi (e.g., the “BBP” algorithm for pi, which permits one to compute an arbitrary binary digit of pi without needing to compute any of the digits that came before), papers presenting important fundamental mathematical results relating to pi, and papers presenting new, high-tech techniques for analyzing pi (i.e., new graphical techniques that permit one to visually see if pi and other numbers are “normal”). This volume is a companion to Pi: A Source Book whose third edition released in 2004. The present collection begins with 2 papers from 1976, published by Eugene Salamin and Richard Brent, which describe “quadratically convergent” algorithms for pi and other basic mathematical functions, derived from some mathematical work of Gauss. Bailey and Borwein hold that these two papers constitute the beginning of the modern era of computational mathematics. This time period (1970s) also corresponds with the introduction of high-performance computer systems (supercomputers), which since that time have increased relentlessly in power, by approximately a factor of 100,000,000, advancing roughly at the same rate as Moore’s Law of semiconductor technology. This book may be of interest to a wide range of mathematical readers; some articles cover more advanced research questions suitable for active researchers in the field, but several are highly accessible to undergraduate mathematics students.