Recurrence sequences are of great intrinsic interest and have been a central part of number theory for many years. Moreover, these sequences appear almost everywhere in mathematics and computer science. This book surveys the modern theory of linear recurrence sequences and their generalizations. Particular emphasis is placed on the dramatic impact that sophisticated methods from Diophantine analysis and transcendence theory have had on the subject. Related work on bilinear recurrences and an emerging connection between recurrences and graph theory are covered in this book. Applications and links to other areas of mathematics are described, including combinatorics, dynamical systems and cryptography, and computer science. The book is suitable for researchers interested in number theory, combinatorics, and graph theory.
Reihe
Sprache
Verlagsort
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
Illustrationen
Gewicht
ISBN-13
978-0-8218-3387-2 (9780821833872)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Definitions and techniques Zeros, multiplicity and growth Periodicity Operations on power series and linear recurrence sequences Character sums and solutions of congruences Arithmetic structure of recurrence sequences Distribution in finite fields and residue rings Distribution modulo 1 and matrix exponential functions Applications to other sequences Elliptic divisibility sequences Sequences arising in graph theory and dynamics Finite fields and algebraic number fields Pseudo-random number generators Computer science and coding theory Appendix: Sequences from the on-line encyclopedia Bibliography Index.
