Written by an authority with great practical and teaching experience in the field, this book addresses a number of topics in computational number theory. Chapters one through five form a homogenous subject matter suitable for a six-month or year-long course in computational number theory. The subsequent chapters deal with more miscellaneous subjects.

Aimed at the novice rather than the connoisseur and stressing the role of examples and motivation, this text is suitable not only for use in a graduate course, but also for self-study in the subject by interested graduate students. More than 400 exercises testing the understanding of the general theory in the text are included in this new edition.

The theory of elliptic curves and modular forms provides a fruitful meeting ground for such diverse areas as number theory, complex analysis, algebraic geometry, and representation theory. This book starts out with a problem from elementary number theory and proceeds to lead its reader into the modern theory, covering such topics as the Hasse-Weil L-function and the conjecture of Birch and Swinnerton-Dyer. This new edition details the current state of knowledge of elliptic curves.

Algorithms and Theory of Computation Handbook, Second Edition in a two volume set, provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques come together to deliver efficient solutions to important practical problems. New to the Second Edition: Along with updating and revising many of the existing chapters, this second edition contains more than 20 new chapters. This edition now covers external memory, parameterized, self-stabilizing, and pricing algorithms as well as the theories of algorithmic coding, privacy and anonymity, databases, computational games, and communication networks. It also discusses computational topology, computational number theory, natural language processing, and grid computing and explores applications in intensity-modulated radiation therapy, voting, DNA research, systems biology, and financial derivatives. This best-selling handbook continues to help computer professionals and engineers find significant information on various algorithmic topics. The expert contributors clearly define the terminology, present basic results and techniques, and offer a number of current references to the in-depth literature. They also provide a glimpse of the major research issues concerning the relevant topics

The sixth Algorithmic Number Theory Symposium was held at the University of Vermont, in Burlington, from 13–18 June 2004. The organization was a joint e?ort of number theorists from around the world. There were four invited talks at ANTS VI, by Dan Bernstein of the Univ- sity of Illinois at Chicago, Kiran Kedlaya of MIT, Alice Silverberg of Ohio State University, and Mark Watkins of Pennsylvania State University. Thirty cont- buted talks were presented, and a poster session was held. This volume contains the written versions of the contributed talks and three of the four invited talks. (Not included is the talk by Dan Bernstein.) ANTS in Burlington is the sixth in a series that began with ANTS I in 1994 at Cornell University, Ithaca, New York, USA and continued at Universit ́eB- deaux I, Bordeaux, France (1996), Reed College, Portland, Oregon, USA (1998), the University of Leiden, Leiden, The Netherlands (2000), and the University of Sydney, Sydney, Australia (2002). The proceedings have been published as volumes 877, 1122, 1423, 1838, and 2369 of Springer-Verlag’s Lecture Notes in Computer Science series. The organizers of the 2004 ANTS conference express their special gratitude and thanks to John Cannon and Joe Buhler for invaluable behind-the-scenes advice.

The primary goal of this text is to present the theoretical foundation of the field of Fourier analysis. This book is mainly addressed to graduate students in mathematics and is designed to serve for a three-course sequence on the subject. The only prerequisite for understanding the text is satisfactory completion of a course in measure theory, Lebesgue integration, and complex variables. This book is intended to present the selected topics in some depth and stimulate further study. Although the emphasis falls on real variable methods in Euclidean spaces, a chapter is devoted to the fundamentals of analysis on the torus. This material is included for historical reasons, as the genesis of Fourier analysis can be found in trigonometric expansions of periodic functions in several variables. While the 1st edition was published as a single volume, the new edition will contain 120 pp of new material, with an additional chapter on time-frequency analysis and other modern topics. As a result, the book is now being published in 2 separate volumes, the first volume containing the classical topics (Lp Spaces, Littlewood-Paley Theory, Smoothness, etc...), the second volume containing the modern topics (weighted inequalities, wavelets, atomic decomposition, etc...). From a review of the first edition: “Grafakos’s book is very user-friendly with numerous examples illustrating the definitions and ideas. It is more suitable for readers who want to get a feel for current research. The treatment is thoroughly modern with free use of operators and functional analysis. Morever, unlike many authors, Grafakos has clearly spent a great deal of time preparing the exercises.” - Ken Ross, MAA Online

Algorithms and Theory of Computation Handbook, Second Edition: General Concepts and Techniques provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques come together to deliver efficient solutions to important practical problems. Along with updating and revising many

Discovered at the turn of the 20th century, p-adic numbers are frequently used by mathematicians and physicists. This text is a self-contained presentation of basic p-adic analysis with a focus on analytic topics. It offers many features rarely treated in introductory p-adic texts such as topological models of p-adic spaces inside Euclidian space, a special case of Hazewinkel’s functional equation lemma, and a treatment of analytic elements.

Manifolds play an important role in topology, geometry, complex analysis, algebra, and classical mechanics. Learning manifolds differs from most other introductory mathematics in that the subject matter is often completely unfamiliar. This introduction guides readers by explaining the roles manifolds play in diverse branches of mathematics and physics. The book begins with the basics of general topology and gently moves to manifolds, the fundamental group, and covering spaces.

From the reviews: "The book is well written. We find here many examples. Each chapter is followed by exercises, and at the end of the book there are outline solutions to some of them. [...] I especially appreciated the lively style of the book; [...] one is quickly able to find necessary details." EMS Newsletter