Atnaujinkite slapukų nuostatas

Recurrent Sequences: Key Results, Applications, and Problems 2020 ed. [Kietas viršelis]

  • Formatas: Hardback, 402 pages, aukštis x plotis: 235x155 mm, weight: 787 g, 65 Illustrations, color; 2 Illustrations, black and white; XIV, 402 p. 67 illus., 65 illus. in color., 1 Hardback
  • Serija: Problem Books in Mathematics
  • Išleidimo metai: 24-Sep-2020
  • Leidėjas: Springer Nature Switzerland AG
  • ISBN-10: 303051501X
  • ISBN-13: 9783030515010
Kitos knygos pagal šią temą:
  • Formatas: Hardback, 402 pages, aukštis x plotis: 235x155 mm, weight: 787 g, 65 Illustrations, color; 2 Illustrations, black and white; XIV, 402 p. 67 illus., 65 illus. in color., 1 Hardback
  • Serija: Problem Books in Mathematics
  • Išleidimo metai: 24-Sep-2020
  • Leidėjas: Springer Nature Switzerland AG
  • ISBN-10: 303051501X
  • ISBN-13: 9783030515010
Kitos knygos pagal šią temą:

This self-contained text presents state-of-the-art results on recurrent sequences and their applications in algebra, number theory, geometry of the complex plane and discrete mathematics. It is designed to appeal to a wide readership, ranging from scholars and academics, to undergraduate students, or advanced high school and college students training for competitions. The content of the book is very recent, and focuses on areas where significant research is currently taking place. Among the new approaches promoted in this book, the authors highlight the visualization of some recurrences in the complex plane, the concurrent use of algebraic, arithmetic, and trigonometric perspectives on classical number sequences, and links to many applications. It contains techniques which are fundamental in other areas of math and encourages further research on the topic. The introductory chapters only require good understanding of college algebra, complex numbers, analysis and basic combinatorics. For Chapters 3, 4 and 6 the prerequisites include number theory, linear algebra and complex analysis.  

The first part of the book presents key theoretical elements required for a good understanding of the topic. The exposition moves on to to fundamental results and key examples of recurrences and their properties. The geometry of linear recurrences in the complex plane is presented in detail through numerous diagrams, which lead to often unexpected connections to combinatorics, number theory, integer sequences, and random number generation. The second part of the book presents a collection of 123 problems with full solutions, illustrating the wide range of topics where recurrent sequences can be found.  This material is ideal for consolidating the theoretical knowledge and for preparing students for Olympiads.

Recenzijos

What a delightful, current, compactly written book. This book could serve as a stand-alone text i) for an advanced, undergraduate, second-term, Discrete-Mathematics course, ii) for a first, or preferably, second-year stand-alone text for graduate students specializing in dynamical systems, combinatorics, or discrete systems, or iii) for researchers in these areas. The book presents close to 200 references most of which are post-2000. Anyone wanting to read further will find what they need here. (Russel Jay Hendel, MAA Reviews, April 10, 2022)

This book teaches numerous fundamental facts and techniques which are central in mathematics. It is both a research monograph and a delightful problem book, which I feel will spark the interest of a wide audience, from mathematics Olympiad competitors and their coaches to undergraduate or postgraduate students, or professional mathematicians with an interest in recurrences and their multiple applications. (Michael Th. Rassias, EMS Magazine, Issue 119, March, 2021)

1 Introduction to Recurrence Relations 1(18)
1.1 Recursive Sequences of Order k
2(1)
1.2 Recurrent Sequences Defined by a Sequence of Functions
3(1)
1.3 Systems of Recurrent Sequences
3(1)
1.4 Existence and Uniqueness of the Solution
4(2)
1.5 Recurrent Sequences Arising in Practical Problems
6(13)
1.5.1 Applications in Mathematical Modeling
6(2)
1.5.2 Algebra
8(1)
1.5.3 Combinatorics
9(2)
1.5.4 Geometry
11(1)
1.5.5 Analysis
12(2)
1.5.6 Iterative Numerical Methods
14(5)
2 Basic Recurrent Sequences 19(66)
2.1 First-Order Linear Recurrent Sequences
19(7)
2.2 Second-Order Linear Recurrent Sequences
26(41)
2.2.1 Homogeneous Recurrent Sequences
26(8)
2.2.2 Nonhomogeneous Recurrent Sequences
34(4)
2.2.3 Fibonacci, Lucas, Pell, and Pell-Lucas Numbers
38(10)
2.2.4 The Polynomials Un(x, y) and Vn(x, y)
48(10)
2.2.5 Properties of Fibonacci, Lucas, Pell, and Lucas-Pell Numbers
58(7)
2.2.6 Zeckendorf's Theorem
65(2)
2.3 Homographic Recurrences
67(18)
2.3.1 Key Definitions
67(1)
2.3.2 Homographic Recurrent Sequences
68(4)
2.3.3 Representation Theorems for Homographic Sequences
72(2)
2.3.4 Convergence and Periodicity
74(3)
2.3.5 Homographic Recurrences with Variable Coefficients
77(8)
3 Arithmetic and Trigonometric Properties of Some Classical Recurrent Sequences 85(20)
3.1 Arithmetic Properties of Fibonacci and Lucas Sequences
85(5)
3.2 Arithmetic Properties of Pell and Pell-Lucas Numbers
90(4)
3.3 Trigonometric Expressions for the Fibonacci, Lucas, Pell, and Pell-Lucas Numbers
94(3)
3.4 Identities Involving the Resultant of Polynomials
97(8)
4 Generating Functions 105(30)
4.1 Ordinary Generating Functions
105(14)
4.1.1 Basic Operations and Examples
105(8)
4.1.2 Generating Functions of Classical Polynomials
113(2)
4.1.3 Generating Functions of Classical Sequences
115(1)
4.1.4 The Explicit Formula for the Fibonacci, Lucas, Pell, and Pell-Lucas Polynomials
116(2)
4.1.5 From Generating Functions to Properties of the Sequence
118(1)
4.2 Exponential Generating Functions
119(8)
4.2.1 Basic Operations and Examples
120(4)
4.2.2 Generating Functions for Polynomials Un and Vn
124(1)
4.2.3 Generating Functions of Classical Polynomials
125(2)
4.2.4 Generating Functions of Classical Sequences
127(1)
4.3 The Cauchy Integral Formula
127(8)
4.3.1 A Useful Version of the Cauchy Integral Formula
128(2)
4.3.2 The Integral Representation of Classical Sequences
130(5)
5 More on Second-Order Linear Recurrent Sequences 135(60)
5.1 Preliminary results
135(5)
5.1.1 General Sequence Term
136(1)
5.1.2 Ratios of Horadam Sequences
137(1)
5.1.3 Particular Horadam Orbits
138(2)
5.2 Periodicity of Complex Horadam Sequences
140(7)
5.2.1 Geometric Progressions of Complex Argument
141(2)
5.2.2 Nondegenerate Case
143(2)
5.2.3 Degenerate Case
145(2)
5.3 The Geometry of Periodic Horadam Orbits
147(10)
5.3.1 Regular Star Polygons
148(1)
5.3.2 Bipartite Graphs
148(2)
5.3.3 Multipartite Graphs
150(3)
5.3.4 Geometric Bounds of Periodic Orbits
153(1)
5.3.5 "Masked" Periodicity
154(3)
5.4 The Enumeration of Periodic Horadam Patterns
157(9)
5.4.1 The Number of Horadam Patterns of Fixed Length
158(1)
5.4.2 A First Formula
159(3)
5.4.3 A Second Formula
162(2)
5.4.4 Computational Complexity
164(1)
5.4.5 Asymptotic Bounds
165(1)
5.5 Non-periodic Horadam Orbits
166(2)
5.5.1 Degenerate Orbits
167(1)
5.6 An Atlas of Horadam Patterns
168(19)
5.6.1 Stable Orbits: r1 = r2 = 1
168(5)
5.6.2 Quasi-Convergent Orbits for 0 < or = to r1 < r2 = 1
173(2)
5.6.3 Convergent Orbits for 0 < or = to r1 < or = to r2 < 1
175(7)
5.6.4 Divergent Orbits for 1 < r2
182(5)
5.7 A Horadam-Based Pseudo-Random Number Generator
187(5)
5.7.1 Pseudo-Random Generators and Horadam Sequences
187(1)
5.7.2 Complex Arguments of 2D Dense Horadam Orbits
188(2)
5.7.3 Monte Carlo Simulations for Mixed Arguments
190(2)
5.8 Nonhomogeneous Horadam Sequences
192(3)
5.8.1 Constant Perturbation
192(1)
5.8.2 Periodic Perturbations
193(2)
6 Higher Order Linear Recurrent Sequences 195(68)
6.1 Linear Recurrent Sequences (LRS)
196(9)
6.1.1 Definition and General Term
196(1)
6.1.2 The Solution of a Linear Recurrence Equation
197(4)
6.1.3 The Space of Solutions for Linear Recurrence Equations
201(1)
6.1.4 Reduction of Order for LRS
202(3)
6.2 Systems of Recurrent Sequences
205(21)
6.2.1 Weighed Arithmetic Mean
206(1)
6.2.2 The Solution of a System of Linear Recurrence Relations
207(4)
6.2.3 Systems of Two Linear Recurrent Sequences
211(10)
6.2.4 Sequences Interpolating Geometric Inequalities
221(5)
6.3 The Periodicity of Complex LRS
226(11)
6.3.1 Distinct Roots
226(4)
6.3.2 Equal Roots
230(4)
6.3.3 Distinct Roots with Arbitrary Multiplicities
234(3)
6.4 The Geometry and Enumeration of Periodic Patterns
237(10)
6.4.1 Geometric Bounds of Periodic Orbits
237(2)
6.4.2 The Geometric Structure of Periodic Orbits
239(1)
6.4.3 "Masked" Periodicity
240(3)
6.4.4 The Enumeration of Periodic Orbits
243(1)
6.4.5 A First Formula for Hp (m; k)
243(4)
6.5 Orbits Generated by Roots of Unity
247(3)
6.6 Orbits of Complex General Order LRS
250(9)
6.6.1 Stable Orbits: r1 = r2 = ... = rm = 1
250(3)
6.6.2 Quasi-Convergent Orbits: 0 < r1 < r2 = r3 = 1
253(3)
6.6.3 Convergent Orbits: 0 < or = to r1 < or = to r2 < or = to ... < rm < 1
256(1)
6.6.4 Divergent Orbits: rm > 1
257(2)
6.7 Connection to Finite Differences
259(4)
6.7.1 Solving Difference Equations
260(1)
6.7.2 Finding the Difference Equation for a Sequence
261(2)
7 Recurrences in Olympiad Training 263(20)
7.1 First-Order Recurrent Sequences
263(3)
7.2 Second-Order Recurrent Sequences
266(3)
7.3 Classical Recurrent Sequences
269(3)
7.4 Higher Order Recurrence Relations
272(1)
7.5 Systems of Recurrence Relations
273(2)
7.6 Homographic Recurrent Sequences
275(1)
7.7 Complex Recurrent Sequences
276(2)
7.8 Recurrent Sequences in Combinatorics
278(2)
7.9 Miscellaneous
280(3)
8 Solutions to Proposed Problems 283(98)
8.1 First-Order Recurrent Sequences
283(13)
8.2 Second-Order Recurrent Sequences
296(17)
8.3 Classical Recurrent Sequences
313(17)
8.4 Higher Order Recurrent Sequences
330(8)
8.5 Systems of Recurrence Relations
338(12)
8.6 Homographic Recurrent Sequences
350(7)
8.7 Complex Recurrent Sequences
357(7)
8.8 Recurrent Sequences in Combinatorics
364(10)
8.9 Miscellaneous
374(7)
Appendix 381(12)
A Complex Geometry and Number Theory
381(12)
A.1 Complex Geometry
381(1)
A.1.1 The Triangle Inequality
381(1)
A.1.2 Regular Star Polygons and Multipartite Graphs
382(1)
A.2 Key Elements of Number Theory
382(8)
A.2.1 The lcm and gcd of Integer Pairs
382(1)
A.2.2 The lcm and gcd of Integer Tuples
383(1)
A.2.3 Links Between the 1cm and gcd of Integer Tuples
384(1)
A.2.4 Euler's Totient Function
385(1)
A.2.5 The "Stars and Bars" Argument
385(1)
A.2.6 Partitions of Numbers and Stirling Numbers
386(1)
A.2.7 Linear (In)dependence and Density Results
387(3)
A.3 Numerical Implementation of LRS General Terms
390(3)
A.3.1 Distinct Roots
391(1)
A.3.2 Equal Roots
391(1)
A.3.3 Distinct Roots z1,...zm of Higher Multiplicities d1,...,dm
392(1)
References 393(8)
Index 401
Dorin Andrica is a Professor of Mathematics at the Babe-Bolyai University of Cluj Napoca, Romania. He has obtained a PhD in Pure Mathematics in 1992 with a thesis on critical point theory with applications to the geometry of differentiable submanifolds. His interests include differential topology (critical point theory with applications, Morse theory with applications), differential geometry,  geometry, Lie groups and Lie algebras with applications in geometric mechanics, number theory, discrete mathematics, and mathematics for competitions. Dorin has co-authored Springer textbooks on various topics in mathematics, as well as problem books for olympiad training.





 





Ovidiu Bagdasar is an Associate Professor in Mathematics at the University of Derby, United Kingdom. He holds PhDs in Applied Mathematics (University of Nottingham, 2011), and Pure Mathematics (Babe-Bolyai University,  2015), the latter with a thesis entitled "On the geometry and applications of complex recurrent sequences".   His research is at the boundary between Mathematics and Computer Science, encompassing areas like number theory, optimization, computational, discrete and applied mathematics. He is the author of the SpringerBriefs volume Concise Computer Mathematics Tutorials on Theory and Problems.