zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Recurrence sequences. (English) Zbl 1033.11006
Mathematical Surveys and Monographs 104. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3387-1/hbk). xiii, 318 p. $ 79.00 (2003).

This monograph gives a very broad and up to date encyclopaedic overview of both the theory and applications of recurrence sequences. The authors consider mainly sequences over the rationals and over the ring of residue classes modulo an integer. The emphasis is on linear recurrence sequences, but also much attention has been paid to other types of recurrence sequences, for instance sequences generated by finite automata. The book contains an enormous amount of facts and results of which clearly not all proofs have been included. The authors have followed the policy to give proofs or sketches of proofs of the prototypical results, providing convenient references for the proofs that have not been included. At the end of the book, there is a bibliography with 1382 items.

We give a short overview of the topics that have been treated: techniques from p-adic analysis and Diophantine approximation; zeros and growth properties of linear recurrence sequences over the integers; periodicity properties of recurrence sequences over residue class rings and Artin’s conjecture; operations on power series and linear recurrence sequences; character sum estimates and bounds on the number of zeros of recurrence sequences over residue class rings; arithmetic properies of recurrence sequences (e.g., occurrence of prime divisors or powers in the terms of a recurrence sequence); distribution of recurrence sequences in finite fields and residue class rings; uniform distribution properties of real recurrence sequences; elliptic divisibility sequences; sequences arising in graph theory and dynamics; connections with algebraic number theory (e.g., the construction of normal bases and results on Gaussian periods); pseudo-random number generators; connections to computer science (e.g., sequences generated by finite automata), coding theory and cryptography.


MSC:
11B37Recurrences
11-02Research monographs (number theory)
11B39Fibonacci and Lucas numbers, etc.
11G05Elliptic curves over global fields
11T23Exponential sums
33B10Exponential and trigonometric functions
11J71Distribution modulo one
11K45Pseudo-random numbers; Monte Carlo methods
11B85Automata sequences
37B15Cellular automata
94A60Cryptography