Difference Equations: From Rabbits to Chaos

Last updated
Difference Equations: From Rabbits to Chaos
AuthorPaul Cull, Mary Flahive, and Robby Robson
Series Undergraduate Texts in Mathematics
SubjectDifference equations
GenreTextbook
Publisher Springer-Verlag
Publication date
2005
ISBN 978-0-387-23233-1

Difference Equations: From Rabbits to Chaos is an undergraduate-level textbook on difference equations, a type of recurrence relation in which the values of a sequence are determined by equations involving differences of successive terms of the sequence. It was written by Paul Cull, Mary Flahive, and Robby Robson, and published by Springer-Verlag in their Undergraduate Texts in Mathematics series (Vol. 111, 2005, doi:10.1007/0-387-27645-9, ISBN   978-0-387-23233-1). [1] [2] [3] [4] [5]

Contents

Topics

After an introductory chapter on the Fibonacci numbers and the rabbit population dynamics example based on these numbers that Fibonacci introduced in his book Liber Abaci , the book includes chapters on homogeneous linear equations, finite difference equations and generating functions, nonnegative difference equations and roots of characteristic polynomials, the Leslie matrix in population dynamics, matrix difference equations and Markov chains, recurrences in modular arithmetic, algorithmic applications of fast Fourier transforms, and nonlinear difference equations and dynamical systems. [1] [2] [3] [4] Four appendices include a set of worked problems, background on complex numbers and linear algebra, and a method of Morris Marden for testing whether the sequence defined by a difference equation converges to zero. [4]

Other books on similar topics include A Treatise on the Calculus of Finite Differences by George Boole, Introduction to Difference Equations by S. Goldberg, [5] Difference Equations: An Introduction with Applications by W. G. Kelley and A. C. Peterson, An Introduction to Difference Equations by S. Elaydi, Theory of Difference Equations: An Introduction by V. Lakshmikantham and D. Trigiante, and Difference Equations: Theory and Applications by R. E. Mickens. However, From Rabbits to Chaos places a greater emphasis on computation than theory compared to some of these other books. [4] Reviewer Henry Ricardo writes that the book is "more suitable to an undergraduate course" than its alternatives, despite being less in-depth, because of its greater accessibility and connection to application areas. [1] Similarly, reviewer Shandelle Henson calls From Rabbits to Chaos "well written and easy to read" but adds that it is not "comprehensive or up-to-date". [3]

Related Research Articles

<span class="mw-page-title-main">Chaos theory</span> Field of mathematics and science based on non-linear systems and initial conditions

Chaos theory is an interdisciplinary area of scientific study and branch of mathematics. It focuses on underlying patterns and deterministic laws of dynamical systems that are highly sensitive to initial conditions. These were once thought to have completely random states of disorder and irregularities. Chaos theory states that within the apparent randomness of chaotic complex systems, there are underlying patterns, interconnection, constant feedback loops, repetition, self-similarity, fractals and self-organization. The butterfly effect, an underlying principle of chaos, describes how a small change in one state of a deterministic nonlinear system can result in large differences in a later state. A metaphor for this behavior is that a butterfly flapping its wings in Brazil can cause a tornado in Texas.

<span class="mw-page-title-main">Discrete mathematics</span> Study of discrete mathematical structures

Discrete mathematics is the study of mathematical structures that can be considered "discrete" rather than "continuous". Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets. However, there is no exact definition of the term "discrete mathematics".

<span class="mw-page-title-main">Dynamical system</span> Mathematical model of the time dependence of a point in space

In mathematics, a dynamical system is a system in which a function describes the time dependence of a point in an ambient space, such as in a parametric curve. Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a pipe, the random motion of particles in the air, and the number of fish each springtime in a lake. The most general definition unifies several concepts in mathematics such as ordinary differential equations and ergodic theory by allowing different choices of the space and how time is measured. Time can be measured by integers, by real or complex numbers or can be a more general algebraic object, losing the memory of its physical origin, and the space may be a manifold or simply a set, without the need of a smooth space-time structure defined on it.

<span class="mw-page-title-main">Fibonacci sequence</span> Numbers obtained by adding the two previous ones

In mathematics, the Fibonacci sequence is a sequence in which each number is the sum of the two preceding ones. Numbers that are part of the Fibonacci sequence are known as Fibonacci numbers, commonly denoted Fn. The sequence commonly starts from 0 and 1, although some authors start the sequence from 1 and 1 or sometimes from 1 and 2. Starting from 0 and 1, the sequence begins

<span class="mw-page-title-main">Linear algebra</span> Branch of mathematics

Linear algebra is the branch of mathematics concerning linear equations such as:

In mathematics, a recurrence relation is an equation according to which the th term of a sequence of numbers is equal to some combination of the previous terms. Often, only previous terms of the sequence appear in the equation, for a parameter that is independent of ; this number is called the order of the relation. If the values of the first numbers in the sequence have been given, the rest of the sequence can be calculated by repeatedly applying the equation.

<span class="mw-page-title-main">Dynamical systems theory</span> Area of mathematics used to describe the behavior of complex dynamical systems

Dynamical systems theory is an area of mathematics used to describe the behavior of complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical systems. From a physical point of view, continuous dynamical systems is a generalization of classical mechanics, a generalization where the equations of motion are postulated directly and are not constrained to be Euler–Lagrange equations of a least action principle. When difference equations are employed, the theory is called discrete dynamical systems. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a Cantor set, one gets dynamic equations on time scales. Some situations may also be modeled by mixed operators, such as differential-difference equations.

In mathematics, symbolic dynamics is the study of dynamical systems defined on a discrete space consisting of infinite sequences of abstract symbols. The evolution of the dynamical system is defined as a simple shift of the sequence.

<span class="mw-page-title-main">Ordered Bell number</span> Number of weak orderings

In number theory and enumerative combinatorics, the ordered Bell numbers or Fubini numbers count the weak orderings on a set of elements. Weak orderings arrange their elements into a sequence allowing ties, such as might arise as the outcome of a horse race.

Lloyd Nicholas Trefethen is an American mathematician, professor of numerical analysis and until 2023 head of the Numerical Analysis Group at the Mathematical Institute, University of Oxford.

Undergraduate Texts in Mathematics (UTM) is a series of undergraduate-level textbooks in mathematics published by Springer-Verlag. The books in this series, like the other Springer-Verlag mathematics series, are small yellow books of a standard size.

A Ducci sequence is a sequence of n-tuples of integers, sometimes known as "the Diffy game", because it is based on sequences.

<span class="mw-page-title-main">Matrix (mathematics)</span> Array of numbers

In mathematics, a matrix is a rectangular array or table of numbers, symbols, or expressions, with elements or entries arranged in rows and columns, which is used to represent a mathematical object or property of such an object.

In additive and algebraic number theory, the Skolem–Mahler–Lech theorem states that if a sequence of numbers satisfies a linear difference equation, then with finitely many exceptions the positions at which the sequence is zero form a regularly repeating pattern. This result is named after Thoralf Skolem, Kurt Mahler, and Christer Lech. Its known proofs use p-adic analysis and are non-constructive.

<span class="mw-page-title-main">J. Laurie Snell</span> American mathematician

James Laurie Snell was an American mathematician and educator.

<span class="mw-page-title-main">Constant-recursive sequence</span> Infinite sequence of numbers satisfying a linear equation

In mathematics, an infinite sequence of numbers is called constant-recursive if it satisfies an equation of the form

Mary Elizabeth Flahive is a professor of mathematics at Oregon State University. Her research interests are in number theory; she is the author of two books on difference equations and Diophantine approximation, and is also interested in the geometry of numbers and algebraic coding theory.

Shandelle Marie Henson is an American mathematician and mathematical biologist known for her work in population dynamics. She is a professor of mathematics and ecology at Andrews University in Berrien Springs, Michigan, and the editor-in-chief of the journal Natural Resource Modeling.

Proofs That Really Count: the Art of Combinatorial Proof is an undergraduate-level mathematics book on combinatorial proofs of mathematical identies. That is, it concerns equations between two integer-valued formulas, shown to be equal either by showing that both sides of the equation count the same type of mathematical objects, or by finding a one-to-one correspondence between the different types of object that they count. It was written by Arthur T. Benjamin and Jennifer Quinn, and published in 2003 by the Mathematical Association of America as volume 27 of their Dolciani Mathematical Expositions series. It won the Beckenbach Book Prize of the Mathematical Association of America.

References

  1. 1 2 3 Ricardo, Henry (September 2005), "Review of Difference Equations", MAA Reviews
  2. 1 2 "Review of Difference Equations", Journal of Difference Equations and Applications, 11 (15): 1307–1308, December 2005, doi:10.1080/10236190500438316, S2CID   216136126
  3. 1 2 3 Henson, Shandelle M. (2006), "Review of Difference Equations", Mathematical Reviews , MR   2131908
  4. 1 2 3 4 Peterson, Allan (March 2006), "Review of Difference Equations", SIAM Review , 48 (1): 194, JSTOR   20453784
  5. 1 2 Crilly, Tony (July 2007), "Review of Difference Equations", The Mathematical Gazette, 91 (521): 373–374, doi:10.1017/s0025557200181938, JSTOR   40378382, S2CID   184957851