This book grew out of a course which I gave during the winter term 1997/98 at the Universitat Munster. The course covered the material which here is presented in the first three chapters. The fourth more advanced chapter was added to give the reader a rather complete tour through all the important aspects of the theory of locally convex vector spaces over nonarchimedean fields. There is one serious restriction, though, which seemed inevitable to me in the interest of a clear presentation. In its deeper aspects the theory depends very much on the field being spherically complete or not. To give a drastic example, if the field is not spherically complete then there exist nonzero locally convex vector spaces which do not have a single nonzero continuous linear form. Although much progress has been made to overcome this problem a really nice and complete theory which to a large extent is analogous to classical functional analysis can only exist over spherically complete field8. I therefore allowed myself to restrict to this case whenever a conceptual clarity resulted. Although I hope that thi8 text will also be useful to the experts as a reference my own motivation for giving that course and writing this book was different. I had the reader in mind who wants to use locally convex vector spaces in the applications and needs a text to quickly gra8p this theory.

This book is a survey of the most important directions of research in transcendental number theory. For readers with no specific background in transcendental number theory, the book provides both an overview of the basic concepts and techniques and also a guide to the most important results and references.

A systematic survey of all the basic results on the theory of discrete subgroups of Lie groups, presented in a convenient form for users. The book makes the theory accessible to a wide audience, and will be a standard reference for many years to come.

In the summer of 1991 the Department of Mathematics and Statistics of the Universite de Montreal was fortunate to host the NATO Advanced Study Institute "Algebras and Orders" as its 30th Seminaire de mathematiques superieures (SMS), a summer school with a long tradition and well-established reputation. This book contains the contributions of the invited speakers. Universal algebra- which established itself only in the 1930's- grew from traditional algebra (e.g., groups, modules, rings and lattices) and logic (e.g., propositional calculus, model theory and the theory of relations). It started by extending results from these fields but by now it is a well-established and dynamic discipline in its own right. One of the objectives of the ASI was to cover a broad spectrum of topics in this field, and to put in evidence the natural links to, and interactions with, boolean algebra, lattice theory, topology, graphs, relations, automata, theoretical computer science and (partial) orders. The theory of orders is a relatively young and vigorous discipline sharing certain topics as well as many researchers and meetings with universal algebra and lattice theory. W. Taylor surveyed the abstract clone theory which formalizes the process of compos ing operations (i.e., the formation of term operations) of an algebra as a special category with countably many objects, and leading naturally to the interpretation and equivalence of varieties."

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."

Robert A. Rankin, one of the world's foremost authorities on modular forms and a founding editor of The Ramanujan Journal, died on January 27, 2001, at the age of 85. Rankin had broad interests and contributed fundamental papers in a wide variety of areas within number theory, geometry, analysis, and algebra. To commemorate Rankin's life and work, the editors have collected together 25 papers by several eminent mathematicians reflecting Rankin's extensive range of interests within number theory. Many of these papers reflect Rankin's primary focus in modular forms. It is the editors' fervent hope that mathematicians will be stimulated by these papers and gain a greater appreciation for Rankin's contributions to mathematics.
This volume would be an inspiration to students and researchers in the areas of number theory and modular forms.

A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.

This volume contains the proceedings of the very successful second China-Japan Seminar held in lizuka, Fukuoka, Japan, during March 12-16, 2001 under the support of the Japan Society for the Promotion of Science (JSPS) and the National Science Foundation of China (NSFC), and some invited papers of eminent number-theorists who visited Japan during 1999-2001 at the occasion of the Conference at the Research Institute of Mathematical Sciences (RIMS), Kyoto University. The proceedings of the 1st China-Japan Seminar held in September 1999 in Beijing has been published recently {2002) by Kluwer as DEVM 6 which also contains some invited papers. The topics of that volume are, however, restricted to analytic number theory and many papers in this field are assembled. In this volume, we return to the lines of the previous one "Number Theory and its Applications," published as DEVM 2 by Kluwer in 1999 and uphold the spirit of presenting various topics in number theory and related areas with possible applica tions, in a unified manner, and this time in nearly a book form with a well-prepared index. We accomplish this task by collecting highly informative and readable survey papers (including half-survey type papers), giving overlooking surveys of the hith erto obtained results in up-to-the-hour form with insight into the new developments, which are then analytically continued to a collection of high standard research papers which are concerned with rather diversed areas and will give good insight into new researches in the new century."

This volume contains edited versions of 11 contributions given by main speakers at the NATO Advanced Study Institute on lReal and Complex Dynamical Systems in Hiller0d, Denmark, June 20th - July 2nd, 1993. The vision of the institute was to illustrate the interplay between two important fields of Mathematics: Real Dynamical Systems and Complex Dynamical Systems. The interaction between these two fields has been growing over the years. Problems in Real Dynamical Systems have recently been solved using complex tools in the real or by extension to the complex. In return, problems in Complex Dynamical Systems have been settled using results from Real Dynamical Systems. The programme of the institute was to examine the state of the art of central parts of both Real and Complex Dynamical Systems, to reinforce contact between the two aspects of the theory and to make recent progress in each accessible to a larger group of mathematicians.

The common solutions of a finite number of polynomial equations in a finite number of variables constitute an algebraic variety. The degrees of freedom of a moving point on the variety is the dimension of the variety. A one-dimensional variety is a curve and a two-dimensional variety is a surface. A three-dimensional variety may be called asolid. Most points of a variety are simple points. Singularities are special points, or points of multiplicity greater than one. Points of multiplicity two are double points, points of multiplicity three are tripie points, and so on. A nodal point of a curve is a double point where the curve crosses itself, such as the alpha curve. A cusp is a double point where the curve has a beak. The vertex of a cone provides an example of a surface singularity. A reversible change of variables gives abirational transformation of a variety. Singularities of a variety may be resolved by birational transformations.

The theory of transcendental numbers is closely related to the study of diophantine approximation. This book deals with values of the usual exponential function ez: a central open problem is the conjecture on algebraic independence of logarithms of algebraic numbers. Two chapters provide complete and simplified proofs of zero estimates (due to Philippon) on linear algebraic groups.

Important results on the Hilbert modular group and Hilbert modular forms are introduced and described in this book. In recent times, this branch of number theory has been given more and more attention and thus the need for a comprehensive presentation of these results, previously scattered in research journal papers, has become obvious. The main aim of this book is to give a description of the singular cohomology and its Hodge decomposition including explicit formulae. The author has succeeded in giving proofs which are both elementary and complete. The book contains an introduction to Hilbert modular forms, reduction theory, the trace formula and Shimizu's formulae, the work of Matsushima and Shimura, analytic continuation of Eisenstein series, the cohomology and its Hodge decomposition. Basic facts about algebraic numbers, integration, alternating differential forms and Hodge theory are included in convenient appendices so that the book can be used by students with a knowledge of complex analysis (one variable) and algebra.

Computers have stretched the limits of what is possible in mathematics. More: they have given rise to new fields of mathematical study; the analysis of new and traditional algorithms, the creation of new paradigms for implementing computational methods, the viewing of old techniques from a concrete algorithmic vantage point, to name but a few. Computational Algebra and Number Theory lies at the lively intersection of computer science and mathematics. It highlights the surprising width and depth of the field through examples drawn from current activity, ranging from category theory, graph theory and combinatorics, to more classical computational areas, such as group theory and number theory. Many of the papers in the book provide a survey of their topic, as well as a description of present research. Throughout the variety of mathematical and computational fields represented, the emphasis is placed on the common principles and the methods employed. Audience: Students, experts, and those performing current research in any of the topics mentioned above.

This book details the classical part of the theory of algebraic number theory, excluding class-field theory and its consequences. Coverage includes: ideal theory in rings of algebraic integers, p-adic fields and their finite extensions, ideles and adeles, zeta-functions, distribution of prime ideals, Abelian fields, the class-number of quadratic fields, and factorization problems. The book also features exercises and a list of open problems.

This monograph is intended to be a complete treatment of the metrical the ory of the (regular) continued fraction expansion and related representations of real numbers. We have attempted to give the best possible results known so far, with proofs which are the simplest and most direct. The book has had a long gestation period because we first decided to write it in March 1994. This gave us the possibility of essentially improving the initial versions of many parts of it. Even if the two authors are different in style and approach, every effort has been made to hide the differences. Let 0 denote the set of irrationals in I = [0,1]. Define the (reg ular) continued fraction transformation T by T (w) = fractional part of n 1/w, w E O. Write T for the nth iterate of T, n E N = {O, 1, ... }, n 1 with TO = identity map. The positive integers an(w) = al(T - (W)), n E N+ = {1,2*** }, where al(w) = integer part of 1/w, w E 0, are called the (regular continued fraction) digits of w. Writing . for arbitrary indeterminates Xi, 1 :::; i :::; n, we have w = lim [al(w),*** , an(w)], w E 0, n--->oo thus explaining the name of T. The above equation will be also written as w = lim [al(w), a2(w),***], w E O.

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."

Solutions of equations in integers is the central problem of number theory and is the focus of this book. The amount of material is suitable for a one-semester course. The author has tried to avoid the ad hoc proofs in favor of unifying ideas that work in many situations. There are exercises at the end of almost every section, so that each new idea or proof receives immediate reinforcement.

This book provides a good introduction to the classical elementary number theory and the modern algorithmic number theory, and their applications in computing and information technology, including computer systems design, cryptography and network security. In this second edition proofs of many theorems have been provided, further additions and corrections were made.

The book treats four mathematical concepts which play a fundamental role in many different areas of mathematics: symbolic sums, recurrence (difference) equations, generating functions, and asymptotic estimates. Their key features, in isolation or in combination, their mastery by paper and pencil or by computer programs, and their applications to problems in pure mathematics or to "real world problems" (e.g. the analysis of algorithms) are studied. The book is intended as an algorithmic supplement to the bestselling "Concrete Mathematics" by Graham, Knuth and Patashnik.

This book has a nonstandard choice of topics, including material on differential galois groups and proofs of the transcendence of e and pi.

The author uses a conversational tone and has included a selection of stamps to accompany the text.

This well-developed, accessible text details the historical development of the subject throughout. It also provides wide-ranging coverage of significant results with comparatively elementary proofs, some of them new. This second edition contains two new chapters that provide a complete proof of the Mordel-Weil theorem for elliptic curves over the rational numbers and an overview of recent progress on the arithmetic of elliptic curves.

This book surveys the current state of the "small" sieve methods developed by Brun, Selberg and later workers. The book is suitable for university graduates making their first acquaintance with the subject, leading them towards the frontiers of modern research and unsolved problems in the subject area.

Intended for advanced level students in computer science and mathematics, this key text, now in a brand new edition, provides a survey of recent progress in primality testing and integer factorization, with implications for factoring based public key cryptography. For this updated and revised edition, notable new features include a comparison of the Rabin-Miller probabilistic test in RP, the Atkin-Morain elliptic curve test in ZPP and the AKS deterministic test.

Numbers ... , natural, rational, real, complex, p-adic .... What do you know about p-adic numbers? Probably, you have never used any p-adic (nonrational) number before now. I was in the same situation few years ago. p-adic numbers were considered as an exotic part of pure mathematics without any application. I have also used only real and complex numbers in my investigations in functional analysis and its applications to the quantum field theory and I was sure that these number fields can be a basis of every physical model generated by nature. But recently new models of the quantum physics were proposed on the basis of p-adic numbers field Qp. What are p-adic numbers, p-adic analysis, p-adic physics, p-adic probability? p-adic numbers were introduced by K. Hensel (1904) in connection with problems of the pure theory of numbers. The construction of Qp is very similar to the construction of (p is a fixed prime number, p = 2,3,5, ... ,127, ... ). Both these number fields are completions of the field of rational numbers Q. But another valuation 1 . Ip is introduced on Q instead of the usual real valuation 1 . I* We get an infinite sequence of non isomorphic completions of Q : Q2, Q3, ... , Q127, ... , IR = Qoo* These fields are the only possibilities to com plete Q according to the famous theorem of Ostrowsky.

John Wallis (1616-1703) was the most influential English mathematician prior to Newton. He published his most famous work, Arithmetica Infinitorum, in Latin in 1656. This book studied the quadrature of curves and systematised the analysis of Descartes and Cavelieri. Upon publication, this text immediately became the standard book on the subject and was frequently referred to by subsequent writers. This will be the first English translation of this text ever to be published.