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 monograph presents recent developments of the theory of algebraic dynamical systems and their applications to computer sciences, cryptography, cognitive sciences, psychology, image analysis, and numerical simulations. The most important mathematical results presented in this book are in the fields of ergodicity, p-adic numbers, and noncommutative groups. For students and researchers working on the theory of dynamical systems, algebra, number theory, measure theory, computer sciences, cryptography, and image analysis.

This is the most comprehensive survey of the mathematical life of the legendary Paul Erdos (1913-1996), one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erdos' research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 1000 pages, arranged into two volumes. These volumes contain both high level research articles as well as key articles that survey some of the cornerstones of Erdos' work, each written by a leading world specialist in the field. A special chapter "Early Days", rare photographs, and art related to Erdos complement this striking collection. A unique contribution is the bibliography on Erdos' publications: the most comprehensive ever published. This new edition, dedicated to the 100th anniversary of Paul Erdos' birth, contains updates on many of the articles from the two volumes of the first edition, several new articles from prominent mathematicians, a new introduction, and more biographical information about Paul Erdos with an updated list of publications. The second volume contains chapters on graph theory and combinatorics, extremal and Ramsey theory, and a section on infinity that covers Erdos' research on set theory. All of these chapters are essentially updated, particularly the extremal theory chapter that contains a survey of flag algebras, a new technique for solving extremal problems.

Serge Lang was an iconic figure in mathematics, both for his own important work and for the indelible impact he left on the field of mathematics, on his students, and on his colleagues. Over the course of his career, Lang traversed a tremendous amount of mathematical ground. As he moved from subject to subject, he found analogies that led to important questions in such areas as number theory, arithmetic geometry, and the theory of negatively curved spaces. Lang's conjectures will keep many mathematicians occupied far into the future. In the spirit of Lang's vast contribution to mathematics, this memorial volume contains articles by prominent mathematicians in a variety of areas of the field, namely Number Theory, Analysis, and Geometry, representing Lang's own breadth of interest and impact. A special introduction by John Tate includes a brief and fascinating account of the Serge Lang's life. This volume's group of 6 editors are also highly prominent mathematicians and were close to Serge Lang, both academically and personally. The volume is suitable to research mathematicians in the areas of Number Theory, Analysis, and Geometry.

The author offers a thorough presentation of the classical theory of algebraic numbers and algebraic functions which both in its conception and in many details differs from the current literature on the subject. The basic features are: Field-theoretic preliminaries and a detailed presentation of Dedekind's ideal theory including non-principal orders and various types of class groups; the classical theory of algebraic number fields with a focus on quadratic, cubic and cyclotomic fields; basics of the analytic theory including the prime ideal theorem, density results and the determination of the arithmetic by the class group; a thorough presentation of valuation theory including the theory of difference, discriminants, and higher ramification. The theory of function fields is based on the ideal and valuation theory developed before; it presents the Riemann-Roch theorem on the basis of Weil differentials and highlights in detail the connection with classical differentials. The theory of congruence zeta functions and a proof of the Hasse-Weil theorem represent the culminating point of the volume. The volume is accessible with a basic knowledge in algebra and elementary number theory. It empowers the reader to follow the advanced number-theoretic literature, and is a solid basis for the study of the forthcoming volume on the foundations and main results of class field theory. Key features: * A thorough presentation of the theory of Algebraic Numbers and Algebraic Functions on an ideal and valuation-theoretic basis. * Several of the topics both in the number field and in the function field case were not presented before in this context. * Despite presenting many advanced topics, the text is easily readable. Franz Halter-Koch is professor emeritus at the university of Graz. He is the author of "Ideal Systems" (Marcel Dekker,1998), "Quadratic Irrationals" (CRC, 2013), and a co-author of "Non-Unique Factorizations" (CRC 2006).

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 fifth and final installment of the authors' examination of Ramanujan's lost notebook focuses on the mock theta functions first introduced in Ramanujan's famous Last Letter. This volume proves all of the assertions about mock theta functions in the lost notebook and in the Last Letter, particularly the celebrated mock theta conjectures. Other topics feature Ramanujan's many elegant Euler products and the remaining entries on continued fractions not discussed in the preceding volumes. 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

A remarkable interplay exists between the fields of elliptic functions and orthogonal polynomials. In the first monograph to explore their connections, Elliptic Polynomials combines these two areas of study, leading to an interesting development of some basic aspects of each. It presents new material about various classes of polynomials and about the odd Jacobi elliptic functions and their inverses. The term elliptic polynomials refers to the polynomials generated by odd elliptic integrals and elliptic functions. In studying these, the authors consider such things as orthogonality and the construction of weight functions and measures, finding structure constants and interesting inequalities, and deriving useful formulas and evaluations. Although some of the material may be familiar, it establishes a new mathematical field that intersects with classical subjects at many points. Its wealth of information on important properties of polynomials and clear, accessible presentation make Elliptic Polynomials valuable to those in real and complex analysis, number theory, and combinatorics, and will undoubtedly generate further research.

The first thing you will find out about this book is that it is fun to read. It is meant for the browser, as well as for the student and for the specialist wanting to know about the area. The footnotes give an historical background to the text, in addition to providing deeper applications of the concept that is being cited. This allows the browser to look more deeply into the history or to pursue a given sideline. Those who are only marginally interested in the area will be able to read the text, pick up information easily, and be entertained at the same time by the historical and philosophical digressions. It is rich in structure and motivation in its concentration upon quadratic orders. This is not a book that is primarily about tables, although there are 80 pages of appendices that contain extensive tabular material (class numbers of real and complex quadratic fields up to 104; class group structures; fundamental units of real quadratic fields; and more!). This book is primarily a reference book and graduate student text with more than 200 exercises and a great deal of hints! The motivation for the text is best given by a quote from the Preface of Quadratics: "There can be no stronger motivation in mathematical inquiry than the search for truth and beauty. It is this author's long-standing conviction that number theory has the best of both of these worlds. In particular, algebraic and computational number theory have reached a stage where the current state of affairs richly deserves a proper elucidation. It is this author's goal to attempt to shine the best possible light on the subject."

This edited review book on Godunov methods contains 97 articles, all of which were presented at the international conference on Godunov Methods: Theory and Applications, held at Oxford, in October 1999, to commemorate the 70th birthday of the Russian mathematician Sergei K. Godunov. The central theme of this book is numerical methods for hyperbolic conservation laws following Godunov's key ideas contained in his celebrated paper of 1959. Hyperbolic conservation laws play a central role in mathematical modelling in several distinct disciplines of science and technology. Application areas include compressible, single (and multiple) fluid dynamics, shock waves, meteorology, elasticity, magnetohydrodynamics, relativity, and many others. The successes in the design and application of new and improved numerical methods of the Godunov type for hyperbolic conservation laws in the last twenty years have made a dramatic impact in these application areas. The 97 papers cover a very wide range of topics, such as design and analysis of numerical schemes, applications to compressible and incompressible fluid dynamics, multi-phase flows, combustion problems, astrophysics, environmental fluid dynamics, and detonation waves. This book will be a reference book on the subject of numerical methods for hyperbolic partial differential equations for many years to come. All contributions are self-contained but do contain a review element. There is a key paper by Peter Sweby in which a general overview of Godunov methods is given. This contribution is particularly suitable for beginners on the subject. This book is unique: it contains virtually everything concerned with Godunov-type methods for conservation laws. As such it will be of particular interest to academics (applied mathematicians, numerical analysts, engineers, environmental scientists, physicists, and astrophysicists) involved in research on numerical methods for partial differential equations; scientists and engineers concerned with new numerical methods and applications to scientific and engineering problems e.g., mechanical engineers, aeronautical engineers, meteorologists; and academics involved in teaching numerical methods for partial differential equations at the postgraduate level.

This book is an introduction to the algorithmic aspects of number theory and its applications to cryptography, with special emphasis on the RSA cryptosys-tem. It covers many of the familiar topics of elementary number theory, all with an algorithmic twist. The text also includes many interesting historical notes.

Noncommutative Geometry and Cayley-smooth Orders explains the theory of Cayley-smooth orders in central simple algebras over function fields of varieties. In particular, the book describes the etale local structure of such orders as well as their central singularities and finite dimensional representations. After an introduction to partial desingularizations of commutative singularities from noncommutative algebras, the book presents the invariant theoretic description of orders and their centers. It proceeds to introduce etale topology and its use in noncommutative algebra as well as to collect the necessary material on representations of quivers. The subsequent chapters explain the etale local structure of a Cayley-smooth order in a semisimple representation, classify the associated central singularity to smooth equivalence, describe the nullcone of these marked quiver representations, and relate them to the study of all isomorphism classes of n-dimensional representations of a Cayley-smooth order. The final chapters study Quillen-smooth algebras via their finite dimensional representations. Noncommutative Geometry and Cayley-smooth Orders provides a gentle introduction to one of mathematics' and physics' hottest topics.

Many students find mathematics a daunting subject. Yet, in this unorthodox textbook, Liu brings a whole new clarity to arithmetic, making it a perfect resource for any budding teacher. With everyday language, even for formal proofs, students are carried along an accessible mathematical adventure by characters from the well-loved novels Alice in Wonderland and Through the Looking-Glass. At the same time, the book's prime focus on arithmetic allows the exploration of often uncovered topics, such as the concepts of divisibility and congruence as well as Diophantine equations. In eight chapters, Liu covers a range of topics from basic arithmetic to the Euclidean algorithm. Each chapter also includes a wealth of exercises catering to students of every level. As Liu has been noted for his 'unique ability to present difficult concepts in a clear and logical manner', Arithmetical Wonderland is an essential classroom resource.

An update of the most accessible introductory number theory text available, Fundamental Number Theory with Applications, Second Edition presents a mathematically rigorous yet easy-to-follow treatment of the fundamentals and applications of the subject. The substantial amount of reorganizing makes this edition clearer and more elementary in its coverage. New to the Second Edition * Removal of all advanced material to be even more accessible in scope * New fundamental material, including partition theory, generating functions, and combinatorial number theory * Expanded coverage of random number generation, Diophantine analysis, and additive number theory * More applications to cryptography, primality testing, and factoring * An appendix on the recently discovered unconditional deterministic polynomial-time algorithm for primality testing Taking a truly elementary approach to number theory, this text supplies the essential material for a first course on the subject. Placed in highlighted boxes to reduce distraction from the main text, nearly 70 biographies focus on major contributors to the field. The presentation of over 1,300 entries in the index maximizes cross-referencing so students can find data with ease.

While its roots reach back to the third century, diophantine analysis continues to be an extremely active and powerful area of number theory. Many diophantine problems have simple formulations, they can be extremely difficult to attack, and many open problems and conjectures remain. Diophantine Analysis examines the theory of diophantine approximations and the theory of diophantine equations, with emphasis on interactions between these subjects. Beginning with the basic principles, the author develops his treatment around the theory of continued fractions and examines the classic theory, including some of its applications. He also explores modern topics rarely addressed in other texts, including the abc conjecture, the polynomial Pell equation, and the irrationality of the zeta function and touches on topics and applications related to discrete mathematics, such as factoring methods for large integers. Setting the stage for tackling the field's many open problems and conjectures, Diophantine Analysis is an ideal introduction to the fundamentals of this venerable but still dynamic field. A detailed appendix supplies the necessary background material, more than 200 exercises reinforce the concepts, and engaging historical notes bring the subject to life.

"Numerical Semigroups" is the first monograph devoted exclusively to the development of the theory of numerical semigroups. This concise, self-contained text is accessible to first year graduate students, giving the full background needed for readers unfamiliar with the topic. Researchers will find the tools presented useful in producing examples and counterexamples in other fields such as algebraic geometry, number theory, and linear programming.

This volume contains original research articles, survey articles and lecture notes related to the Computations with Modular Forms 2011 Summer School and Conference, held at the University of Heidelberg. A key theme of the Conference and Summer School was the interplay between theory, algorithms and experiment. The 14 papers offer readers both, instructional courses on the latest algorithms for computing modular and automorphic forms, as well as original research articles reporting on the latest developments in the field. The three Summer School lectures provide an introduction to modern algorithms together with some theoretical background for computations of and with modular forms, including computing cohomology of arithmetic groups, algebraic automorphic forms, and overconvergent modular symbols. The 11 Conference papers cover a wide range of themes related to computations with modular forms, including lattice methods for algebraic modular forms on classical groups, a generalization of the Maeda conjecture, an efficient algorithm for special values of p-adic Rankin triple product L-functions, arithmetic aspects and experimental data of Bianchi groups, a theoretical study of the real Jacobian of modular curves, results on computing weight one modular forms, and more.

Originally published in 1994, The Incommensurability Thesis is a critical study of the Incommensurability Thesis of Thomas Kuhn and Paul Feyerabend. The book examines the theory that different scientific theories may be incommensurable because of conceptual variance. The book presents a critique of the thesis and examines and discusses the arguments for the theory, acknowledging and debating the opposing views of other theorists. The book provides a comprehensive and detailed discussion of the incommensurability thesis.

Sums of Squares of Integers covers topics in combinatorial number theory as they relate to counting representations of integers as sums of a certain number of squares. The book introduces a stimulating area of number theory where research continues to proliferate. It is a book of "firsts" - namely it is the first book to combine Liouville's elementary methods with the analytic methods of modular functions to study the representation of integers as sums of squares. It is the first book to tell how to compute the number of representations of an integer n as the sum of s squares of integers for any s and n. It is also the first book to give a proof of Szemeredi's theorem, and is the first number theory book to discuss how the modern theory of modular forms complements and clarifies the classical fundamental results about sums of squares. The book presents several existing, yet still interesting and instructive, examples of modular forms. Two chapters develop useful properties of the Bernoulli numbers and illustrate arithmetic progressions, proving the theorems of van der Waerden, Roth, and Szemeredi. The book also explains applications of the theory to three problems that lie outside of number theory in the areas of cryptanalysis, microwave radiation, and diamond cutting. The text is complemented by the inclusion of over one hundred exercises to test the reader's understanding.

This text aims to bridge the gap between non-mathematical popular treatments and the distinctly mathematical publications that non- mathematicians find so difficult to penetrate. The author provides understandable derivations or explanations of many key concepts, such as Kolmogrov-Sinai entropy, dimensions, Fourier analysis, and Lyapunov exponents. Only basic algebra, trigonometry, geometry and statistics are assumed as background. The author focuses on the most important topics, very much with the general scientist in mind.

"Introduction to Modern Number Theory" surveys from a unified point of view both the modern state and the trends of continuing development of various branches of number theory. Motivated by elementary problems, the central ideas of modern theories are exposed. Some topics covered include non-Abelian generalizations of class field theory, recursive computability and Diophantine equations, zeta- and L-functions.

This substantially revised and expanded new edition contains several new sections, such as Wiles' proof of Fermat's Last Theorem, and relevant techniques coming from a synthesis of various theories. Moreover, the authors have added a part dedicated to arithmetical cohomology and noncommutative geometry, a report on point counts on varieties with many rational points, the recent polynomial time algorithm for primality testing, and some others subjects.

From the reviews of the 2nd edition:

" For my part, I come to praise this fine volume. This book is a highly instructive read the quality, knowledge, and expertise of the authors shines through. The present volume is almost startlingly up-to-date ..." (A. van der Poorten, Gazette, Australian Math. Soc. 34 (1), 2007)"

G. H. Hardy (1877-1947) ranks among the great mathematicians of the twentieth century. He did essential research in number theory and analysis, held professorships at Cambridge and Oxford, wrote important textbooks as well as the classic A Mathematician's Apology, and famously collaborated with J. E. Littlewood and Srinivasa Ramanujan. Hardy was a colorful character with remarkable expository skills. This book is a feast of G. H. Hardy's writing. There are selections of his mathematical papers, his book reviews, his tributes to departed colleagues. Some articles are serious, whereas others display a wry sense of humor. And there are recollections by those who knew Hardy, along with biographical and mathematical pieces written explicitly for this collection. Fans of Hardy should find much here to like. And for those unfamiliar with his work, The G. H. Hardy Reader provides an introduction to this extraordinary individual.

This book provides an elementary, complete account of quasi-Frobenius rings at a level allowing researchers and graduate students to gain entry to the field. A ring is called quasi-Frobenius if it is "right" or "left" selfinjective, and "right" or "left" artinian (all four combinations are equivalent). The study of these rings grew out of the theory of representations of a finite group as a group of matrices over a field, and the present extent of the theory is wide-ranging.

Based on talks from the 2015 and 2016 Combinatorial and Additive Number Theory (CANT) workshops at the City University of New York, these proceedings offer 19 peer-reviewed and edited papers on current topics in number theory. Held every year since 2003, the workshop series surveys state-of-the-art open problems in combinatorial and additive number theory and related parts of mathematics. Sumsets, partitions, convex polytopes and discrete geometry, Ramsey theory, primality testing, and cryptography are among the topics featured in this volume. Each contribution is dedicated to a specific topic that reflects the latest results by experts in the field. Researchers and graduate students interested in the current progress in number theory will find this selection of articles relevant and compelling.

Algebraic Operads: An Algorithmic Companion presents a systematic treatment of Groebner bases in several contexts. The book builds up to the theory of Groebner bases for operads due to the second author and Khoroshkin as well as various applications of the corresponding diamond lemmas in algebra. The authors present a variety of topics including: noncommutative Groebner bases and their applications to the construction of universal enveloping algebras; Groebner bases for shuffle algebras which can be used to solve questions about combinatorics of permutations; and operadic Groebner bases, important for applications to algebraic topology, and homological and homotopical algebra. The last chapters of the book combine classical commutative Groebner bases with operadic ones to approach some classification problems for operads. Throughout the book, both the mathematical theory and computational methods are emphasized and numerous algorithms, examples, and exercises are provided to clarify and illustrate the concrete meaning of abstract theory.