This book offers a unique account on the life and works of Srinivasa Ramanujan-often hailed as the greatest "natural" mathematical genius. Sharing valuable insights into the many stages of Ramanujan's life, this book provides glimpses into his prolific research on highly composite numbers, partitions, continued fractions, mock theta functions, arithmetic, and hypergeometric functions which led the author to discover a new summation theorem. It also includes the list of Ramanujan's collected papers, letters and other material present at the Wren Library, Trinity College in Cambridge, UK. This book is a valuable resource for all readers interested in Ramanujan's life, work and indelible contributions to mathematics.

Gathered from the 2016 Gainesville Number Theory Conference honoring Krishna Alladi on his 60th birthday, these proceedings present recent research in number theory. Extensive and detailed, this volume features 40 articles by leading researchers on topics in analytic number theory, probabilistic number theory, irrationality and transcendence, Diophantine analysis, partitions, basic hypergeometric series, and modular forms. Readers will also find detailed discussions of several aspects of the path-breaking work of Srinivasa Ramanujan and its influence on current research. Many of the papers were motivated by Alladi's own research on partitions and q-series as well as his earlier work in number theory. Alladi is well known for his contributions in number theory and mathematics. His research interests include combinatorics, discrete mathematics, sieve methods, probabilistic and analytic number theory, Diophantine approximations, partitions and q-series identities. Graduate students and researchers will find this volume a valuable resource on new developments in various aspects of number theory.

Model theory is the meta-mathematical study of the concept of mathematical truth. After Afred Tarski coined the term Theory of Models in the early 1950's, it rapidly became one of the central most active branches of mathematical logic. In the last few decades, ideas that originated within model theory have provided powerful tools to solve problems in a variety of areas of classical mathematics, including algebra, combinatorics, geometry, number theory, and Banach space theory and operator theory. The two volumes of Beyond First Order Model Theory present the reader with a fairly comprehensive vista, rich in width and depth, of some of the most active areas of contemporary research in model theory beyond the realm of the classical first-order viewpoint. Each chapter is intended to serve both as an introduction to a current direction in model theory and as a presentation of results that are not available elsewhere. All the articles are written so that they can be studied independently of one another. This second volume contains introductions to real-valued logic and applications, abstract elementary classes and applications, interconnections between model theory and function spaces, nonstucture theory, and model theory of second-order logic. Features A coherent introduction to current trends in model theory. Contains articles by some of the most influential logicians of the last hundred years. No other publication brings these distinguished authors together. Suitable as a reference for advanced undergraduate, postgraduates, and researchers. Material presented in the book (e.g, abstract elementary classes, first-order logics with dependent sorts, and applications of infinitary logics in set theory) is not easily accessible in the current literature. The various chapters in the book can be studied independently.

This book gathers together selected contributions presented at the 3rd Moroccan Andalusian Meeting on Algebras and their Applications, held in Chefchaouen, Morocco, April 12-14, 2018, and which reflects the mathematical collaboration between south European and north African countries, mainly France, Spain, Morocco, Tunisia and Senegal. The book is divided in three parts and features contributions from the following fields: algebraic and analytic methods in associative and non-associative structures; homological and categorical methods in algebra; and history of mathematics. Covering topics such as rings and algebras, representation theory, number theory, operator algebras, category theory, group theory and information theory, it opens up new avenues of study for graduate students and young researchers. The findings presented also appeal to anyone interested in the fields of algebra and mathematical analysis.

This book deals with the development of Diophantine problems starting with Thue's path breaking result and culminating in Roth's theorem with applications. It discusses classical results including Hermite-Lindemann-Weierstrass theorem, Gelfond-Schneider theorem, Schmidt's subspace theorem and more. It also includes two theorems of Ramachandra which are not widely known and other interesting results derived on the values of Weierstrass elliptic function. Given the constantly growing number of applications of linear forms in logarithms, it is becoming increasingly important for any student wanting to work in this area to know the proofs of Baker's original results. This book presents Baker's original results in a format suitable for graduate students, with a focus on presenting the content in an accessible and simple manner. Each student-friendly chapter concludes with selected problems in the form of "Exercises" and interesting information presented as "Notes," intended to spark readers' curiosity.

This graduate-level textbook provides an elementary exposition of the theory of automorphic representations and L-functions for the general linear group in an adelic setting. Definitions are kept to a minimum and repeated when reintroduced so that the book is accessible from any entry point, and with no prior knowledge of representation theory. The book includes concrete examples of global and local representations of GL(n), and presents their associated L-functions. In Volume 1, the theory is developed from first principles for GL(1), then carefully extended to GL(2) with complete detailed proofs of key theorems. Several proofs are presented for the first time, including Jacquet's simple and elegant proof of the tensor product theorem. In Volume 2, the higher rank situation of GL(n) is given a detailed treatment. Containing numerous exercises by Xander Faber, this book will motivate students and researchers to begin working in this fertile field of research.

This book deals with the characterization of extensions of number fields in terms of the decomposition of prime ideals, and with the group-theoretic questions arising from this number-theoretic problem. One special aspect of this question is the equality of Dedekind zeta functions of different number fields. This is an established problem which was solved for abelian extensions by class field theory, but which was only studied in detail in its general form from around 1970. The basis for the new results was a fruitful exchange between number theory and group theory. Some of the outstanidng results are based on the complete classification of all finite simple groups. This book reports on the great progress achieved in this period. It allows access to the new developments in this part of algebraic number theory and contains a unique blend of number theory and group theory. The results appear for the first time in a monograph and they partially extend the published literature.

This book presents the development of Prime Number Theory from its beginnings until the end of the first decade of the XXth century. Special emphasis is given to the work of Cebysev, Dirichlet, Riemann, Vallée-Poussin, Hadamard and Landau. The book presents the principal results with proofs and also gives, mostly in short comments, an overview of the development in the last 80 years. It is, however, not a historical book since it does not give biographical details of the people who have played a role in the development of Prime Number Theory. The book contains a large list of references with more than 1800 items. It can be read by any person with a knowledge of fundamental notions of number theory and complex analysis.

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.

Srinivasa Ramanujan is, arguably, the greatest mathematician that India has produced. His story is quite unusual: although he had no formal education inmathematics, he taught himself, and managed to produce many important new results. With the support of the English number theorist G. H. Hardy, Ramanujan received a scholarship to go to England and study mathematics. He died very young, at the age of 32, leaving behind three notebooks containing almost 3000 theorems, virtually all without proof. G. H. Hardy and others strongly urged that notebooks be edited and published, and the result is this series of books. This volume dealswith Chapters 1-9 of Book II; each theorem is either proved, or a reference to a proof is given.

Introduction to Number Theory covers the essential content of an introductory number theory course including divisibility and prime factorization, congruences, and quadratic reciprocity. The instructor may also choose from a collection of additional topics. Aligning with the trend toward smaller, essential texts in mathematics, the author strives for clarity of exposition. Proof techniques and proofs are presented slowly and clearly. The book employs a versatile approach to the use of algebraic ideas. Instructors who wish to put this material into a broader context may do so, though the author introduces these concepts in a non-essential way. A final chapter discusses algebraic systems (like the Gaussian integers) presuming no previous exposure to abstract algebra. Studying general systems urges students realize unique factorization into primes is a more subtle idea than may at first appear; students will find this chapter interesting, fun and quite accessible. Applications of number theory include several sections on cryptography and other applications to further interest instructors and students alike.

Theta functions were studied extensively by Ramanujan. This book provides a systematic development of Ramanujan's results and extends them to a general theory. The author's treatment of the subject is comprehensive, providing a detailed study of theta functions and modular forms for levels up to 12. Aimed at advanced undergraduates, graduate students, and researchers, the organization, user-friendly presentation, and rich source of examples, lends this book to serve as a useful reference, a pedagogical tool, and a stimulus for further research. Topics, especially those discussed in the second half of the book, have been the subject of much recent research; many of which are appearing in book form for the first time. Further results are summarized in the numerous exercises at the end of each chapter.

From the Foreword: "Dietmar Hildenbrand's new book, Introduction to Geometric Algebra Computing, in my view, fills an important gap in Clifford's geometric algebra literature...I can only congratulate the author for the daring simplicity of his novel educational approach taken in this book, consequently combined with hands on computer based exploration. Without noticing, the active reader will thus educate himself in elementary geometric algebra algorithm development, geometrically intuitive, highly comprehensible, and fully optimized." --Eckhard Hitzer, International Christian University, Tokyo, Japan Geometric Algebra is a very powerful mathematical system for an easy and intuitive treatment of geometry, but the community working with it is still very small. The main goal of this book is to close this gap with an introduction to Geometric Algebra from an engineering/computing perspective. This book is intended to give a rapid introduction to computing with Geometric Algebra and its power for geometric modeling. From the geometric objects point of view, it focuses on the most basic ones, namely points, lines and circles. This algebra is called Compass Ruler Algebra, since it is comparable to working with a compass and ruler. The book explores how to compute with these geometric objects, and their geometric operations and transformations, in a very intuitive way. The book follows a top-down approach, and while it focuses on 2D, it is also easily expandable to 3D computations. Algebra in engineering applications such as computer graphics, computer vision and robotics are also covered.

This book presents state-of-the-art research and survey articles that highlight work done within the Priority Program SPP 1489 "Algorithmic and Experimental Methods in Algebra, Geometry and Number Theory", which was established and generously supported by the German Research Foundation (DFG) from 2010 to 2016. The goal of the program was to substantially advance algorithmic and experimental methods in the aforementioned disciplines, to combine the different methods where necessary, and to apply them to central questions in theory and practice. Of particular concern was the further development of freely available open source computer algebra systems and their interaction in order to create powerful new computational tools that transcend the boundaries of the individual disciplines involved. The book covers a broad range of topics addressing the design and theoretical foundations, implementation and the successful application of algebraic algorithms in order to solve mathematical research problems. It offers a valuable resource for all researchers, from graduate students through established experts, who are interested in the computational aspects of algebra, geometry, and/or number theory.

Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations. The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book are designed so that even those high school students and teachers who are interested in combinatorics can have the benefit of them. Still, the book collects vast, up-to-date information for many counting sequences (especially, related to set partitions and permutations), so it is a must-have piece for those mathematicians who do research on enumerative combinatorics. In addition, the book contains number theoretical results on counting sequences of set partitions and permutations, so number theorists who would like to see nice applications of their area of interest in combinatorics will enjoy the book, too. Features The Outlook sections at the end of each chapter guide the reader towards topics not covered in the book, and many of the Outlook items point towards new research problems. An extensive bibliography and tables at the end make the book usable as a standard reference. Citations to results which were scattered in the literature now become easy, because huge parts of the book (especially in parts II and III) appear in book form for the first time.

Adrien-Marie Legendre (1752-1833), one of the great French mathematicians active in the Revolutionary period, made important contributions to number theory, statistics, mathematical analysis and algebra. He taught at the Ecole Militaire, where he was a colleague of Laplace, and made his name with a paper on the trajectory of projectiles which won a prize of the Berlin Academy in 1782, and brought him to the attention of Lagrange. In 1794 he published Elements de geometrie, which remained a textbook for over 100 years. The first edition of his Essai sur la theorie des nombres was published in 1798, and the much improved second edition, which is offered here, in 1808. In it Legendre had taken account of criticism by Gauss of the mathematical proofs in the first edition, though he was bitter at the manner in which his younger rival had claimed credit for some of his solutions.

Exploring the Riemann Zeta Function: 190 years from Riemann's Birth presents a collection of chapters contributed by eminent experts devoted to the Riemann Zeta Function, its generalizations, and their various applications to several scientific disciplines, including Analytic Number Theory, Harmonic Analysis, Complex Analysis, Probability Theory, and related subjects. The book focuses on both old and new results towards the solution of long-standing problems as well as it features some key historical remarks. The purpose of this volume is to present in a unified way broad and deep areas of research in a self-contained manner. It will be particularly useful for graduate courses and seminars as well as it will make an excellent reference tool for graduate students and researchers in Mathematics, Mathematical Physics, Engineering and Cryptography.

In recent times, group theory has found wider applications in various fields of algebra and mathematics in general. But in order to apply this or that result, you need to know about it, and such results are often diffuse and difficult to locate, necessitating that readers construct an extended search through multiple monographs, articles, and papers. Such readers must wade through the morass of concepts and auxiliary statements that are needed to understand the desired results, while it is initially unclear which of them are really needed and which ones can be dispensed with. A further difficulty that one may encounter might be concerned with the form or language in which a given result is presented. For example, if someone knows the basics of group theory, but does not know the theory of representations, and a group theoretical result is formulated in the language of representation theory, then that person is faced with the problem of translating this result into the language with which they are familiar, etc. Infinite Groups: A Roadmap to Some Classical Areas seeks to overcome this challenge. The book covers a broad swath of the theory of infinite groups, without giving proofs, but with all the concepts and auxiliary results necessary for understanding such results. In other words, this book is an extended directory, or a guide, to some of the more established areas of infinite groups. Features An excellent resource for a subject formerly lacking an accessible and in-depth reference Suitable for graduate students, PhD students, and researchers working in group theory Introduces the reader to the most important methods, ideas, approaches, and constructions in infinite group theory.

The theory of sets of multiples, a subject which lies at the intersection of analytic and probabilistic number theory, has seen much development since the publication of Sequences by Halberstam and Roth nearly thirty years ago. The area is rich in problems, many of them still unsolved or arising from current work. The author sets out to give a coherent, essentially self-contained account of the existing theory and at the same time to bring the reader to the frontiers of research. One of the fascinations of the theory is the variety of methods applicable to it, which include Fourier analysis, group theory, high and ultra-low moments, probability and elementary inequalities, as well as several branches of number theory. This Tract is the first devoted to the subject, and will be of value to research workers or graduate students in number theory.

This book is the English translation of Baumgart's thesis on the early proofs of the quadratic reciprocity law ("UEber das quadratische Reciprocitatsgesetz. Eine vergleichende Darstellung der Beweise"), first published in 1885. It is divided into two parts. The first part presents a very brief history of the development of number theory up to Legendre, as well as detailed descriptions of several early proofs of the quadratic reciprocity law. The second part highlights Baumgart's comparisons of the principles behind these proofs. A current list of all known proofs of the quadratic reciprocity law, with complete references, is provided in the appendix. This book will appeal to all readers interested in elementary number theory and the history of number theory.

This book is summarizing the results of the workshop "Uniform Distribution and Quasi-Monte Carlo Methods" of the RICAM Special Semester on "Applications of Algebra and Number Theory" in October 2013. The survey articles in this book focus on number theoretic point constructions, uniform distribution theory, and quasi-Monte Carlo methods. As deterministic versions of the Monte Carlo method, quasi-Monte Carlo rules enjoy increasing popularity, with many fruitful applications in mathematical practice, as for example in finance, computer graphics, and biology. The goal of this book is to give an overview of recent developments in uniform distribution theory, quasi-Monte Carlo methods, and their applications, presented by leading experts in these vivid fields of research.

Klaus Roth's pioneering research in the field of number theory has led to important and substantial breakthroughs in many areas, including sieve theory, diophantine approximation, and irregularities of distribution. His work on the Thue-Siegel-Roth Theorem earned him a Fields Medal in 1958 - the first British mathematician to receive the honour. Analytic Number Theory: Essays in Honour of Klaus Roth comprises 32 essays from close colleagues and leading experts in those fields in which he has worked, and provides a great insight into the historical development of the subject matter and the importance of Roth's contributions to number theory and beyond. His influence is also discussed in relation to more recent mathematical advances. Extensive lists of references make this a valuable source for research mathematicians in many areas, an introductory overview of the subject for beginning research students, and a fitting long-awaited tribute to a great mathematician.

This is an account of the proceedings of a very successful symposium of Transcendental Number Theory held in Durham in 1986. Most of the leading international specialists were present and the lectures reflected the great advances that have taken place in this area. Indeed, the evolution of transcendence into a fertile theory with numerous and widespread applications has been one of the most exciting developments of modern mathematics. The papers cover all the main branches of the subject, and include not only definitive research but valuable survey articles. The work as a whole is an important contribution to mathematics and will be of considerable influence in the further direction of transcendence theory as well as an authoritative account of its current state.

Number theory is one of the oldest and most appealing areas of mathematics. Computation has always played a role in number theory, a role which has increased dramatically in the last 20 or 30 years, both because of the advent of modern computers, and because of the discovery of surprising and powerful algorithms. As a consequence, algorithmic number theory has gradually emerged as an important and distinct field with connections to computer science and cryptography as well as other areas of mathematics. This text provides a comprehensive introduction to algorithmic number theory for beginning graduate students, written by the leading experts in the field. It includes several articles that cover the essential topics in this area, and in addition, there are contributions pointing in broader directions, including cryptography, computational class field theory, zeta functions and L-series, discrete logarithm algorithms, and quantum computing.