difference-and-functional-equations

Layer 0 — Mathematics24 concepts in this subtree

Two closely related branches. Difference equations study sequences (x_n) satisfying a recursion F(x_{n+k}, x_{n+k-1}, …, x_n, n) = 0 — the discrete-time analogue of ODEs. Linear-constant-coefficient theory is complete: given F(x_{n+k},…

Linear recurrence a_{n+k} + c_{k-1}a_{n+k-1} + ... = 0: characteristic-poly solution
Cauchy/Jensen/d'Alembert functional equations: regularity → linearity
Z-transform X(z) = Σ_n x[n] z^{-n}: discrete-time analogue of Laplace
Binet F_n=(φⁿ−ψⁿ)/√5: F₅=5, F₁₀=55; recurrence residual 0
Cauchy additive f(x+y)=f(x)+f(y), f(1)=2 ⇒ f(x)=2x; f(3)=6
Z{u[n]} = z/(z−1) on |z|>1; Z(2) = 2; Z(3) = 3/2
Cauchy functional equation
Abel's functional equation
Fibonacci recurrence (golden ratio)
Characteristic equation for linear recurrences
Z-transform (discrete signals)
Schröder functional equation (iteration)
Z-transform (Jury 1958)
Logistic map (Feigenbaum 1975)
Jury stability test (1962)
Linear difference eqn (characteristic roots)
Euler-Maclaurin summation (1735-1742)
Cauchy functional equation (1821)
Recurrence (Fibonacci 1202)
Pringsheim radius (1894)
Functional equations (Aczel 1966)
Dynamical systems (Poincare 1890)
Lorenz attractor (1963)
Hahn q-difference (1949)
Explore the difference-and-functional-equations subtree on the interactive graph →