"Number Theory and Related Fields" collects contributions based on the proceedings of the "International Number Theory Conference in Memory of Alf van der Poorten," hosted by CARMA and held March 12-16th 2012 at the University of Newcastle, Australia. The purpose of the conference was to promote number theory research in Australia while commemorating the legacy of Alf van der Poorten, who had written over 170 papers on the topic of number theory and collaborated with dozens of researchers. The research articles and surveys presented in this book were written by some of the most distinguished mathematicians in the field of number theory, and articles will include related topics that focus on the various research interests of Dr. van der Poorten.

Limit theorems and asymptotic results form a central topic in probability theory and mathematical statistics. New and non-classical limit theorems have been discovered for processes in random environments, especially in connection with random matrix theory and free probability. These questions and the techniques for answering them combine asymptotic enumerative combinatorics, particle systems and approximation theory, and are important for new approaches in geometric and metric number theory as well. Thus, the contributions in this book include a wide range of applications with surprising connections ranging from longest common subsequences for words, permutation groups, random matrices and free probability to entropy problems and metric number theory.

The book is the product of a conference that took place in August 2011 in Bielefeld, Germany to celebrate the 60th birthday of Friedrich Gotze, a noted expert in this field."

This book is divided into two parts. The first part is preliminary and consists of algebraic number theory and the theory of semisimple algebras. There are two principal topics: classification of quadratic forms and quadratic Diophantine equations. The second topic is a new framework which contains the investigation of Gauss on the sums of three squares as a special case. To make the book concise, the author proves some basic theorems in number theory only in some special cases. However, the book is self-contained when the base field is the rational number field, and the main theorems are stated with an arbitrary number field as the base field. So the reader familiar with class field theory will be able to learn the arithmetic theory of quadratic forms with no further references.

Total Domination in Graphs gives a clear understanding of this topic to any interested reader who has a modest background in graph theory. This book provides and explores the fundamentals of total domination in graphs. Some of the topics featured include the interplay between total domination in graphs and transversals in hypergraphs, and the association with total domination in graphs and diameter-2-critical graphs. Several proofs are included in this text which enables readers to acquaint themselves with a toolbox of proof techniques and ideas with which to attack open problems in the field. This work is an excellent resource for students interested in beginning their research in this field. Additionally, established researchers will find the book valuable to have as it contains the latest developments and open problems.

This is a substantially revised and updated introduction to arithmetic topics, both ancient and modern, that have been at the centre of interest in applications of number theory, particularly in cryptography. As such, no background in algebra or number theory is assumed, and the book begins with a discussion of the basic number theory that is needed. The approach taken is algorithmic, emphasising estimates of the efficiency of the techniques that arise from the theory, and one special feature is the inclusion of recent applications of the theory of elliptic curves. Extensive exercises and careful answers are an integral part all of the chapters.

The aim of this book is to illustrate by significant special examples three aspects of the theory of Diophantine approximations: the formal relationships that exist between counting processes and the functions entering the theory; the determination of these functions for numbers given as classical numbers; and certain asymptotic estimates holding almost everywhere.
Each chapter works out a special case of a much broader general theory, as yet unknown. Indications for this are given throughout the book, together with reference to current publications. The book may be used in a course in number theory, whose students will thus be put in contact with interesting but accessible problems on the ground floor of mathematics.

This is a second edition of Lang's well-known textbook. It covers all of the basic material of classical algebraic number theory, giving the student the background necessary for the study of further topics in algebraic number theory, such as cyclotomic fields, or modular forms.

"Lang's books are always of great value for the graduate student and the research mathematician. This updated edition of Algebraic number theory is no exception."--MATHEMATICAL REVIEWS

This book has grown out of a course of lectures on elliptic functions, given in German, at the Swiss Federal Institute of Technology, Zurich, during the summer semester of 1982. Its aim is to give some idea of the theory of elliptic functions, and of its close connexion with theta-functions and modular functions, and to show how it provides an analytic approach to the solution of some classical problems in the theory of numbers. It comprises eleven chapters. The first seven are function-theoretic, and the next four concern arithmetical applications. There are Notes at the end of every chapter, which contain references to the literature, comments on the text, and on the ramifications, old and new, of the problems dealt with, some of them extending into cognate fields. The treatment is self-contained, and makes no special demand on the reader's knowledge beyond the elements of complex analysis in one variable, and of group theory.

This volume contains the original lecture notes presented by A. Weil in which the concept of adeles was first introduced, in conjunction with various aspects of C.L. Siegel's work on quadratic forms. Serving as an introduction to the subject, these notes may also provide stimulation for further research.

The plan of this book had its inception in a course of lectures on arithmetical functions given by me in the summer of 1964 at the Forschungsinstitut fUr Mathematik of the Swiss Federal Institute of Technology, Zurich, at the invitation of Professor Beno Eckmann. My Introduction to Analytic Number Theory has appeared in the meanwhile, and this book may be looked upon as a sequel. It presupposes only a modicum of acquaintance with analysis and number theory. The arithmetical functions considered here are those associated with the distribution of prime numbers, as well as the partition function and the divisor function. Some of the problems posed by their asymptotic behaviour form the theme. They afford a glimpse of the variety of analytical methods used in the theory, and of the variety of problems that await solution. I owe a debt of gratitude to Professor Carl Ludwig Siegel, who has read the book in manuscript and given me the benefit of his criticism. I have improved the text in several places in response to his comments. I must thank Professor Raghavan Narasimhan for many stimulating discussions, and Mr. Henri Joris for the valuable assistance he has given me in checking the manuscript and correcting the proofs. K. Chandrasekharan July 1970 Contents Chapter I The prime number theorem and Selberg's method 1. Selberg's fonnula . . . . . . 1 2. A variant of Selberg's formula 6 12 3. Wirsing's inequality . . . . . 17 4. The prime number theorem. ."

The aim of this book is to serve both as an introduction to profinite groups and as a reference for specialists in some areas of the theory. The book is reasonably self-contained. Profinite groups are Galois groups. As such they are of interest in algebraic number theory. Much of recent research on abstract infinite groups is related to profinite groups because residually finite groups are naturally embedded in a profinite group. In addition to basic facts about general profinite groups, the book emphasizes free constructions (particularly free profinite groups and the structure of their subgroups). Homology and cohomology is described with a minimum of prerequisites.

This second edition contains three new appendices dealing with a new characterization of free profinite groups, presentations of pro-p groups and a new conceptually simpler approach to the proof of some classical subgroup theorems. Throughout the text there are additions in the form of new results, improved proofs, typographical corrections, and an enlarged bibliography. The list of open questions has been updated; comments and references have been added about those previously open problems that have been solved after the first edition appeared.

Neal Koblitz was a student of Nicholas M. Katz, under whom he received his Ph.D. in mathematics at Princeton in 1974. He spent the year 1974 -75 and the spring semester 1978 in Moscow, where he did research in p -adic analysis and also translated Yu. I. Manin's "Course in Mathematical Logic" (GTM 53). He taught at Harvard from 1975 to 1979, and since 1979 has been at the University of Washington in Seattle. He has published papers in number theory, algebraic geometry, and p-adic analysis, and he is the author of "p-adic Analysis: A Short Course on Recent Work" (Cambridge University Press and GTM 97: "Introduction to Elliptic Curves and Modular Forms (Springer-Verlag).

Lectures: A. Auslander, R. Tolimeri: Nilpotent groups and abelian varieties.- M Cowling: Unitary and uniformly bounded representations of some simple Lie groups.- M. Duflo: Construction de representations unitaires d un groupe de Lie.- R. Howe: On a notion of rank for unitary representations of the classical groups.- V.S. Varadarajan: Eigenfunction expansions of semisimple Lie groups.- R. Zimmer: Ergodic theory, group representations and rigidity.- Seminars: A. Koranyi: Some applications of Gelfand pairs in classical analysis.

These notes are an expanded and updated version of a course of lectures which I gave at King's College London during the summer term 1979. The main topic is the Hermitian classgroup of orders, and in particular of group rings. Most of this work is published here for the first time. The primary motivation came from the connection with the Galois module structure of rings of algebraic integers. The principal aim was to lay the theoretical basis for attacking what may be called the "converse problem" of Galois module structure theory: to express the symplectic local and global root numbers and conductors as algebraic invariants. A previous edition of these notes was circulated privately among a few collaborators. Based on this, and following a partial solution of the problem by the author, Ph. Cassou-Nogues and M. Taylor succeeded in obtaining a complete solution. In a different direction J. Ritter published a paper, answering certain character theoretic questions raised in the earlier version. I myself disapprove of "secret circulation," but the pressure of other work led to a delay in publication; I hope this volume will make amends. One advantage of the delay is that the relevant recent work can be included. In a sense this is a companion volume to my recent Springer-Ergebnisse-Bericht, where the Hermitian theory was not dealt with. Our approach is via "Hom-groups," analogous to that followed in recent work on locally free classgroups.

The history of continued fractions is certainly one of the longest among those of mathematical concepts, since it begins with Euclid's algorithm for the great est common divisor at least three centuries B.C. As it is often the case and like Monsieur Jourdain in Moliere's "Ie bourgeois gentilhomme" (who was speak ing in prose though he did not know he was doing so), continued fractions were used for many centuries before their real discovery. The history of continued fractions and Pade approximants is also quite im portant, since they played a leading role in the development of some branches of mathematics. For example, they were the basis for the proof of the tran scendence of 11' in 1882, an open problem for more than two thousand years, and also for our modern spectral theory of operators. Actually they still are of great interest in many fields of pure and applied mathematics and in numerical analysis, where they provide computer approximations to special functions and are connected to some convergence acceleration methods. Con tinued fractions are also used in number theory, computer science, automata, electronics, etc ..."

This introduction to cryptography employs a programming-oriented approach to study the most important cryptographic schemes in current use and the main cryptanalytic attacks against them. Discussion of the theoretical aspects, emphasizing precise security definitions based on methodological tools such as complexity and randomness, and of the mathematical aspects, with emphasis on number-theoretic algorithms and their applications to cryptography and cryptanalysis, is integrated with the programming approach, thus providing implementations of the algorithms and schemes as well as examples of realistic size.

A distinctive feature of the author's approach is the use of Maple as a programming environment in which not just the cryptographic primitives but also the most important cryptographic schemes are implemented following the recommendations of standards bodies such as NIST, with many of the known cryptanalytic attacks implemented as well. The purpose of the Maple implementations is to let the reader experiment and learn, and for this reason the author includes numerous examples. The book discusses important recent subjects such as homomorphic encryption, identity-based cryptography and elliptic curve cryptography. The algorithms and schemes which are treated in detail and implemented in Maple include AES and modes of operation, CMAC, GCM/GMAC, SHA-256, HMAC, RSA, Rabin, Elgamal, Paillier, Cocks IBE, DSA and ECDSA. In addition, some recently introduced schemes enjoying strong security properties, such as RSA-OAEP, Rabin-SAEP, Cramer--Shoup, and PSS, are also discussed and implemented. On the cryptanalysis side, Maple implementations and examples are used to discuss many important algorithms, including birthday and man-in-the-middle attacks, integer factorization algorithms such as Pollard's rho and the quadratic sieve, and discrete log algorithms such as baby-step giant-step, Pollard's rho, Pohlig--Hellman and the index calculus method.

This textbook is suitable for advanced undergraduate and graduate students of computer science, engineering and mathematics, satisfying the requirements of various types of courses: a basic introductory course; a theoretically oriented course whose focus is on the precise definition of security concepts and on cryptographic schemes with reductionist security proofs; a practice-oriented course requiring little mathematical background and with an emphasis on applications; or a mathematically advanced course addressed to students with a stronger mathematical background. The main prerequisite is a basic knowledge of linear algebra and elementary calculus, and while some knowledge of probability and abstract algebra would be helpful, it is not essential because the book includes the necessary background from these subjects and, furthermore, explores the number-theoretic material in detail. The book is also a comprehensive reference and is suitable for self-study by practitioners and programmers."

The applications of ergodic theory to metric number theory are well known; part of the latter theory turns out to be essentially a special case of general ergodic theorems. In the present book other applications of ergodic concepts are presented. Constructing "flows" of integral points on certain algebraic manifolds given by systems of integral polynomials, we are able to prove individual ergodic theorems and mixing theorems in certain cases. These theorems permit asymptotic calculations of the distributions of integral points on such manifolds, and we arrive at results inaccessible up to now by the usual methods of analytic number theory. Typical in this respect is the theorem concerning the asymptotic distribution and ergodic behavior of the set of integral points on the sphere X2+ y2+z2=m for increasing m. It is not known up until now how to obtain the simple and geometrically obvious regularity of the distribution of integral points on the sphere other than by ergodic methods. Systems of diophantine equations are studied with our method, and flows of integral points introduced for this purpose turn out to be closely connected with the behavior of ideal classes of the corresponding algebraic fields, and this behavior shows certain ergodic regularity in sequences of algebraic fields. However, in this book we examine in this respect only quadratic fields in sufficient detail, studying fields of higher degrees only in chapter VII.

Computations with Markov Chains presents the edited and reviewed proceedings of the Second International Workshop on the Numerical Solution of Markov Chains, held January 16--18, 1995, in Raleigh, North Carolina. New developments of particular interest include recent work on stability and conditioning, Krylov subspace-based methods for transient solutions, quadratic convergent procedures for matrix geometric problems, further analysis of the GTH algorithm, the arrival of stochastic automata networks at the forefront of modelling stratagems, and more. An authoritative overview of the field for applied probabilists, numerical analysts and systems modelers, including computer scientists and engineers.

Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies incommunication networks. "Rainbow Connections of Graphs" covers this new and emerging topicin graph theory and brings together a majority of the results that deal with the concept of rainbow connections, first introduced by Chartrand et al. in 2006.

The authors begin with an introduction to rainbow connectedness, rainbow coloring, and rainbow connection number. The work is organized into the followingcategories, computation of the exact valuesof the rainbow connection numbers for some special graphs, algorithms and complexity analysis, upper bounds in terms of other graph parameters, rainbow connection for dense and sparse graphs, for some graph classes andgraph products, rainbow k-connectivity and k-rainbow index, and, rainbow vertex-connection number.
"Rainbow Connections of Graphs" appeals to researchers and graduate students in the field of graph theory. Conjectures, open problems and questions are given throughout the text with the hope for motivating young graph theorists and graduate students to do further study in this subject.

"

'Et moi, ..., si j'avait su comment en revcnrr, One service mathematics has rendered the je n'y serais point aile.' human race. It has put common sense back. Jules Verne where it belongs, on the topmost shelf next to the dusty canister labelled 'discarded non The series is divergent; therefore we may be sense'. able to do something with it. Eric T. Bell O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and non linearities abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sciences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One service topology has rendered mathematical physics .. .'; 'One service logic has rendered com puter science .. .'; 'One service category theory has rendered mathematics .. .'. All arguably true. And all statements obtainable this way form part of the raison d'etre of this series."

A beautiful and relatively elementary account of a part of mathematics where three main fields - algebra, analysis and geometry - meet. The book provides a broad view of these subjects at the level of calculus, without being a calculus book. Its roots are in arithmetic and geometry, the two opposite poles of mathematics, and the source of historic conceptual conflict. The resolution of this conflict, and its role in the development of mathematics, is one of the main stories in the book. Stillwell has chosen an array of exciting and worthwhile topics and elegantly combines mathematical history with mathematics. He covers the main ideas of Euclid, but with 2000 years of extra insights attached. Presupposing only high school algebra, it can be read by any well prepared student entering university. Moreover, this book will be popular with graduate students and researchers in mathematics due to its attractive and unusual treatment of fundamental topics. A set of well-written exercises at the end of each section allows new ideas to be instantly tested and reinforced.

This text originated as a lecture delivered November 20, 1984, at Queen's University, in the undergraduate colloquim series established to honor Professors A. J. Coleman and H. W. Ellis and to acknow ledge their long lasting interest in the quality of teaching under graduate students. In another colloquim lecture, my colleague Morris Orzech, who had consulted the latest edition of the Guilllless Book oj Records, remainded me very gently that the most "innumerate" people of the world are of a certain tribe in Mato Grosso, Brazil. They do not even have a word to express the number "two" or the concept of plurality. "Yes Morris, I'm from Brazil, but my book will contain numbers different from 'one.' " He added that the most boring 800-page book is by two Japanese mathematicians (whom I'll not name), and consists of about 16 million digits of the number 11. "I assure you Morris, that in spite of the beauty of the apparent randomness of the decimal digits of 11, I'll be sure that my text will include also some words." Acknowledgment. The manuscript of this book was prepared on the word processor by Linda Nuttall. I wish to express my appreciation for the great care, speed, and competence of her work."

Cryptography is a key technology in electronic security systems. Modern cryptograpic techniques have many uses, such as to digitally sign documents, for access control, to implement electronic money, and for copyright protection. Because of these important uses it is necessary that users be able to estimate the efficiency and security of cryptographic techniques. It is not sufficient for them to know only how the techniques work. This book is written for readers who want to learn about mod- ern cryptographic algorithms and their mathematical foundation but who do not have the necessary mathematical background. It is my goal to explain the basic techniques of modern cryptography, including the necessary mathematical results from linear algebra, algebra, number theory, and probability theory. I assume only basic mathematical knowledge. The book is based on courses in cryptography that I have been teaching at the Technical University, Darmstadt, since 1996. I thank all students who attended the courses and who read the manuscript carefully for their interest and support. In particular, I would like to thank Harald Baier, Gabi Barking, Manuel Breuning, Sa- fuat Hamdy, Birgit Henhapl, Michael Jacobson (who also corrected my English), Andreas Kottig, Markus Maurer, Andreas Meyer, Stefan v vi Preface Neis, Sachar Paulus, Thomas Pfahler, Marita Skrobic, Edlyn Thske, Patrick Theobald, and Ralf-Philipp Weinmann. I also thank the staff at Springer-Verlag, in particular Martin Peters, Agnes Herrmann, Claudia Kehl, Ina Lindemann, and Thrry Kornak, for their support in the preparation of this book.

From its birth (in Babylon?) till 1936 the theory of quadratic forms dealt almost exclusively with forms over the real field, the complex field or the ring of integers. Only as late as 1937 were the foundations of a theory over an arbitrary field laid. This was in a famous paper by Ernst Witt. Still too early, apparently, because it took another 25 years for the ideas of Witt to be pursued, notably by Albrecht Pfister, and expanded into a full branch of algebra. Around 1960 the development of algebraic topology and algebraic K-theory led to the study of quadratic forms over commutative rings and hermitian forms over rings with involutions. Not surprisingly, in this more general setting, algebraic K-theory plays the role that linear algebra plays in the case of fields. This book exposes the theory of quadratic and hermitian forms over rings in a very general setting. It avoids, as far as possible, any restriction on the characteristic and takes full advantage of the functorial aspects of the theory. The advantage of doing so is not only aesthetical: on the one hand, some classical proofs gain in simplicity and transparency, the most notable examples being the results on low-dimensional spinor groups; on the other hand new results are obtained, which went unnoticed even for fields, as in the case of involutions on 16-dimensional central simple algebras. The first chapter gives an introduction to the basic definitions and properties of hermitian forms which are used throughout the book.