Search

This book contains 22 lectures presented at the final conference of the Ger­ man research program (Schwerpunktprogramm) Algorithmic Number The­ ory and Algebra 1991-1997, sponsored by the Deutsche Forschungsgemein­ schaft. The purpose of this research program and of the meeting was to bring together developers of computer algebra software and researchers using com­ putational methods to gain insight into experimental problems and theoret­ ical questions in algebra and number theory. The book gives an overview on algorithmic methods and on results ob­ tained during this period. This includes survey articles on the main research projects within the program: • algorithmic number theory emphasizing class field theory, constructive Galois theory, computational aspects of modular forms and of Drinfeld modules • computational algebraic geometry including real quantifier elimination and real algebraic geometry, and invariant theory of finite groups • computational aspects of presentations and representations of groups, especially finite groups of Lie type and their Heeke algebras, and of the isomorphism problem in group theory. Some of the articles illustrate the current state of computer algebra sys­ tems and program packages developed with support by the research pro­ gram, such as KANT and LiDIA for algebraic number theory, SINGULAR, RED LOG and INVAR for commutative algebra and invariant theory respec­ tively, and GAP, SYSYPHOS and CHEVIE for group theory and representation theory.

This book constitutes the refereed proceedings of the 8th International Conference on Cryptology and Network Security, CANS 2009, held in Kanazawa, Japan, in December 2009. The 32 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 109 submissions. The papers are organized in topical sections on cryptographic protocols and schemes; cryptanalysis; wireless and sensor security; network security; privacy and anonymity; functional and searchable encryption; authentication; block cipher design; and algebraic and number-theoretic schemes.

This proceedings volume convenes selected, peer-reviewed papers presented at the 3rd International Conference on Mathematics and its Applications in Science and Engineering – ICMASE 2022, which was held on July 4–7, 2022 by the Technical University of Civil Engineering of Bucharest, Romania.Works in this volume cover new developments in applications of mathematics in science and engineering, with emphasis on mathematical and computational modeling of real-world problems. Topics range from the use of differential equations to model mechanical structures to the employ of number theory in the development of information security and cryptography. Educational issues specific to the acquisition of mathematical competencies by engineering and science students at all university levels are also touched on.Researchers and university students are the natural audiences for this book, which can be equally appealing to practitioners seeking up-to-date techniques in mathematical applications to different contexts and disciplines.

This proceedings volume gathers selected, peer-reviewed papers presented at the 2nd International Conference on Mathematics and its Applications in Science and Engineering – ICMASE 2021, which was virtually held on July 1-2, 2021 by the University of Salamanca, Spain. Works included in this book cover applications of mathematics both in engineering research and in real-world problems, touching topics such as difference equations, number theory, optimization, and more. The list of applications includes the modeling of mechanical structures, the shape of machines, and the growth of a population, expanding to fields like information security and cryptography. Advances in teaching and learning mathematics in the context of engineering courses are also covered.This volume can be of special interest to researchers in applied mathematics and engineering fields, as well as practitioners seeking studies that address real-life problems in engineering.

This book summarizes recent inventions, provides guidelines and recommendations, and demonstrates many practical applications of homomorphic encryption. This collection of papers represents the combined wisdom of the community of leading experts on Homomorphic Encryption. In the past 3 years, a global community consisting of researchers in academia, industry, and government, has been working closely to standardize homomorphic encryption. This is the first publication of whitepapers created by these experts that comprehensively describes the scientific inventions, presents a concrete security analysis, and broadly discusses applicable use scenarios and markets. This book also features a collection of privacy-preserving machine learning applications powered by homomorphic encryption designed by groups of top graduate students worldwide at the Private AI Bootcamp hosted by Microsoft Research.The volume aims to connect non-expert readers with thisimportant new cryptographic technology in an accessible and actionable way. Readers who have heard good things about homomorphic encryption but are not familiar with the details will find this book full of inspiration. Readers who have preconceived biases based on out-of-date knowledge will see the recent progress made by industrial and academic pioneers on optimizing and standardizing this technology. A clear picture of how homomorphic encryption works, how to use it to solve real-world problems, and how to efficiently strengthen privacy protection, will naturally become clear.

Based on talks from the 2017 and 2018 Combinatorial and Additive Number Theory (CANT) workshops at the City University of New York, these proceedings offer 17 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. Topics featured in this volume include sumsets, partitions, convex polytopes and discrete geometry, Ramsey theory, commutative algebra and discrete geometry, and applications of logic and nonstandard analysis to number theory. Each contribution is dedicated to a specific topic that reflects the latest results by experts in the field. This selection of articles will be of relevance to both researchers and graduate students interested in current progress in number theory.

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.

The book discusses important results in modern mathematical models and high performance computing, such as applied operations research, simulation of operations, statistical modeling and applications, invisibility regions and regular meta-materials, unmanned vehicles, modern radar techniques/SAR imaging, satellite remote sensing, coding, and robotic systems. Furthermore, it is valuable as a reference work and as a basis for further study and research. All contributing authors are respected academicians, scientists and researchers from around the globe. All the papers were presented at the international conference on Modern Mathematical Methods and High Performance Computing in Science & Technology (M3HPCST 2015), held at Raj Kumar Goel Institute of Technology, Ghaziabad, India, from 27–29 December 2015, and peer-reviewed by international experts. The conference provided an exceptional platform for leading researchers, academicians, developers, engineers and technocrats from a broad range of disciplines to meet and discuss state-of-the-art mathematical methods and high performance computing in science & technology solutions. This has brought new prospects for collaboration across disciplines and ideas that facilitate novel breakthroughs.

Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is László Lovász, whose outstanding scientific work has defined and shaped many research directions in the past 40 years. A number of friends and colleagues, all top authorities in their fields of expertise gathered at the two conferences in August 2008 in Hungary, celebrating Lovász'60th birthday. It was a real fete of combinatorics and computer science. Some of these plenary speakers submitted their research or survey papers prior to the conferences. These are included in the volume'Building Bridges'. The other speakers were able to finish their contribution only later, these are collected in the present volume.

The number field sieve is an algorithm for finding the prime factors of large integers. It depends on algebraic number theory. Proposed by John Pollard in 1988, the method was used in 1990 to factor the ninth Fermat number, a 155-digit integer. The algorithm is most suited to numbers of a special form, but there is a promising variant that applies in general. This volume contains six research papers that describe the operation of the number field sieve, from both theoretical and practical perspectives. Pollard's original manuscript is included. In addition, there is an annotated bibliography of directly related literature.

These 34 papers cover topics ranging from various problems on varieties and other classes of algebras including categorical aspects and duality theory to the structure of finite algebras and clones on finite (or infinite) sets.As well as survey articles by invited speakers, the papers contain full proofs of new results not published elsewhere. The volume ends with a list of problems.

This volume contains research and expository content based on a wide variety of topics within modern number theory and arithmetic geometry. Research in this volume arises from or is connected with the Women in Numbers Europe (WiNE) IV conference held in summer 2022 in Utrecht, The Netherlands. The contents of this volume are of interest to professional mathematicians, graduate students, and researchers working in number theory, arithmetic geometry, and related areas.

This is a book about infinity — specifically the infinity of numbers, and how one kind of infinity is greater than all the rest. Along the way the author will demonstrate how infinity can be made to create beautiful ‘art', and how this process can help us to understand the fundamental nature of numbers. This book will provide a fascinating read for anyone interested in number theory, infinity, math art, and/or generative art, and could be used a valuable supplement to any course on these topics.Features Beautiful examples of generative art. Accessible to anyone with a reasonable high school level of mathematics. Full of challenges and puzzles to engage readers.

The goal of this book is to introduce the reader to methodologies in recovery problems for objects, such as functions and signals, from partial or indirect information. The recovery of objects from a set of data demands key solvers of inverse and sampling problems. Until recently, connections between the mathematical areas of inverse problems and sampling were rather tenuous. However, advances in several areas of mathematical research have revealed deep common threads between them, which proves that there is a serious need for a unifying description of the underlying mathematical ideas and concepts. Freeden and Nashed present an integrated approach to resolution methodologies from the perspective of both these areas. Researchers in sampling theory will benefit from learning about inverse problems and regularization methods, while specialists in inverse problems will gain a better understanding of the point of view of sampling concepts. This book requires some basic knowledge of functional analysis, Fourier theory, geometric number theory, constructive approximation, and special function theory. By avoiding extreme technicalities and elaborate proof techniques, it is an accessible resource for students and researchers not only from applied mathematics, but also from all branches of engineering and science.

This book, the much-anticipated sequel to (Almost) Impossible, Integrals, Sums, and Series, presents a whole new collection of challenging problems and solutions that are not commonly found in classical textbooks. As in the author's previous book, these fascinating mathematical problems are shown in new and engaging ways, and illustrate the connections between integrals, sums, and series, many of which involve zeta functions, harmonic series, polylogarithms, and various other special functions and constants. Throughout the book, the reader will find both classical and new problems, with numerous original problems and solutions coming from the personal research of the author. Classical problems are shown in a fresh light, with new, surprising or unconventional ways of obtaining the desired results devised by the author. This book is accessible to readers with a good knowledge of calculus, from undergraduate students to researchers. It will appeal to all mathematical puzzlers wholove a good integral or series and aren't afraid of a challenge.

Generating function (GF) is a mathematical technique to concisely represent a known ordered sequence into a simple continuous algebraic function in dummy variable(s). This Second Edition introduces commonly encountered generating functions (GFs) in engineering and applied sciences, such as ordinary GF (OGF), exponential GF (EGF), as also Dirichlet GF (DGF), Lambert GF (LGF), Logarithmic GF (LogGF), Hurwitz GF (HGF), Mittag-Lefler GF (MLGF), etc. This book is intended mainly for beginners in applied science and engineering fields to help them understand single-variable GFs and illustrate how to apply them in various practical problems. Specifically, the book discusses probability GFs (PGF), moment and cumulant GFs (MGF, CGF), mean deviation GFs (MDGF), survival function GFs (SFGF), rising and falling factorial GFs, factorial moment, and inverse factorial moment GFs. Applications of GFs in algebra, analysis of algorithms, bioinformatics, combinatorics, economics, finance, genomics, geometry, graph theory, management, number theory, polymer chemistry, reliability, statistics and structural engineering have been added to this new edition. This book is written in such a way that readers who do not have prior knowledge of the topic can easily follow through the chapters and apply the lessons learned in their respective disciplines.

Number Theory and its Applications is a textbook for students pursuing mathematics as major in undergraduate and postgraduate courses.Please note: Taylor & Francis does not sell or distribute the print book in India, Pakistan, Nepal, Bhutan, Bangladesh and Sri Lanka.

In recent years, extensive research has been conducted by eminent mathematicians and engineers whose results and proposed problems are presented in this new volume. It is addressed to graduate students, research mathematicians, physicists, and engineers. Individual contributions are devoted to topics of approximation theory, functional equations and inequalities, fixed point theory, numerical analysis, theory of wavelets, convex analysis, topology, operator theory, differential operators, fractional integral operators, integro-differential equations, ternary algebras, super and hyper relators, variational analysis, discrete mathematics, cryptography, and a variety of applications in interdisciplinary topics. Several of these domains have a strong connection with both theories and problems of linear and nonlinear optimization. The combination of results from various domains provides the reader with a solid, state-of-the-art interdisciplinary reference to theory and problems. Some of the works provide guidelines for further research and proposals for new directions and open problems with relevant discussions.

Complex analysis is found in many areas of applied mathematics, from fluid mechanics, thermodynamics, signal processing, control theory, mechanical and electrical engineering to quantum mechanics, among others. And of course, it is a fundamental branch of pure mathematics. The coverage in this text includes advanced topics that are not always considered in more elementary texts. These topics include, a detailed treatment of univalent functions, harmonic functions, subharmonic and superharmonic functions, Nevanlinna theory, normal families, hyperbolic geometry, iteration of rational functions, and analytic number theory. As well, the text includes in depth discussions of the Dirichlet Problem, Green's function, Riemann Hypothesis, and the Laplace transform. Some beautiful color illustrations supplement the text of this most elegant subject.

This book brings together the impact of Prof. John Horton Conway, the playful and legendary mathematician's wide range of contributions in science which includes research areas—Game of Life in cellular automata, theory of finite groups, knot theory, number theory, combinatorial game theory, and coding theory. It contains transcripts where some eminent scientists have shared their first-hand experience of interacting with Conway, as well as some invited research articles from the experts focusing on Game of Life, cellular automata, and the diverse research directions that started with Conway's Game of Life. The book paints a portrait of Conway's research life and philosophical direction in mathematics and is of interest to whoever wants to explore his contribution to the history and philosophy of mathematics and computer science. It is designed as a small tribute to Prof. Conway whom we lost on April 11, 2020.

The book provides an introduction to modern abstract algebra and its applications. It covers all major topics of classical theory of numbers, groups, rings, fields and finite dimensional algebras. The book also provides interesting and important modern applications in such subjects as Cryptography, Coding Theory, Computer Science and Physics. In particular, it considers algorithm RSA, secret sharing algorithms, Diffie-Hellman Scheme and ElGamal cryptosystem based on discrete logarithm problem. It also presents Buchberger's algorithm which is one of the important algorithms for constructing Gröbner basis. Key Features: Covers all major topics of classical theory of modern abstract algebra such as groups, rings and fields and their applications. In addition it provides the introduction to the number theory, theory of finite fields, finite dimensional algebras and their applications. Provides interesting and important modern applications in such subjects as Cryptography, Coding Theory, Computer Science and Physics. Presents numerous examples illustrating the theory and applications. It is also filled with a number of exercises of various difficulty. Describes in detail the construction of the Cayley-Dickson construction for finite dimensional algebras, in particular, algebras of quaternions and octonions and gives their applications in the number theory and computer graphics.

This book provides an overview of many interesting properties of natural numbers, demonstrating their applications in areas such as cryptography, geometry, astronomy, mechanics, computer science, and recreational mathematics. In particular, it presents the main ideas of error-detecting and error-correcting codes, digital signatures, hashing functions, generators of pseudorandom numbers, and the RSA method based on large prime numbers. A diverse array of topics is covered, from the properties and applications of prime numbers, some surprising connections between number theory and graph theory, pseudoprimes, Fibonacci and Lucas numbers, and the construction of Magic and Latin squares, to the mathematics behind Prague's astronomical clock. Introducing a general mathematical audience to some of the basic ideas and algebraic methods connected with various types of natural numbers, the book will provide invaluable reading for amateurs and professionals alike.

This book gives its readers a unique opportunity to get acquainted with new aspects of the fruitful interactions between Analysis, Geometry, Quantum Mechanics and Number Theory. The present book contains a number of contributions by specialists in these areas as an homage to the memory of the mathematician Erik Balslev and, at the same time, advancing a fascinating interdisciplinary area still full of potential. Erik Balslev has made original and important contributions to several areas of Mathematics and its applications. He belongs to the founders of complex scaling, one of the most important methods in the mathematical and physical study of eigenvalues and resonances of Schrödinger operators, which has been very essential in advancing the solution of fundamental problems in Quantum Mechanics and related areas. He was also a pioneer in making available and developing spectral methods in the study of important problems in Analytic Number Theory.

Number Systems: A Path into Rigorous Mathematics aims to introduce number systems to an undergraduate audience in a way that emphasises the importance of rigour, and with a focus on providing detailed but accessible explanations of theorems and their proofs. The book continually seeks to build upon students'intuitive ideas of how numbers and arithmetic work, and to guide them towards the means to embed this natural understanding into a more structured framework of understanding.The author's motivation for writing this book is that most previous texts, which have complete coverage of the subject, have not provided the level of explanation needed for first-year students. On the other hand, those that do give good explanations tend to focus broadly on Foundations or Analysis and provide incomplete coverage of Number Systems.Features Approachable for students who have not yet studied mathematics beyond school Does not merely present definitions, theorems and proofs, but also motivates them in terms of intuitive knowledge and discusses methods of proof Draws attention to connections with other areas of mathematics Plenty of exercises for students, both straightforward problems and more in-depth investigations Introduces many concepts that are required in more advanced topics in mathematics.

There are excellent books on both functional analysis and summability. Most of them are very terse. In Functional Analysis and Summability, the author makes a sincere attempt for a gentle introduction of these topics to students. In the functional analysis component of the book, the Hahn–Banach theorem, Banach–Steinhaus theorem (or uniform boundedness principle), the open mapping theorem, the closed graph theorem, and the Riesz representation theorem are highlighted. In the summability component of the book, the Silverman–Toeplitz theorem, Schur's theorem, the Steinhaus theorem, and the Steinhaus-type theorems are proved. The utility of functional analytic tools like the uniform boundedness principle to prove some results in summability theory is also pointed out.Features A gentle introduction of the topics to the students is attempted. Basic results of functional analysis and summability theory and their applications are highlighted. Many examples are provided in the text. Each chapter ends with useful exercises. This book will be useful to postgraduate students, pre-research level students, and research scholars in mathematics. Students of physics and engineering will also find this book useful since topics in the book also have applications in related areas.

Students and researchers from all fields of mathematics are invited to read and treasure this special Proceedings. A conference was held 25 –29 September 2017 at Noah's On the Beach, Newcastle, Australia, to commemorate the life and work of Jonathan M. Borwein, a mathematician extraordinaire whose untimely passing in August 2016 was a sorry loss to mathematics and to so many members of its community, a loss that continues to be keenly felt. A polymath, Jonathan Borwein ranks among the most wide ranging and influential mathematicians of the last 50 years, making significant contributions to an exceptional diversity of areas and substantially expanding the use of the computer as a tool of the research mathematician. The contributions in this commemorative volume probe Dr. Borwein's ongoing legacy in areas where he did some of his most outstanding work: Applied Analysis, Optimization and Convex Functions; Mathematics Education; Financial Mathematics; plus Number Theory, Special Functions and Pi, all tinged by the double prisms of Experimental Mathematics and Visualization, methodologies he championed.

This monograph provides a self-contained presentation of the foundations of finite fields, including a detailed treatment of their algebraic closures. It also covers important advanced topics which are not yet found in textbooks: the primitive normal basis theorem, the existence of primitive elements in affine hyperplanes, and the Niederreiter method for factoring polynomials over finite fields.We give streamlined and/or clearer proofs for many fundamental results and treat some classical material in an innovative manner. In particular, we emphasize the interplay between arithmetical and structural results, and we introduce Berlekamp algebras in a novel way which provides a deeper understanding of Berlekamp's celebrated factorization algorithm.The book provides a thorough grounding in finite field theory for graduate students and researchers in mathematics. In view of its emphasis on applicable and computational aspects, it is also useful for readers working in information and communication engineering, for instance, in signal processing, coding theory, cryptography or computer science.

This book offers an essential textbook on complex analysis. After introducing the theory of complex analysis, it places special emphasis on the importance of Poincare theorem and Hartog's theorem in the function theory of several complex variables. Further, it lays the groundwork for future study in analysis, linear algebra, numerical analysis, geometry, number theory, physics (including hydrodynamics and thermodynamics), and electrical engineering. To benefit most from the book, students should have some prior knowledge of complex numbers. However, the essential prerequisites are quite minimal, and include basic calculus with some knowledge of partial derivatives, definite integrals, and topics in advanced calculus such as Leibniz's rule for differentiating under the integral sign and to some extent analysis of infinite series. The book offers a valuable asset for undergraduate and graduate students of mathematics and engineering, as well as students with no background in topological properties.

This book contains a multitude of challenging problems and solutions that are not commonly found in classical textbooks. One goal of the book is to present these fascinating mathematical problems in a new and engaging way and illustrate the connections between integrals, sums, and series, many of which involve zeta functions, harmonic series, polylogarithms, and various other special functions and constants. Throughout the book, the reader will find both classical and new problems, with numerous original problems and solutions coming from the personal research of the author. Where classical problems are concerned, such as those given in Olympiads or proposed by famous mathematicians like Ramanujan, the author has come up with new, surprising or unconventional ways of obtaining the desired results. The book begins with a lively foreword by renowned author Paul Nahin and is accessible to those with a good knowledge of calculus from undergraduate students to researchers, and will appeal to all mathematical puzzlers who love a good integral or series.

This volume collects lecture notes and research articles from the International Autumn School on Computational Number Theory, which was held at the Izmir Institute of Technology from October 30th to November 3rd, 2017 in Izmir, Turkey. Written by experts in computational number theory, the chapters cover a variety of the most important aspects of the field. By including timely research and survey articles, the text also helps pave a path to future advancements. Topics include:Modular formsL-functionsThe modular symbols algorithmDiophantine equationsNullstellensatzEisenstein seriesNotes from the International Autumn School on Computational Number Theory will offer graduate students an invaluable introduction to computational number theory. In addition, it provides the state-of-the-art of the field, and will thus be of interest to researchers interested in the field aswell.

The Mellin transformation is widely used in various problems of pure and applied mathematics, in particular, in the theory of differential and integral equations and the theory of Dirichlet series. It is found in extensive applications in mathematical physics, number theory, mathematical statistics, theory of asymptotic expansions, and especially, in the theory of special functions and integral transformations. It is essentially used in algorithms of integration in computer algebra systems.Since the majority of integrals encountered in applications can be reduced to the form of the corresponding Mellin transforms with specific parameters, this handbook can also be used for definite and indefinite integrals. By changes in variables, the Mellin transform can be turned into the Fourier and Laplace transforms.The appendices contain formulas of connection with other integral transformations, and an algorithm for determining regions of convergence of integrals.The Handbook of Mellin Transforms will be of interest and useful to all researchers and engineers who use mathematical methods. It will become the main source of formulas of Mellin transforms, as well as indefinite and definite integrals.

This book aims to provide an introduction to the broad and dynamic subject of discrete energy problems and point configurations. Written by leading authorities on the topic, this treatise is designed with the graduate student and further explorers in mind. The presentation includes a chapter of preliminaries and an extensive Appendix that augments a course in Real Analysis and makes the text self-contained. Along with numerous attractive full-color images, the exposition conveys the beauty of the subject and its connection to several branches of mathematics, computational methods, and physical/biological applications. This work is destined to be a valuable research resource for such topics as packing and covering problems, generalizations of the famous Thomson Problem, and classical potential theory in Rd. It features three chapters dealing with point distributions on the sphere, including an extensive treatment of Delsarte–Yudin–Levenshtein linearprogramming methods for lower bounding energy, a thorough treatment of Cohn–Kumar universality, and a comparison of'popular methods'for uniformly distributing points on the two-dimensional sphere. Some unique features of the work are its treatment of Gauss-type kernels for periodic energy problems, its asymptotic analysis of minimizing point configurations for non-integrable Riesz potentials (the so-called Poppy-seed bagel theorems), its applications to the generation of non-structured grids of prescribed densities, and its closing chapter on optimal discrete measures for Chebyshev (polarization) problems.

This revised and enlarged sixth edition of Proofs from THE BOOK features an entirely new chapter on Van der Waerden's permanent conjecture, as well as additional, highly original and delightful proofs in other chapters.From the citation on the occasion of the 2018'Steele Prize for Mathematical Exposition'“… It is almost impossible to write a mathematics book that can be read and enjoyed by people of all levels and backgrounds, yet Aigner and Ziegler accomplish this feat of exposition with virtuoso style. […] This book does an invaluable service to mathematics, by illustrating for non-mathematicians what it is that mathematicians mean when they speak about beauty.”From the Reviews'... Inside PFTB (Proofs from The Book) is indeed a glimpse of mathematical heaven, where clever insights and beautiful ideas combine in astonishing and glorious ways. There is vast wealth within its pages, one gem after another.... Aigner and Ziegler... write:'... all we offer is the examples that we have selected, hoping that our readers will share our enthusiasm about brilliant ideas, clever insights and wonderful observations.'I do....'Notices of the AMS, August 1999'... This book is a pleasure to hold and to look at: ample margins, nice photos, instructive pictures and beautiful drawings... It is a pleasure to read as well: the style is clear and entertaining, the level is close to elementary, the necessary background is given separately and the proofs are brilliant....'LMS Newsletter, January 1999'Martin Aigner and Günter Ziegler succeeded admirably in putting together a broad collection of theorems and their proofs that would undoubtedly be in the Book of Erdös. The theorems are so fundamental, their proofs so elegant and the remaining open questions so intriguing that every mathematician, regardless of speciality, can benefit from reading this book....'SIGACT News, December 2011

This book presents the mathematical background underlying security modeling in the context of next-generation cryptography. By introducing new mathematical results in order to strengthen information security, while simultaneously presenting fresh insights and developing the respective areas of mathematics, it is the first-ever book to focus on areas that have not yet been fully exploited for cryptographic applications such as representation theory and mathematical physics, among others. Recent advances in cryptanalysis, brought about in particular by quantum computation and physical attacks on cryptographic devices, such as side-channel analysis or power analysis, have revealed the growing security risks for state-of-the-art cryptographic schemes. To address these risks, high-performance, next-generation cryptosystems must be studied, which requires the further development of the mathematical background of modern cryptography. More specifically, in order to avoid the security risks posed by adversaries with advanced attack capabilities, cryptosystems must be upgraded, which in turn relies on a wide range of mathematical theories. This book is suitable for use in an advanced graduate course in mathematical cryptography, while also offering a valuable reference guide for experts.

This highly readable book aims to ease the many challenges of starting undergraduate research. It accomplishes this by presenting a diverse series of self-contained, accessible articles which include specific open problems and prepare the reader to tackle them with ample background material and references. Each article also contains a carefully selected bibliography for further reading.The content spans the breadth of mathematics, including many topics that are not normally addressed by the undergraduate curriculum (such as matroid theory, mathematical biology, and operations research), yet have few enough prerequisites that the interested student can start exploring them under the guidance of a faculty member. Whether trying to start an undergraduate thesis, embarking on a summer REU, or preparing for graduate school, this book is appropriate for a variety of students and the faculty who guide them.

Now in its second edition, this textbook provides an introduction and overview of number theory based on the density and properties of the prime numbers. This unique approach offers both a firm background in the standard material of number theory, as well as an overview of the entire discipline. All of the essential topics are covered, such as the fundamental theorem of arithmetic, theory of congruences, quadratic reciprocity, arithmetic functions, and the distribution of primes. New in this edition are coverage of p-adic numbers, Hensel's lemma, multiple zeta-values, and elliptic curve methods in primality testing.Key topics and features include:A solid introduction to analytic number theory, including full proofs of Dirichlet's Theorem and the Prime Number TheoremConcise treatment of algebraic number theory, including a complete presentation of primes, prime factorizations in algebraic number fields, and unique factorization of idealsDiscussion of the AKS algorithm, which shows that primality testing is one of polynomial time, a topic not usually included in such textsMany interesting ancillary topics, such as primality testing and cryptography, Fermat and Mersenne numbers, and Carmichael numbersThe user-friendly style, historical context, and wide range of exercises that range from simple to quite difficult (with solutions and hints provided for select exercises) make Number Theory: An Introduction via the Density of Primes ideal for both self-study and classroom use. Intended for upper level undergraduates and beginning graduates, the only prerequisites are a basic knowledge of calculus, multivariable calculus, and some linear algebra. All necessary concepts from abstract algebra and complex analysis are introduced where needed.

This volume consists of a selection of research-type articles on dynamical systems, evolution equations, analytic number theory and closely related topics. A strong emphasis is on a fair balance between theoretical and more applied work, thus spanning the chasm between abstract insight and actual application. Several of the articles are expected to be in the intersection of dynamical systems theory and number theory. One article will likely relate the topics presented to the academic achievements and interests of Prof. Leutbecher and shed light on common threads among all the contributions.

Developed from the author's popular graduate-level course, Computational Number Theory presents a complete treatment of number-theoretic algorithms. Avoiding advanced algebra, this self-contained text is designed for advanced undergraduate and beginning graduate students in engineering. It is also suitable for researchers new to the field and pract

This volume contains three extensive articles written by Karasev and his pupils. Topics covered include the following: coherent states and irreducible representations for algebras with non-Lie permutation relations, Hamilton dynamics and quantization over stable isotropic submanifolds, and infinitesimal tensor complexes over degenerate symplectic leaves in Poisson manifolds. The articles contain many examples (including from physics) and complete proofs.

This is the first introductory book on multiple zeta functions and multiple polylogarithms which are the generalizations of the Riemann zeta function and the classical polylogarithms, respectively, to the multiple variable setting. It contains all the basic concepts and the important properties of these functions and their special values. This book is aimed at graduate students, mathematicians and physicists who are interested in this current active area of research.This book will provide a detailed and comprehensive introduction to these objects, their fascinating properties and interesting relation to other mathematical subjects, and various generalizations such as their q-analogs and their finite versions (by taking partial sums modulo suitable prime powers). Historical notes and exercises are provided at the end of each chapter.

This text is an introduction to harmonic analysis on symmetric spaces, focusing on advanced topics such as higher rank spaces, positive definite matrix space and generalizations. It is intended for beginning graduate students in mathematics or researchers in physics or engineering. As with the introductory book entitled'Harmonic Analysis on Symmetric Spaces - Euclidean Space, the Sphere, and the Poincaré Upper Half Plane, the style is informal with an emphasis on motivation, concrete examples, history, and applications. The symmetric spaces considered here are quotients X=G/K, where G is a non-compact real Lie group, such as the general linear group GL(n,P) of all n x n non-singular real matrices, and K=O(n), the maximal compact subgroup of orthogonal matrices. Other examples are Siegel's upper half'plane'and the quaternionic upper half'plane'. In the case of the general linear group, one can identify X with the space Pn of n x n positive definite symmetric matrices.Manycorrections and updates have been incorporated in this new edition. Updates include discussions of random matrix theory and quantum chaos, as well as recent research on modular forms and their corresponding L-functions in higher rank. Many applications have been added, such as the solution of the heat equation on Pn, the central limit theorem of Donald St. P. Richards for Pn, results on densest lattice packing of spheres in Euclidean space, and GL(n)-analogs of the Weyl law for eigenvalues of the Laplacian in plane domains. Topics featured throughout the text include inversion formulas for Fourier transforms, central limit theorems, fundamental domains in X for discrete groups Γ (such as the modular group GL(n,Z) of n x n matrices with integer entries and determinant ±1), connections with the problem of finding densest lattice packings of spheres in Euclidean space, automorphic forms, Hecke operators, L-functions, and the Selberg trace formula and its applications in spectral theory as well as number theory.

The aim of this book is to give a systematic exposition of results in some important cases where p-adic families and p-adic L-functions are studied. We first look at p-adic families in the following cases: general linear groups, symplectic groups and definite unitary groups. We also look at applications of this theory to modularity lifting problems. We finally consider p-adic L-functions for GL(2), the p-adic adjoint L-functions and some cases of higher GL(n).

In this intriguing book, John Barnes takes us on a journey through aspects of numbers much as he took us on a geometrical journey in Gems of Geometry. Similarly originating from a series of lectures for adult students at Reading and Oxford University, this book touches a variety of amusing and fascinating topics regarding numbers and their uses both ancient and modern.The author informs and intrigues his audience with both fundamental number topics such as prime numbers and cryptography, and themes of daily needs and pleasures such as counting one's assets, keeping track of time, and enjoying music. Puzzles and exercises at the end of each lecture offer additional inspiration, and numerous illustrations accompany the reader. Furthermore, a number of appendices provides in-depth insights into diverse topics such as Pascal's triangle, the Rubik cube, Mersenne's curious keyboards, and many others. A theme running through is the thought of what is our favourite number.Written in an engaging and witty style and requiring only basic school mathematical knowledge, this book will appeal to both young and mature readers fascinated by the curiosities of numbers.

This text aims to provide graduate students with a self-contained introduction to topics that are at the forefront of modern algebra, namely, coalgebras, bialgebras and Hopf algebras. The last chapter (Chapter 4) discusses several applications of Hopf algebras, some of which are further developed in the author's 2011 publication, An Introduction to Hopf Algebras. The book may be used as the main text or as a supplementary text for a graduate algebra course. Prerequisites for this text include standard material on groups, rings, modules, algebraic extension fields, finite fields and linearly recursive sequences.The book consists of four chapters. Chapter 1 introduces algebras and coalgebras over a field K; Chapter 2 treats bialgebras; Chapter 3 discusses Hopf algebras and Chapter 4 consists of three applications of Hopf algebras. Each chapter begins with a short overview and ends with a collection of exercises which are designed to review and reinforce the material. Exercises range from straightforward applications of the theory to problems that are devised to challenge the reader. Questions for further study are provided after selected exercises. Most proofs are given in detail, though a few proofs are omitted since they are beyond the scope of this book.

The first part of this book covers the key concepts of cryptography on an undergraduate level, from encryption and digital signatures to cryptographic protocols. Essential techniques are demonstrated in protocols for key exchange, user identification, electronic elections and digital cash. In the second part, more advanced topics are addressed, such as the bit security of one-way functions and computationally perfect pseudorandom bit generators. The security of cryptographic schemes is a central topic. Typical examples of provably secure encryption and signature schemes and their security proofs are given. Though particular attention is given to the mathematical foundations, no special background in mathematics is presumed. The necessary algebra, number theory and probability theory are included in the appendix. Each chapter closes with a collection of exercises. In the second edition the authors added a complete description of the AES, an extended section on cryptographic hash functions, and new sections on random oracle proofs and public-key encryption schemes that are provably secure against adaptively-chosen-ciphertext attacks. The third edition is a further substantive extension, with new topics added, including: elliptic curve cryptography; Paillier encryption; quantum cryptography; the new SHA-3 standard for cryptographic hash functions; a considerably extended section on electronic elections and Internet voting; mix nets; and zero-knowledge proofs of shuffles. The book is appropriate for undergraduate and graduate students in computer science, mathematics, and engineering.

This richly illustrated textbook explores the amazing interaction between combinatorics, geometry, number theory, and analysis which arises in the interplay between polyhedra and lattices. Highly accessible to advanced undergraduates, as well as beginning graduate students, this second edition is perfect for a capstone course, and adds two new chapters, many new exercises, and updated open problems. For scientists, this text can be utilized as a self-contained tooling device.The topics include a friendly invitation to Ehrhart's theory of counting lattice points in polytopes, finite Fourier analysis, the Frobenius coin-exchange problem, Dedekind sums, solid angles, Euler–Maclaurin summation for polytopes, computational geometry, magic squares, zonotopes, and more.With more than 300 exercises and open research problems, the reader is an active participant, carried through diverse but tightly woven mathematical fields that are inspired by an innocently elementary question: What are the relationships between the continuous volume of a polytope and its discrete volume?Reviews of the first edition:“You owe it to yourself to pick up a copy of Computing the Continuous Discretely to read about a number of interesting problems in geometry, number theory, and combinatorics.”— MAA Reviews“The book is written as an accessible and engaging textbook, with many examples, historical notes, pithy quotes, commentary integrating the material, exercises, open problems and an extensive bibliography.”— Zentralblatt MATH“This beautiful book presents, at a level suitable for advanced undergraduates, a fairly complete introduction to the problem of counting lattice points inside a convex polyhedron.”— Mathematical Reviews“Many departments recognize the need for capstone courses in which graduating students can see the tools they have acquired come together in some satisfying way. Beck and Robinshave written the perfect text for such a course.”— CHOICE

This volume develops the depth and breadth of the mathematics underlying the construction and analysis of Hadamard matrices, and their use in the construction of combinatorial designs. At the same time, it pursues current research in their numerous applications in security and cryptography, quantum information, and communications. Bridges among diverse mathematical threads and extensive applications make this an invaluable source for understanding both the current state of the art and future directions.​​The existence of Hadamard matrices remains one of the most challenging open questions in combinatorics. Substantial progress on their existence has resulted from advances in algebraic design theory using deep connections with linear algebra, abstract algebra, finite geometry, number theory, and combinatorics. Hadamard matrices arise in a very diverse set of applications. Starting with applications in experimental design theory and the theory of error-correcting codes, they have found unexpected and important applications in cryptography, quantum information theory, communications, and networking.

Written by experts in both mathematics and biology, Algebraic and Discrete Mathematical Methods for Modern Biology offers a bridge between math and biology, providing a framework for simulating, analyzing, predicting, and modulating the behavior of complex biological systems. Each chapter begins with a question from modern biology, followed by the description of certain mathematical methods and theory appropriate in the search of answers. Every topic provides a fast-track pathway through the problem by presenting the biological foundation, covering the relevant mathematical theory, and highlighting connections between them. Many of the projects and exercises embedded in each chapter utilize specialized software, providing students with much-needed familiarity and experience with computing applications, critical components of the'modern biology'skill set. This book is appropriate for mathematics courses such as finite mathematics, discrete structures, linear algebra, abstract/modern algebra, graph theory, probability, bioinformatics, statistics, biostatistics, and modeling, as well as for biology courses such as genetics, cell and molecular biology, biochemistry, ecology, and evolution. Examines significant questions in modern biology and their mathematical treatments Presents important mathematical concepts and tools in the context of essential biology Features material of interest to students in both mathematics and biology Presents chapters in modular format so coverage need not follow the Table of Contents Introduces projects appropriate for undergraduate research Utilizes freely accessible software for visualization, simulation, and analysis in modern biology Requires no calculus as a prerequisite Provides a complete Solutions Manual Features a companion website with supplementary resources

This textbook effectively builds a bridge from basic number theory to recent advances in applied number theory. It presents the first unified account of the four major areas of application where number theory plays a fundamental role, namely cryptography, coding theory, quasi-Monte Carlo methods, and pseudorandom number generation, allowing the authors to delineate the manifold links and interrelations between these areas.Number theory, which Carl-Friedrich Gauss famously dubbed the queen of mathematics, has always been considered a very beautiful field of mathematics, producing lovely results and elegant proofs. While only very few real-life applications were known in the past, today number theory can be found in everyday life: in supermarket bar code scanners, in our cars'GPS systems, in online banking, etc.Starting with a brief introductory course on number theory in Chapter 1, which makes the book more accessible for undergraduates, the authors describe the four main application areas in Chapters 2-5 and offer a glimpse of advanced results that are presented without proofs and require more advanced mathematical skills. In the last chapter they review several further applications of number theory, ranging from check-digit systems to quantum computation and the organization of raster-graphics memory.Upper-level undergraduates, graduates and researchers in the field of number theory will find this book to be a valuable resource.

This is the first work on Discrepancy Theory to show the present variety of points of view and applications covering the areas Classical and Geometric Discrepancy Theory, Combinatorial Discrepancy Theory and Applications and Constructions. It consists of several chapters, written by experts in their respective fields and focusing on the different aspects of the theory.Discrepancy theory concerns the problem of replacing a continuous object with a discrete sampling and is currently located at the crossroads of number theory, combinatorics, Fourier analysis, algorithms and complexity, probability theory and numerical analysis. This book presents an invitation to researchers and students to explore the different methods and is meant to motivate interdisciplinary research.