Search

This book constitutes the refereed post-conference proceedings of the First International Conference on Number-Theoretic Methods in Cryptology, NuTMiC 2017, held in Warsaw, Poland, in September 2017.The 15 revised full papers presented in this book together with 3 invited talks were carefully reviewed and selected from 32 initial submissions. The papers are organized in topical sections on elliptic curves in cryptography; public-key cryptography; lattices in cryptography; number theory; pseudorandomness; and algebraic structures and analysis.

This volume contains a collection of papers in Analytic and Elementary Number Theory in memory of Professor Paul Erdös, one of the greatest mathematicians of this century. Written by many leading researchers, the papers deal with the most recent advances in a wide variety of topics, including arithmetical functions, prime numbers, the Riemann zeta function, probabilistic number theory, properties of integer sequences, modular forms, partitions, and q-series. Audience: Researchers and students of number theory, analysis, combinatorics and modular forms will find this volume to be stimulating.

In 1992, when Paul Erdos was awarded a Doctor Honoris Causa by Charles University in Prague, a small conference was held, bringing together a distin­ guished group of researchers with interests spanning a variety of fields related to Erdos'own work. At that gathering, the idea occurred to several of us that it might be quite appropriate at this point in Erdos'career to solicit a col­ lection of articles illustrating various aspects of Erdos'mathematical life and work. The response to our solicitation was immediate and overwhelming, and these volumes are the result. Regarding the organization, we found it convenient to arrange the papers into six chapters, each mirroring Erdos'holistic approach to mathematics. Our goal was not merely a (random) collection of papers but rather a thor­ oughly edited volume composed in large part by articles explicitly solicited to illustrate interesting aspects of Erdos and his life and work. Each chap­ ter includes an introduction which often presents a sample of related Erdos'problems'in his own words'. All these (sometimes lengthy) introductions were written jointly by editors. We wish to thank the nearly 70 contributors for their outstanding efforts (and their patience). In particular, we are grateful to Bela Bollobas for his extensive documentation of Paul Erdos'early years and mathematical high points (in the first part of this volume); our other authors are acknowledged in their respective chapters. We also want to thank A. Bondy, G. Hahn, I.

These are the proceedings of the Conference on Coding Theory, Cryptography, and Number Theory held at the U. S. Naval Academy during October 25-26, 1998. This book concerns elementary and advanced aspects of coding theory and cryptography. The coding theory contributions deal mostly with algebraic coding theory. Some of these papers are expository, whereas others are the result of original research. The emphasis is on geometric Goppa codes (Shokrollahi, Shokranian-Joyner), but there is also a paper on codes arising from combinatorial constructions (Michael). There are both, historical and mathematical papers on cryptography. Several of the contributions on cryptography describe the work done by the British and their allies during World War II to crack the German and Japanese ciphers (Hamer, Hilton, Tutte, Weierud, Urling). Some mathematical aspects of the Enigma rotor machine (Sherman) and more recent research on quantum cryptography (Lomonoco) are described. There are two papers concerned with the RSA cryptosystem and related number-theoretic issues (Wardlaw, Cosgrave).

This book contains 33 papers from among the 41 papers presented at the Eighth International Conference on Fibonacci Numbers and Their Applications which was held at the Rochester Institute of Technology, Rochester, New York, from June 22 to June 26, 1998. These papers have been selected after a careful review by well known referees in the field, and they range from elementary number theory to probability and statistics. The Fibonacci numbers and recurrence relations are their unifying bond. It is anticipated that this book, like its seven predecessors, will be useful to research workers and graduate students interested in the Fibonacci numbers and their applications. June 1, 1999 The Editor F. T. Howard Mathematics and Computer Science Wake Forest University Box 7388 Reynolda Station Winston-Salem, NC USA xvii THE ORGANIZING COMMITTEES LOCAL COMMITTEE INTERNATIONAL COMMITTEE Anderson, Peter G., Chairman Horadam, A. F. (Australia), Co-Chair Arpaya, Pasqual Philippou, A. N. (Cyprus), Co-Chair Biles, John Bergum, G. E. (U. S. A.) Orr, Richard Filipponi, P. (Italy) Radziszowski, Stanislaw Harborth, H. (Germany) Rich, Nelson Horibe, Y. (Japan) Howard, F. (U. S. A.) Johnson, M. (U. S. A.) Kiss, P. (Hungary) Phillips, G. M. (Scotland) Turner, J. (New Zealand) Waddill, M. E. (U. S. A.) xix LIST OF CONTRIBUTORS TO THE CONFERENCE AGRATINI, OCTAVIAN,'Unusual Equations in Study.'•ANDO, SHIRO, (coauthor Daihachiro Sato),'On the Generalized Binomial Coefficients Defined by Strong Divisibility Sequences.'•ANATASSOVA, VASSIA K., (coauthor J. C.

The problem of uniform distribution of sequences initiated by Hardy, Little­ wood and Weyl in the 1910's has now become an important part of number theory. This is also true, in relation to combinatorics, of what is called Ramsey­ theory, a theory of about the same age going back to Schur. Both concern the distribution of sequences of elements in certain collection of subsets. But it was not known until quite recently that the two are closely interweaving bear­ ing fruits for both. At the same time other fields of mathematics, such as ergodic theory, geometry, information theory, algorithm theory etc. have also joined in. (See the survey articles: V. T. S6s: Irregularities of partitions, Lec­ ture Notes Series 82, London Math. Soc., Surveys in Combinatorics, 1983, or J. Beck: Irregularities of distributions and combinatorics, Lecture Notes Series 103, London Math. Soc., Surveys in Combinatorics, 1985.) The meeting held at Fertod, Hungary from the 7th to 11th of July, 1986 was to emphasize this development by bringing together a few people working on different aspects of this circle of problems. Although combinatorics formed the biggest contingent (see papers 2, 3, 6, 7, 13) some number theoretic and analytic aspects (see papers 4, 10, 11, 14) generalization of both (5, 8, 9, 12) as well as irregularities of distribution in the geometric theory of numbers (1), the most important instrument in bringing about the above combination of ideas are also represented.

Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and state-of-the-art results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research. The volume is recommended to experienced specialists as well as to young researchers and students.

This book constitutes the refereed proceedings of the 8th International Algorithmic Number Theory Symposium, ANTS 2008, held in Banff, Canada, in May 2008. The 28 revised full papers presented together with 2 invited papers were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections on elliptic curves cryptology and generalizations, arithmetic of elliptic curves, integer factorization, K3 surfaces, number fields, point counting, arithmetic of function fields, modular forms, cryptography, and number theory.

This book constitutes the refereed proceedings of the 7th International Algorithmic Number Theory Symposium, ANTS 2006, held in Berlin, July 2006. The book presents 37 revised full papers together with 4 invited papers selected for inclusion. The papers are organized in topical sections on algebraic number theory, analytic and elementary number theory, lattices, curves and varieties over fields of characteristic zero, curves over finite fields and applications, and discrete logarithms.

This book contains 28 research articles from among the 49 papers and abstracts presented at the Tenth International Conference on Fibonacci Numbers and Their Applications. These articles have been selected after a careful review by expert referees, and they range over many areas of mathematics. The Fibonacci numbers and recurrence relations are their unifying bond. We note that the article'Fibonacci, Vern and Dan', which follows the Introduction to this volume, is not a research paper. It is a personal reminiscence by Marjorie Bicknell-Johnson, a longtime member of the Fibonacci Association. The editor believes it will be of interest to all readers. It is anticipated that this book, like the eight predecessors, will be useful to research workers and students at all levels who are interested in the Fibonacci numbers and their applications. March 16, 2003 The Editor Fredric T. Howard Mathematics Department Wake Forest University Box 7388 Reynolda Station Winston-Salem, NC 27109 xxi THE ORGANIZING COMMITTEES LOCAL COMMITTEE INTERNATIONAL COMMITTEE Calvin Long, Chairman A. F. Horadam (Australia), Co-Chair Terry Crites A. N. Philippou (Cyprus), Co-Chair Steven Wilson A. Adelberg (U. S. A.) C. Cooper (U. S. A.) Jeff Rushal H. Harborth (Germany) Y. Horibe (Japan) M. Bicknell-Johnson (U. S. A.) P. Kiss (Hungary) J. Lahr (Luxembourg) G. M. Phillips (Scotland) J.'Thrner (New Zealand) xxiii xxiv LIST OF CONTRlBUTORS TO THE CONFERENCE • ADELBERG, ARNOLD,'Universal Bernoulli Polynomials and p-adic Congruences.'•AGRATINI, OCTAVIAN,'A Generalization of Durrmeyer-Type Polynomials.'BENJAMIN, ART,'Mathemagics.

This is the fourth in a series of proceedings of the Combinatorial and Additive Number Theory (CANT) conferences, based on talks from the 2019 and 2020 workshops at the City University of New York. The latter was held online due to the COVID-19 pandemic, and featured speakers from North and South America, Europe, and Asia. The 2020 Zoom conference was the largest CANT conference in terms of the number of both lectures and participants.These proceedings contain 25 peer-reviewed and edited papers on current topics in number theory. Held every year since 2003 at the CUNY Graduate Center, the workshop 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, zero-sum sequences, minimal complements, analytic and prime number theory, Hausdorff dimension, combinatorial and discrete geometry, and Ramsey theory. This selection of articles will be of relevance to both researchers and graduate students interested in current progress in number theory.

This proceedings volume gathers together original articles and survey works that originate from presentations given at the conference Transient Transcendence in Transylvania, held in Brașov, Romania, from May 13th to 17th, 2019. The conference gathered international experts from various fields of mathematics and computer science, with diverse interests and viewpoints on transcendence. The covered topics are related to algebraic and transcendental aspects of special functions and special numbers arising in algebra, combinatorics, geometry and number theory. Besides contributions on key topics from invited speakers, this volume also brings selected papers from attendees.

This book presents a printed testimony for the fact that George Andrews, one of the world's leading experts in partitions and q-series for the last several decades, has passed the milestone age of 80. To honor George Andrews on this occasion, the conference “Combinatory Analysis 2018” was organized at the Pennsylvania State University from June 21 to 24, 2018. This volume comprises the original articles from the Special Issue “Combinatory Analysis 2018 – In Honor of George Andrews'80th Birthday” resulting from the conference and published in Annals of Combinatorics. In addition to the 37 articles of the Andrews 80 Special Issue, the book includes two new papers. These research contributions explore new grounds and present new achievements, research trends, and problems in the area. The volume is complemented by three special personal contributions: “The Worlds of George Andrews, a daughter's take” by Amy Alznauer, “My association and collaboration with George Andrews” by Krishna Alladi, and “Ramanujan, his Lost Notebook, its importance” by Bruce Berndt. Another aspect which gives this Andrews volume a truly unique character is the “Photos” collection. In addition to pictures taken at “Combinatory Analysis 2018”, the editors selected a variety of photos, many of them not available elsewhere: “Andrews in Austria”, “Andrews in China”, “Andrews in Florida”, “Andrews in Illinois”, and “Andrews in India”. This volume will be of interest to researchers, PhD students, and interested practitioners working in the area of Combinatory Analysis, q-Series, and related fields.

This book presents the state of the art on numerical semigroups and related subjects, offering different perspectives on research in the field and including results and examples that are very difficult to find in a structured exposition elsewhere. The contents comprise the proceedings of the 2018 INdAM “International Meeting on Numerical Semigroups”, held in Cortona, Italy. Talks at the meeting centered not only on traditional types of numerical semigroups, such as Arf or symmetric, and their usual properties, but also on related types of semigroups, such as affine, Puiseux, Weierstrass, and primary, and their applications in other branches of algebra, including semigroup rings, coding theory, star operations, and Hilbert functions. The papers in the book reflect the variety of the talks and derive from research areas including Semigroup Theory, Factorization Theory, Algebraic Geometry, Combinatorics, Commutative Algebra, Coding Theory, and Number Theory. The book is intended for researchers and students who want to learn about recent developments in the theory of numerical semigroups and its connections with other research fields.

This book is the outcome of research initiatives formed during the special ``Research Trimester on Multiple Zeta Values, Multiple Polylogarithms, and Quantum Field Theory''at the ICMAT (Instituto de Ciencias Matemáticas, Madrid) in 2014. The activity was aimed at understanding and deepening recent developments where Feynman and string amplitudes on the one hand, and periods and multiple zeta values on the other, have been at the heart of lively and fruitful interactions between theoretical physics and number theory over the past few decades. In this book, the reader will find research papers as well as survey articles, including open problems, on the interface between number theory, quantum field theory and string theory, written by leading experts in the respective fields. Topics include, among others, elliptic periods viewed from both a mathematical and a physical standpoint; further relations between periods and high energy physics, including cluster algebras and renormalisation theory; multiple Eisenstein series and q-analogues of multiple zeta values (also in connection with renormalisation); double shuffle and duality relations; alternative presentations of multiple zeta values using Ecalle's theory of moulds and arborification; a distribution formula for generalised complex and l-adic polylogarithms; Galois action on knots. Given its scope, the book offers a valuable resource for researchers and graduate students interested in topics related to both quantum field theory, in particular, scattering amplitudes, and number theory.

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.

From July 31 through August 3,1997, the Pennsylvania State University hosted the Topics in Number Theory Conference. The conference was organized by Ken Ono and myself. By writing the preface, I am afforded the opportunity to express my gratitude to Ken for beng the inspiring and driving force behind the whole conference. Without his energy, enthusiasm and skill the entire event would never have occurred. We are extremely grateful to the sponsors of the conference: The National Sci­ ence Foundation, The Penn State Conference Center and the Penn State Depart­ ment of Mathematics. The object in this conference was to provide a variety of presentations giving a current picture of recent, significant work in number theory. There were eight plenary lectures: H. Darmon (McGill University),'Non-vanishing of L-functions and their derivatives modulo p.'A. Granville (University of Georgia),'Mean values of multiplicative functions.'C. Pomerance (University of Georgia),'Recent results in primality testing.'C. Skinner (Princeton University),'Deformations of Galois representations.'R. Stanley (Massachusetts Institute of Technology),'Some interesting hyperplane arrangements.'F. Rodriguez Villegas (Princeton University),'Modular Mahler measures.'T. Wooley (University of Michigan),'Diophantine problems in many variables: The role of additive number theory.'D. Zeilberger (Temple University),'Reverse engineering in combinatorics and number theory.'The papers in this volume provide an accurate picture of many of the topics presented at the conference including contributions from four of the plenary lectures.

Most people tend to view number theory as the very paradigm of pure mathematics. With the advent of computers, however, number theory has been finding an increasing number of applications in practical settings, such as in cryptography, random number generation, coding theory, and even concert hall acoustics. Yet other applications are still emerging - providing number theorists with some major new areas of opportunity. The 1996 IMA summer program on Emerging Applications of Number Theory was aimed at stimulating further work with some of these newest (and most attractive) applications. Concentration was on number theory's recent links with: (a) wave phenomena in quantum mechanics (more specifically, quantum chaos); and (b) graph theory (especially expander graphs and related spectral theory). This volume contains the contributed papers from that meeting and will be of interest to anyone intrigued by novel applications of modern number-theoretical techniques.

This volume includes articles spanning several research areas in number theory, such as arithmetic geometry, algebraic number theory, analytic number theory, and applications in cryptography and coding theory. Most of the articles are the results of collaborations started at the 3rd edition of the Women in Numbers Europe (WINE) conference between senior and mid-level faculty, junior faculty, postdocs, and graduate students. The contents of this book should be of interest to graduate students and researchers in number theory.

This self-contained text presents state-of-the-art results on recurrent sequences and their applications in algebra, number theory, geometry of the complex plane and discrete mathematics. It is designed to appeal to a wide readership, ranging from scholars and academics, to undergraduate students, or advanced high school and college students training for competitions. The content of the book is very recent, and focuses on areas where significant research is currently taking place. Among the new approaches promoted in this book, the authors highlight the visualization of some recurrences in the complex plane, the concurrent use of algebraic, arithmetic, and trigonometric perspectives on classical number sequences, and links to many applications. It contains techniques which are fundamental in other areas of math and encourages further research on the topic. The introductory chapters only require good understanding of college algebra, complex numbers, analysis and basic combinatorics.For Chapters 3, 4 and 6 the prerequisites include number theory, linear algebra and complex analysis. The first part of the book presents key theoretical elements required for a good understanding of the topic. The exposition moves on to to fundamental results and key examples of recurrences and their properties. The geometry of linear recurrences in the complex plane is presented in detail through numerous diagrams, which lead to often unexpected connections to combinatorics, number theory, integer sequences, and random number generation. The second part of the book presents a collection of 123 problems with full solutions, illustrating the wide range of topics where recurrent sequences can be found. This material is ideal for consolidating the theoretical knowledge and for preparing students for Olympiads.

This book presents original peer-reviewed contributions from the London Mathematical Society (LMS) Midlands Regional Meeting and Workshop on'Galois Covers, Grothendieck-Teichmüller Theory and Dessinsd'Enfants', which took place at the University of Leicester, UK, from 4 to 7 June, 2018. Within the theme of the workshop, the collected articles cover a broad range of topics and explore exciting new links between algebraic geometry, representation theory, group theory, number theory and algebraic topology. The book combines research and overview articles by prominent international researchers and provides a valuable resource for researchers and students alike.

This book, the first of two volumes, contains over 250 selected exercises in Algebra which have featured as exam questions for the Arithmetic course taught by the authors at the University of Pisa. Each exercise is presented together with one or more solutions, carefully written with consistent language and notation. A distinguishing feature of this book is the fact that each exercise is unique and requires some creative thinking in order to be solved. The themes covered in this volume are: mathematical induction, combinatorics, modular arithmetic, Abelian groups, commutative rings, polynomials, field extensions, finite fields. The book includes a detailed section recalling relevant theory which can be used as a reference for study and revision. A list of preliminary exercises introduces the main techniques to be applied in solving the proposed exam questions. This volume is aimed at first year students in Mathematics and Computer Science.

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 is intended as a teacher's manual and as an independent-study handbook for students and mathematical competitors. Based on a traditional teaching philosophy and a non-traditional writing approach (the stair-step method), this book consists of new problems with solutions created by the authors. The main idea of this approach is to start from relatively easy problems and “step-by-step” increase the level of difficulty toward effectively maximizing students'learning potential. In addition to providing solutions, a separate table of answers is also given at the end of the book. A broad view of mathematics is covered, well beyond the typical elementary level, by providing more in depth treatment of Geometry and Trigonometry, Number Theory, Algebra, Calculus, and Combinatorics.

This book concentrates on the modern theory of dynamical systems and its interactions with number theory and combinatorics. The greater part begins with a course in analytic number theory and focuses on its links with ergodic theory, presenting an exhaustive account of recent research on Sarnak's conjecture on Möbius disjointness. Selected topics involving more traditional connections between number theory and dynamics are also presented, including equidistribution, homogenous dynamics, and Lagrange and Markov spectra. In addition, some dynamical and number theoretical aspects of aperiodic order, some algebraic systems, and a recent development concerning tame systems are described.

Diese fünfte deutsche Auflage enthält ein ganz neues Kapitel über van der Waerdens Permanenten-Vermutung, sowie weitere neue, originelle und elegante Beweise in anderen Kapiteln.Aus den Rezensionen: “… es ist fast unmöglich, ein Mathematikbuch zu schreiben, das von jedermann gelesen und genossen werden kann, aber Aigner und Ziegler gelingt diese Meisterleistung in virtuosem Stil. […] Dieses Buch erweist der Mathematik einen unschätzbaren Dienst, indem es Nicht-Mathematikern vorführt, was Mathematiker meinen, wenn sie über Schönheit sprechen.” Aus der Laudatio für den “Steele Prize for Mathematical Exposition” 2018'Was hier vorliegt ist eine Sammlung von Beweisen, die in das von Paul Erdös immer wieder zitierte BUCH gehören, das vom lieben (?) Gott verwahrt wird und das die perfekten Beweise aller mathematischen Sätze enthält. Manchmal lässt der Herrgott auch einige von uns Sterblichen in das BUCH blicken, und die so resultierenden Geistesblitze erhellen den Mathematikeralltag mit eleganten Argumenten, überraschenden Zusammenhängen und unerwarteten Volten.'www.mathematik.de, Mai 2002'Eine einzigartige Sammlung eleganter mathematischer Beweise nach der Idee von Paul Erdös, verständlich geschrieben von exzellenten Mathematikern. Dieses Buch gibt anregende Lösungen mit Aha-Effekt, auch für Nicht-Mathematiker.'www.vismath.de'Ein prächtiges, äußerst sorgfältig und liebevoll gestaltetes Buch! Erdös hatte die Idee DES BUCHES, in dem Gott die perfekten Beweise mathematischer Sätze eingeschrieben hat. Das hier gedruckte Buch will eine'very modest approximation'an dieses BUCH sein.... Das Buch von Aigner und Ziegler ist gelungen...'Mathematische Semesterberichte, November 1999'Wer (wie ich) bislang vergeblich versucht hat, einen Blick ins BUCH zu werfen, wird begierig in Aigners und Zieglers BUCH der Beweise schmökern.'www.mathematik.de, Mai 2002

This innovative textbook introduces a new pattern-based approach to learning proof methods in the mathematical sciences. Readers will discover techniques that will enable them to learn new proofs across different areas of pure mathematics with ease. The patterns in proofs from diverse fields such as algebra, analysis, topology and number theory are explored. Specific topics examined include game theory, combinatorics and Euclidean geometry, enabling a broad familiarity.The author, an experienced lecturer and researcher renowned for his innovative view and intuitive style, illuminates a wide range of techniques and examples from duplicating the cube to triangulating polygons to the infinitude of primes to the fundamental theorem of algebra. Intended as a companion for undergraduate students, this text is an essential addition to every aspiring mathematician's toolkit.

This text presents the Eulerian numbers in the context of modern enumerative, algebraic, and geometric combinatorics. The book first studies Eulerian numbers from a purely combinatorial point of view, then embarks on a tour of how these numbers arise in the study of hyperplane arrangements, polytopes, and simplicial complexes. Some topics include a thorough discussion of gamma-nonnegativity and real-rootedness for Eulerian polynomials, as well as the weak order and the shard intersection order of the symmetric group.The book also includes a parallel story of Catalan combinatorics, wherein the Eulerian numbers are replaced with Narayana numbers. Again there is a progression from combinatorics to geometry, including discussion of the associahedron and the lattice of noncrossing partitions.The final chapters discuss how both the Eulerian and Narayana numbers have analogues in any finite Coxeter group, with many of the same enumerative and geometric properties. Thereare four supplemental chapters throughout, which survey more advanced topics, including some open problems in combinatorial topology. This textbook will serve a resource for experts in the field as well as for graduate students and others hoping to learn about these topics for the first time.​

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.

This revised and enlarged fifth edition features four new chapters, which contain highly original and delightful proofs for classics such as the spectral theorem from linear algebra, some more recent jewels like the non-existence of the Borromean rings and other surprises.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 beautifuldrawings... 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.

The primary intent of the book is to introduce an array of beautiful problems in a variety of subjects quickly, pithily and completely rigorously to graduate students and advanced undergraduates. The book takes a number of specific problems and solves them, the needed tools developed along the way in the context of the particular problems. It treats a melange of topics from combinatorial probability theory, number theory, random graph theory and combinatorics. The problems in this book involve the asymptotic analysis of a discrete construct, as some natural parameter of the system tends to infinity. Besides bridging discrete mathematics and mathematical analysis, the book makes a modest attempt at bridging disciplines. The problems were selected with an eye toward accessibility to a wide audience, including advanced undergraduate students. The book could be used for a seminar course in which students present the lectures.

This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible and primitive polynomials, the distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types and new applications of finite fields to other areas of mathematics. For completeness we in­ clude two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number gener­ ators, modular arithmetic, etc.) and computational number theory (primality testing, factoring integers, computation in algebraic number theory, etc.). The problems considered here have many applications in Computer Science, Cod­ ing Theory, Cryptography, Numerical Methods, and so on. There are a few books devoted to more general questions, but the results contained in this book have not till now been collected under one cover. In the present work the author has attempted to point out new links among different areas of the theory of finite fields. It contains many very important results which previously could be found only in widely scattered and hardly available conference proceedings and journals. In particular, we extensively review results which originally appeared only in Russian, and are not well known to mathematicians outside the former USSR.

Lattices are discrete subgroups of maximal rank in a Euclidean space. To each such geometrical object, we can attach a canonical sphere packing which, assuming some regularity, has a density. The question of estimating the highest possible density of a sphere packing in a given dimension is a fascinating and difficult problem: the answer is known only up to dimension 3. This book thus discusses a beautiful and central problem in mathematics, which involves geometry, number theory, coding theory and group theory, centering on the study of extreme lattices, i.e. those on which the density attains a local maximum, and on the so-called perfection property. Written by a leader in the field, it is closely related to, though disjoint in content from, the classic book by J.H. Conway and N.J.A. Sloane, Sphere Packings, Lattices and Groups, published in the same series as vol. 290. Every chapter except the first and the last contains numerous exercises. For simplicity those chapters involving heavy computational methods contain only few exercises. It includes appendices on Semi-Simple Algebras and Quaternions and Strongly Perfect Lattices.

The (mathematical) heroes of this book are'perfect proofs': brilliant ideas, clever connections and wonderful observations that bring new insight and surprising perspectives on basic and challenging problems from Number Theory, Geometry, Analysis, Combinatorics, and Graph Theory. Thirty beautiful examples are presented here. They are candidates for The Book in which God records the perfect proofs - according to the late Paul Erdös, who himself suggested many of the topics in this collection.The result is a book which will be fun for everybody with an interest in mathematics, requiring only a very modest (undergraduate) mathematical background.

The problem of representing an integer as a sum of squares of integers is one of the oldest and most significant in mathematics. It goes back at least 2000 years to Diophantus, and continues more recently with the works of Fermat, Euler, Lagrange, Jacobi, Glaisher, Ramanujan, Hardy, Mordell, Andrews, and others. Jacobi's elliptic function approach dates from his epic Fundamenta Nova of 1829. Here, the author employs his combinatorial/elliptic function methods to derive many infinite families of explicit exact formulas involving either squares or triangular numbers, two of which generalize Jacobi's (1829) 4 and 8 squares identities to 4n2 or 4n(n+1) squares, respectively, without using cusp forms such as those of Glaisher or Ramanujan for 16 and 24 squares. These results depend upon new expansions for powers of various products of classical theta functions. This is the first time that infinite families of non-trivial exact explicit formulas for sums of squares have been found. The author derives his formulas by utilizing combinatorics to combine a variety of methods and observations from the theory of Jacobi elliptic functions, continued fractions, Hankel or Turanian determinants, Lie algebras, Schur functions, and multiple basic hypergeometric series related to the classical groups. His results (in Theorem 5.19) generalize to separate infinite families each of the 21 of Jacobi's explicitly stated degree 2, 4, 6, 8 Lambert series expansions of classical theta functions in sections 40-42 of the Fundamental Nova. The author also uses a special case of his methods to give a derivation proof of the two Kac and Wakimoto (1994) conjectured identities concerning representations of a positive integer by sums of 4n2 or 4n(n+1) triangular numbers, respectively. These conjectures arose in the study of Lie algebras and have also recently been proved by Zagierusing modular forms. George Andrews says in a preface of this book, `This impressive work will undoubtedly spur others both in elliptic functions and in modular forms to build on these wonderful discoveries.'Audience: This research monograph on sums of squares is distinguished by its diversity of methods and extensive bibliography. It contains both detailed proofs and numerous explicit examples of the theory. This readable work will appeal to both students and researchers in number theory, combinatorics, special functions, classical analysis, approximation theory, and mathematical physics.

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. Some of the proofs are classics, but many are new and brilliant proofs of classical results....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'... the style is clear and entertaining, the level is close to elementary... and the proofs are brilliant....'LMS Newsletter, January 1999 This third edition offers two new chapters, on partition identities, and on card shuffling. Three proofs of Euler's most famous infinite series appear in a separate chapter. There is also a number of other improvements, such as an exciting new way to'enumerate the rationals'.

The present book is rare, even unique of its kind, at least among mathematics texts published in Russian. You have before you neither a textbook nor a monograph, although these selected chapters from elementary mathematics certainly constitute a fine educational tool. It is my opinion that this is more than just another book about mathematics and the art of teaching that subject. Without considering the actual topics treated (the author himself has described these in sufficient detail in of the book as a whole, the Introduction), I shall attempt to convey a general idea and describe the impressions it makes on the reader. Almost every chapter begins by considering well-known problems of elementary mathematics. Now, every worthwhile elementary problem has hidden behind its diverting formulation what might be called'higher mathematics,'or, more simply, mathematics, and it is this that the author demonstrates to the reader in this book. It is thus to be expected that every chapter should contain subject matter that is far from elementary. The end result of reading the book is that the material treated has become for the reader'three-dimensional'as it were, as in a hologram, capable of being viewed from all sides.

This book can be seen as a continuation of Equations and Inequalities: El­ ementary Problems and Theorems in Algebra and Number Theory by the same authors, and published as the first volume in this book series. How­ ever, it can be independently read or used as a textbook in its own right. This book is intended as a text for a problem-solving course at the first­ or second-year university level, as a text for enrichment classes for talented high-school students, or for mathematics competition training. It can also be used as a source of supplementary material for any course dealing with combinatorics, graph theory, number theory, or geometry, or for any of the discrete mathematics courses that are offered at most American and Canadian universities. The underlying'philosophy'of this book is the same as that of Equations and Inequalities. The following paragraphs are therefore taken from the preface of that book.

Exploring the connections between arithmetic and geometric properties of algebraic varieties has been the object of much fruitful study for a long time, especially in the case of curves. The aim of the Summer School and Conference on'Higher Dimensional Varieties and Rational Points'held in Budapest, Hungary during September 2001 was to bring together students and experts from the arithmetic and geometric sides of algebraic geometry in order to get a better understanding of the current problems, interactions and advances in higher dimension. The lecture series and conference lectures assembled in this volume give a comprehensive introduction to students and researchers in algebraic geometry and in related fields to the main ideas of this rapidly developing area.

This book grew out of our lectures given in the Oberseminar on'Cod­ ing Theory and Number Theory'at the Mathematics Institute of the Wiirzburg University in the Summer Semester, 2001. The coding the­ ory combines mathematical elegance and some engineering problems to an unusual degree. The major advantage of studying coding theory is the beauty of this particular combination of mathematics and engineering. In this book we wish to introduce some practical problems to the math­ ematician and to address these as an essential part of the development of modern number theory. The book consists of five chapters and an appendix. Chapter 1 may mostly be dropped from an introductory course of linear codes. In Chap­ ter 2 we discuss some relations between the number of solutions of a diagonal equation over finite fields and the weight distribution of cyclic codes. Chapter 3 begins by reviewing some basic facts from elliptic curves over finite fields and modular forms, and shows that the weight distribution of the Melas codes is represented by means of the trace of the Hecke operators acting on the space of cusp forms. Chapter 4 is a systematic study of the algebraic-geometric codes. For a long time, the study of algebraic curves over finite fields was the province of pure mathematicians. In the period 1977 - 1982, V. D. Goppa discovered an amazing connection between the theory of algebraic curves over fi­ nite fields and the theory of q-ary codes.

It is gratifying that this textbook is still sufficiently popular to warrant a third edition. I have used the opportunity to improve and enlarge the book. When the second edition was prepared, only two pages on algebraic geometry codes were added. These have now been removed and replaced by a relatively long chapter on this subject. Although it is still only an introduction, the chapter requires more mathematical background of the reader than the remainder of this book. One of the very interesting recent developments concerns binary codes defined by using codes over the alphabet 7l.4• There is so much interest in this area that a chapter on the essentials was added. Knowledge of this chapter will allow the reader to study recent literature on 7l. -codes. 4 Furthermore, some material has been added that appeared in my Springer Lec­ ture Notes 201, but was not included in earlier editions of this book, e. g. Generalized Reed-Solomon Codes and Generalized Reed-Muller Codes. In Chapter 2,a section on'Coding Gain'( the engineer's justification for using error-correcting codes) was added. For the author, preparing this third edition was a most welcome return to mathematics after seven years of administration. For valuable discussions on the new material, I thank C.P.l.M.Baggen, I. M.Duursma, H.D.L.Hollmann, H. C. A. van Tilborg, and R. M. Wilson. A special word of thanks to R. A. Pellikaan for his assistance with Chapter 10.

The Advanced Study Institute brought together researchers in the main areas of special functions and applications to present recent developments in the theory, review the accomplishments of past decades, and chart directions for future research. Some of the topics covered are orthogonal polynomials and special functions in one and several variables, asymptotic, continued fractions, applications to number theory, combinatorics and mathematical physics, integrable systems, harmonic analysis and quantum groups, Painlevé classification.

This book is intended as a text for a course on cryptography with emphasis on algebraic methods. It is written so as to be accessible to graduate or advanced undergraduate students, as well as to scientists in other fields. The first three chapters form a self-contained introduction to basic concepts and techniques. Here my approach is intuitive and informal. For example, the treatment of computational complexity in Chapter 2, while lacking formalistic rigor, emphasizes the aspects of the subject that are most important in cryptography. Chapters 4-6 and the Appendix contain material that for the most part has not previously appeared in textbook form. A novel feature is the inclusion of three types of cryptography -'hidden monomial'systems, combinatorial-algebraic sys­ tems, and hyperelliptic systems - that are at an early stage of development. It is too soon to know which, if any, of these cryptosystems will ultimately be of practical use. But in the rapidly growing field of cryptography it is worthwhile to continually explore new one-way constructions coming from different areas of mathematics. Perhaps some of the readers will contribute to the research that still needs to be done. This book is designed not as a comprehensive reference work, but rather as a selective textbook. The many exercises (with answers at the back of the book) make it suitable for use in a math or computer science course or in a program of independent study.

To mark the World Mathematical Year 2000 an International Conference on Number Theory and Discrete Mathematics in honour of the legendary Indian Mathematician Srinivasa Ramanuj~ was held at the centre for Advanced study in Mathematics, Panjab University, Chandigarh, India during October 2-6, 2000. This volume contains the proceedings of that conference. In all there were 82 participants including 14 overseas participants from Austria, France, Hungary, Italy, Japan, Korea, Singapore and the USA. The conference was inaugurated by Prof. K. N. Pathak, Hon. Vice-Chancellor, Panjab University, Chandigarh on October 2, 2000. Prof. Bruce C. Berndt of the University of Illinois, Urbana­ Chaimpaign, USA delivered the key note address entitled'The Life, Notebooks and Mathematical Contributions of Srinivasa Ramanujan'. He described Ramanujan--as one of this century's most influential Mathematicians. Quoting Mark K. ac, Prof. George E. Andrews of the Pennsylvania State University, USA, in his message for the conference, described Ramanujan as a'magical genius'. During the 5-day deliberations invited speakers gave talks on various topics in number theory and discrete mathematics. We mention here a few of them just as a sampling: • M. Waldschmidt, in his article, provides a very nice introduction to the topic of multiple poly logarithms and their special values. • C.

The computation of invariants of algebraic number fields such as integral bases, discriminants, prime decompositions, ideal class groups, and unit groups is important both for its own sake and for its numerous applications, for example, to the solution of Diophantine equations. The practical com­ pletion of this task (sometimes known as the Dedekind program) has been one of the major achievements of computational number theory in the past ten years, thanks to the efforts of many people. Even though some practical problems still exist, one can consider the subject as solved in a satisfactory manner, and it is now routine to ask a specialized Computer Algebra Sys­ tem such as Kant/Kash, liDIA, Magma, or Pari/GP, to perform number field computations that would have been unfeasible only ten years ago. The (very numerous) algorithms used are essentially all described in A Course in Com­ putational Algebraic Number Theory, GTM 138, first published in 1993 (third corrected printing 1996), which is referred to here as [CohO]. That text also treats other subjects such as elliptic curves, factoring, and primality testing. Itis important and natural to generalize these algorithms. Several gener­ alizations can be considered, but the most important are certainly the gen­ eralizations to global function fields (finite extensions of the field of rational functions in one variable overa finite field) and to relative extensions ofnum­ ber fields. As in [CohO], in the present book we will consider number fields only and not deal at all with function fields.

Proceedings of `The Seventh International Research Conference on Fibonacci Numbers and Their Applications', Technische Universität, Graz, Austria, July 15-19, 1996

Why Olympiads? Working mathematiciansoftentell us that results in the?eld are achievedafter long experience and a deep familiarity with mathematical objects, that progress is made slowly and collectively, and that?ashes of inspiration are mere punctuation in periods of sustained effort. TheOlympiadenvironment,incontrast,demandsarelativelybriefperiodofintense concentration,asksforquickinsightsonspeci?coccasions,andrequiresaconcentrated but isolated effort. Yet we have foundthat participantsin mathematicsOlympiadshave oftengoneontobecome?rst-classmathematiciansorscientistsandhaveattachedgreat signi?cance to their early Olympiad experiences. For many of these people, the Olympiad problem is an introduction, a glimpse into the world of mathematics not afforded by the usual classroom situation. A good Olympiad problem will capture in miniature the process of creating mathematics. It's all there: the period of immersion in the situation, the quiet examination of possible approaches, the pursuit of various paths to solution. There is the fruitless dead end, as well as the path that ends abruptly but offers new perspectives, leading eventually to the discoveryof a better route. Perhapsmost obviously,grapplingwith a goodproblem provides practice in dealing with the frustration of working at material that refuses to yield. If the solver is lucky, there will be the moment of insight that heralds the start of a successful solution. Like a well-crafted work of?ction, a good Olympiad problem tells a story of mathematical creativity that captures a good part of the real experience and leaves the participant wanting still more. And this book gives us more.