This book contains 50 papers from among the 95 papers presented at the Seventh International Conference on Fibonacci Numbers and Their Applications which was held at the Institut Fiir Mathematik, Technische Universitiit Graz, Steyrergasse 30, A-SOlO Graz, Austria, from July 15 to July 19, 1996. 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 six predecessors, will be useful to research workers and graduate students interested in the Fibonacci numbers and their applications. September 1, 1997 The Editors Gerald E. Bergum South Dakota State University Brookings, South Dakota, U. S. A. Alwyn F. Horadam University of New England Armidale, N. S. W. , Australia Andreas N. Philippou House of Representatives Nicosia, Cyprus xxvii THE ORGANIZING COMMITTEES LOCAL COMMITTEE INTERNATIONAL COMMITTEE Tichy, Robert, Chairman Horadam, A. F. (Australia), Co-Chair Prodinger, Helmut, Co-Chairman Philippou, A. N. (Cyprus), Co-Chair Grabner, Peter Bergurt:t, G. E. (U. S. A. ) Kirschenhofer, Peter Filipponi, P. (Italy) Harborth, H. (Germany) Horibe, Y. (Japan) Johnson, M. (U. S. A. ) Kiss, P. (Hungary) Phillips, G. M. (Scotland) Turner, J. (New Zealand) Waddill, M. E. (U. S. A. ) xxix LIST OF CONTRIBUTORS TO THE CONFERENCE *ADELBERG, ARNOLD, "Higher Order Bernoulli Polynomials and Newton Polygons. " AMMANN, ANDRE, "Associated Fibonacci Sequences. " *ANDERSON, PETER G. , "The Fibonacci Shuffle Tree.

Effective Polynomial Computation is an introduction to the algorithms of computer algebra. It discusses the basic algorithms for manipulating polynomials including factoring polynomials. These algorithms are discussed from both a theoretical and practical perspective. Those cases where theoretically optimal algorithms are inappropriate are discussed and the practical alternatives are explained. Effective Polynomial Computation provides much of the mathematical motivation of the algorithms discussed to help the reader appreciate the mathematical mechanisms underlying the algorithms, and so that the algorithms will not appear to be constructed out of whole cloth. Preparatory to the discussion of algorithms for polynomials, the first third of this book discusses related issues in elementary number theory. These results are either used in later algorithms (e.g. the discussion of lattices and Diophantine approximation), or analogs of the number theoretic algorithms are used for polynomial problems (e.g. Euclidean algorithm and p-adic numbers). Among the unique features of Effective Polynomial Computation is the detailed material on greatest common divisor and factoring algorithms for sparse multivariate polynomials. In addition, both deterministic and probabilistic algorithms for irreducibility testing of polynomials are discussed.

The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research. We obtain several lower bounds, exponential in terms of logp, on the de grees and orders of * polynomials; * algebraic functions; * Boolean functions; * linear recurring sequences; coinciding with values of the discrete logarithm modulo a prime p at suf ficiently many points (the number of points can be as small as pI/He). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the right most bit of the discrete logarithm and defines whether the argument is a quadratic residue. We also obtain non-trivial upper bounds on the de gree, sensitivity and Fourier coefficients of Boolean functions on bits of x deciding whether x is a quadratic residue. These results are used to obtain lower bounds on the parallel arithmetic and Boolean complexity of computing the discrete logarithm. For example, we prove that any unbounded fan-in Boolean circuit. of sublogarithmic depth computing the discrete logarithm modulo p must be of superpolynomial size.

During the last twenty-five years quite remarkable relations between nonas sociative algebra and differential geometry have been discovered in our work. Such exotic structures of algebra as quasigroups and loops were obtained from purely geometric structures such as affinely connected spaces. The notion ofodule was introduced as a fundamental algebraic invariant of differential geometry. For any space with an affine connection loopuscular, odular and geoodular structures (partial smooth algebras of a special kind) were introduced and studied. As it happened, the natural geoodular structure of an affinely connected space al lows us to reconstruct this space in a unique way. Moreover, any smooth ab stractly given geoodular structure generates in a unique manner an affinely con nected space with the natural geoodular structure isomorphic to the initial one. The above said means that any affinely connected (in particular, Riemannian) space can be treated as a purely algebraic structure equipped with smoothness. Numerous habitual geometric properties may be expressed in the language of geoodular structures by means of algebraic identities, etc.. Our treatment has led us to the purely algebraic concept of affinely connected (in particular, Riemannian) spaces; for example, one can consider a discrete, or, even, finite space with affine connection (in the form ofgeoodular structure) which can be used in the old problem of discrete space-time in relativity, essential for the quantum space-time theory."

For many years, Serge Lang has given talks on selected items in mathematics which could be extracted at a level understandable by those who have had calculus. Written in a conversational tone, Lang now presents a collection of those talks as a book covering such topics as: prime numbers, the abc conjecture, approximation theorems of analysis, Bruhat-Tits spaces, and harmonic and symmetric polynomials. Each talk is written in a lively and informal style meant to engage any reader looking for further insight into mathematics.

Serge Lang is one of the top mathematicians of our time. Being an excellent writer, Lang has made innumerable contributions in diverse fields in mathematics and they are invaluable. He was honored with the Cole Prize by the American Mathematical Society as well as with the Prix Carriere by the French Academy of Sciences. In these four volumes 83 of his research papers are collected. They range over a variety of topics and will be of interest to many readers.

This easy-to-read 2010 book demonstrates how a simple geometric idea reveals fascinating connections and results in number theory, the mathematics of polyhedra, combinatorial geometry, and group theory. Using a systematic paper-folding procedure it is possible to construct a regular polygon with any number of sides. This remarkable algorithm has led to interesting proofs of certain results in number theory, has been used to answer combinatorial questions involving partitions of space, and has enabled the authors to obtain the formula for the volume of a regular tetrahedron in around three steps, using nothing more complicated than basic arithmetic and the most elementary plane geometry. All of these ideas, and more, reveal the beauty of mathematics and the interconnectedness of its various branches. Detailed instructions, including clear illustrations, enable the reader to gain hands-on experience constructing these models and to discover for themselves the patterns and relationships they unearth.

Spencer Bloch's 1979 Duke lectures, a milestone in modern mathematics, have been out of print almost since their first publication in 1980, yet they have remained influential and are still the best place to learn the guiding philosophy of algebraic cycles and motives. This edition, now professionally typeset, has a new preface by the author giving his perspective on developments in the field over the past 30 years. The theory of algebraic cycles encompasses such central problems in mathematics as the Hodge conjecture and the Bloch-Kato conjecture on special values of zeta functions. The book begins with Mumford's example showing that the Chow group of zero-cycles on an algebraic variety can be infinite-dimensional, and explains how Hodge theory and algebraic K-theory give new insights into this and other phenomena.

It would be difficult to overestimate the influence and importance of modular forms, modular curves, and modular abelian varieties in the development of num- ber theory and arithmetic geometry during the last fifty years. These subjects lie at the heart of many past achievements and future challenges. For example, the theory of complex multiplication, the classification of rational torsion on el- liptic curves, the proof of Fermat's Last Theorem, and many results towards the Birch and Swinnerton-Dyer conjecture all make crucial use of modular forms and modular curves. A conference was held from July 15 to 18, 2002, at the Centre de Recerca Matematica (Bellaterra, Barcelona) under the title "Modular Curves and Abelian Varieties". Our conference presented some of the latest achievements in the theory to a diverse audience that included both specialists and young researchers. We emphasized especially the conjectural generalization of the Shimura-Taniyama conjecture to elliptic curves over number fields other than the field of rational numbers (elliptic Q-curves) and abelian varieties of dimension larger than one (abelian varieties of GL2-type).

From the reviews: "This is a great book, which will hopefully become a classic in the subject of differential Galois theory. ...] the specialist, as well as the novice, have long been missing an introductory book covering also specific and advanced research topics. This gap is filled by the volume under review, and more than satisfactorily." Mathematical Reviews

Ernst Witt, 1911-1991, was one of the most ingenious mathematicians of this century and has decisively shaped the development of various mathematical fields like algebra, number theory, group theory, combinatorics and Lie theory. This volume offers a complete collection of Witt's research papers; it also contains never before published articles, facsimiles and photos. Commentary by other authors provide an excellent survey on the further development of these mathematical fields.

This book is, on the one hand, a pedagogical introduction to the formalism of slopes, of semi-stability and of related concepts in the simplest possible context. It is therefore accessible to any graduate student with a basic knowledge in algebraic geometry and algebraic groups. On the other hand, the book also provides a thorough introduction to the basics of period domains, as they appear in the geometric approach to local Langlands correspondences and in the recent conjectural p-adic local Langlands program. The authors provide numerous worked examples and establish many connections to topics in the general area of algebraic groups over finite and local fields. In addition, the end of each section includes remarks on open questions, historical context and references to the literature.

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

This self-contained text presents quantum mechanics from the point of view of some computational examples with a mixture of mathematical clarity often not found in texts offering only a purely physical point of view. Emphasis is placed on the systematic application of the Nikiforov-- Uvarov theory of generalized hypergeometric differential equations to solve the Schr"dinger equation and to obtain the quantization of energies from a single unified point of view.

We dedicate this volume to Professor Parimala on the occasion of her 60th birthday. It contains a variety of papers related to the themes of her research. Parimala's rst striking result was a counterexample to a quadratic analogue of Serre's conjecture (Bulletin of the American Mathematical Society, 1976). Her in uence has cont- ued through her tenure at the Tata Institute of Fundamental Research in Mumbai (1976-2006),and now her time at Emory University in Atlanta (2005-present). A conference was held from 30 December 2008 to 4 January 2009, at the U- versity of Hyderabad, India, to celebrate Parimala's 60th birthday (see the conf- ence's Web site at http://mathstat.uohyd.ernet.in/conf/quadforms2008). The or- nizing committee consisted of J.-L. Colliot-Thel ' en ' e, Skip Garibaldi, R. Sujatha, and V. Suresh. The present volume is an outcome of this event. We would like to thank all the participants of the conference, the authors who have contributed to this volume, and the referees who carefully examined the s- mitted papers. We would also like to thank Springer-Verlag for readily accepting to publish the volume. In addition, the other three editors of the volume would like to place on record their deep appreciation of Skip Garibaldi's untiring efforts toward the nal publication.

This English translation of Karatsuba's Basic Analytic Number Theory follows closely the second Russian edition, published in Moscow in 1983. For the English edition, the author has considerably rewritten Chapter I, and has corrected various typographical and other minor errors throughout the the text. August, 1991 Melvyn B. Nathanson Introduction to the English Edition It gives me great pleasure that Springer-Verlag is publishing an English trans lation of my book. In the Soviet Union, the primary purpose of this monograph was to introduce mathematicians to the basic results and methods of analytic number theory, but the book has also been increasingly used as a textbook by graduate students in many different fields of mathematics. I hope that the English edition will be used in the same ways. I express my deep gratitude to Professor Melvyn B. Nathanson for his excellent translation and for much assistance in correcting errors in the original text. A.A. Karatsuba Introduction to the Second Russian Edition Number theory is the study of the properties of the integers. Analytic number theory is that part of number theory in which, besides purely number theoretic arguments, the methods of mathematical analysis play an essential role."

The articles in this volume are an outgrowth of an International Confer- ence in Intersection Theory that took place in Bologna, Italy (December 1997). In a somewhat unorthodox format aimed at both the mathematical community as well as summer school students, talks were research-oriented as well as partly expository. There were four series of expository talks by the following people: M. Brion, University of Grenoble, on Equivariant Chow groups and applications; H. Flenner, University of Bochum, on Joins and intersections; E. M. Friedlander, Northwestern University, on Intersection products for spaces of algebraic cycles; R. Laterveer, University of Strasbourg, on Bigraded Chow (co)homology. Four introductory papers cover the following topics and bring the reader to the forefront of research: 1) the excess intersection algorithm of Stuckrad and Vogel, combined with the deformation to the normal cone, together with many of its geo- metric applications; 2) new and very important homotopy theory techniques that are now used in intersection theory; 3) the Bloch-Beilinson filtration and the theory of motives; 4) algebraic stacks, the modern language of moduli theory. Other research articles concern such active fields as stable maps and Gromov-Witten invariants, deformation theory of complex varieties, and others. Organizers of the conference were Rudiger Achilles, Mirella Manaresi, and Angelo Vistoli, all from the University of Bologna; the scientific com- mittee consisted of Geir Ellingsrud, University of Oslo, William Fulton, University of Michigan at Ann Arbor, and Angelo Vistoli. The conference was financed by the European Union (contract no.

Award-winning monograph of the Ferran Sunyer i Balaguer Prize 2001. Subgroup growth studies the distribution of subgroups of finite index in a group as a function of the index. In the last two decades this topic has developed into one of the most active areas of research in infinite group theory; this book is a systematic and comprehensive account of the substantial theory which has emerged. As well as determining the range of possible 'growth types', for finitely generated groups in general and for groups in particular classes such as linear groups, a main focus of the book is on the tight connection between the subgroup growth of a group and its algebraic structure. A wide range of mathematical disciplines play a significant role in this work: as well as various aspects of infinite group theory, these include finite simple groups and permutation groups, profinite groups, arithmetic groups and Strong Approximation, algebraic and analytic number theory, probability, and p-adic model theory. Relevant aspects of such topics are explained in self-contained 'windows'.

A relaxed and informal presentation conveying the joy of mathematical discovery and insight. Frequent questions lead readers to see mathematics as an accessible world of thought, where understanding can turn opaque formulae into beautiful and meaningful ideas. The text presents eight topics that illustrate the unity of mathematical thought as well as the diversity of mathematical ideas. Drawn from both "pure" and "applied" mathematics, they include: spirals in nature and in mathematics; the modern topic of fractals and the ancient topic of Fibonacci numbers; Pascals Triangle and paper folding; modular arithmetic and the arithmetic of the infinite. The final chapter presents some ideas about how mathematics should be done, and hence, how it should be taught. Presenting many recent discoveries that lead to interesting open questions, the book can serve as the main text in courses dealing with contemporary mathematical topics or as enrichment for other courses. It can also be read with pleasure by anyone interested in the intellectually intriguing aspects of mathematics.

This is a self-contained 2010 account of the state of the art in classical complex multiplication that includes recent results on rings of integers and applications to cryptography using elliptic curves. The author is exhaustive in his treatment, giving a thorough development of the theory of elliptic functions, modular functions and quadratic number fields and providing a concise summary of the results from class field theory. The main results are accompanied by numerical examples, equipping any reader with all the tools and formulas they need. Topics covered include: the construction of class fields over quadratic imaginary number fields by singular values of the modular invariant j and Weber's tau-function; explicit construction of rings of integers in ray class fields and Galois module structure; the construction of cryptographically relevant elliptic curves over finite fields; proof of Berwick's congruences using division values of the Weierstrass p-function; relations between elliptic units and class numbers.

Volume III is the third part of the 3-volume book Mathematics of Harmony as a New Interdisciplinary Direction and 'Golden' Paradigm of Modern Science. 'Mathematics of Harmony' rises in its origin to the 'harmonic ideas' of Pythagoras, Plato and Euclid, this 3-volume book aims to promote more deep understanding of ancient conception of the 'Universe Harmony,' the main conception of ancient Greek science, and implementation of this conception to modern science and education.This 3-volume book is a result of the authors' research in the field of Fibonacci numbers and the Golden Section and their applications. It provides a broad introduction to the fascinating and beautiful subject of the 'Mathematics of Harmony,' a new interdisciplinary direction of modern science. This direction has many unexpected applications in contemporary mathematics (a new approach to a history of mathematics, the generalized Fibonacci numbers and the generalized golden proportions, the generalized Binet's formulas), theoretical physics (new hyperbolic models of Nature) and computer science (algorithmic measurement theory, number systems with irrational bases, Fibonacci computers, ternary mirror-symmetrical arithmetic).The books are intended for a wide audience including mathematics teachers of high schools, students of colleges and universities and scientists in the field of mathematics, theoretical physics and computer science. The book may be used as an advanced textbook by graduate students and even ambitious undergraduates in mathematics and computer science.

Volume II is the second part of the 3-volume book Mathematics of Harmony as a New Interdisciplinary Direction and 'Golden' Paradigm of Modern Science. 'Mathematics of Harmony' rises in its origin to the 'harmonic ideas' of Pythagoras, Plato and Euclid, this 3-volume book aims to promote more deep understanding of ancient conception of the 'Universe Harmony,' the main conception of ancient Greek science, and implementation of this conception to modern science and education.This 3-volume book is a result of the authors' research in the field of Fibonacci numbers and the Golden Section and their applications. It provides a broad introduction to the fascinating and beautiful subject of the 'Mathematics of Harmony,' a new interdisciplinary direction of modern science. This direction has many unexpected applications in contemporary mathematics (a new approach to a history of mathematics, the generalized Fibonacci numbers and the generalized golden proportions, the generalized Binet's formulas), theoretical physics (new hyperbolic models of Nature) and computer science (algorithmic measurement theory, number systems with irrational bases, Fibonacci computers, ternary mirror-symmetrical arithmetic).The books are intended for a wide audience including mathematics teachers of high schools, students of colleges and universities and scientists in the field of mathematics, theoretical physics and computer science. The book may be used as an advanced textbook by graduate students and even ambitious undergraduates in mathematics and computer science.

Sphere Packings is one of the most attractive and challenging subjects in mathematics. Almost 4 centuries ago, Kepler studied the densities of sphere packings and made his famous conjecture. In the course of centuries, many exciting results have been obtained, ingenious methods created, related challenging problems proposed, and many surprising connections with othe subjects found. Thus, though some of its original problems are still open, sphere packings has been developed into an important discipline. This book tries to give a full account of this fascinating subject, especially its local aspects, discrete aspects and its proof methods.

The book introduces new techniques that imply rigorous lower bounds on the com plexity of some number-theoretic and cryptographic problems. It also establishes certain attractive pseudorandom properties of various cryptographic primitives. These methods and techniques are based on bounds of character sums and num bers of solutions of some polynomial equations over finite fields and residue rings. Other number theoretic techniques such as sieve methods and lattice reduction algorithms are used as well. The book also contains a number of open problems and proposals for further research. The emphasis is on obtaining unconditional rigorously proved statements. The bright side of this approach is that the results do not depend on any assumptions or conjectures. On the downside, the results are much weaker than those which are widely believed to be true. We obtain several lower bounds, exponential in terms of logp, on the degrees and orders of o polynomials; o algebraic functions; o Boolean functions; o linear recurrence sequences; coinciding with values of the discrete logarithm modulo a prime p at sufficiently many points (the number of points can be as small as pI/2+O: ). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the rightmost bit of the discrete logarithm and defines whether the argument is a quadratic residue."