A) a singular point B) a point of high variability C) a point that remains unchanged under the system's dynamics D) a point that moves randomly
A) a space in which all possible states of a system are represented B) a one-dimensional space C) a space that represents only stable states D) a space where time is not a factor
A) to measure the exact position of a trajectory B) to quantify the rate of exponential divergence or convergence of nearby trajectories C) to study chaotic behavior D) to determine fixed points
A) an attractor with no variability B) a periodic attractor C) an attractor with a fractal structure and sensitive dependence on initial conditions D) a simple point attractor
A) non-conservative dynamics B) sensitivity to initial conditions C) conservation of energy and symplectic structure D) exponential divergence of nearby trajectories
A) it helps in solving differential equations B) it quantifies chaos in a system C) it shows transitions between different dynamical behaviors as a control parameter is varied D) it represents stable fixed points
A) it defines strange attractors B) it generates bifurcation diagrams C) it specifies the Lyapunov exponent D) it determines stability and behavior near fixed points
A) a theory of bifurcations B) a theory of attractors C) a theory of fixed points D) a branch that studies the statistical properties of systems evolving over time
A) Biology B) Literature C) Mathematics D) Physics
A) Non-deterministic B) Chaotic C) Deterministic D) Stochastic
A) Quantitative study B) Qualitative study C) Computational study D) Analytical study
A) Numerical simulations B) Graphical methods C) Sophisticated mathematical techniques D) Statistical analysis
A) Integrability B) Stability C) Chaos theory D) Determinism
A) Linear B) Chaotic C) Periodic D) Stochastic
A) Philosophy B) Chemistry C) Economics D) Engineering
A) Difference equation B) Algebraic equation C) Differential equation D) Function in parameter t
A) Bifurcation theory B) Stability theory C) Chaos theory D) Ergodic theory
A) Continuous B) Discrete C) Deterministic D) Non-evolving
A) George David Birkhoff B) Henri Poincaré C) Aleksandr Lyapunov D) Stephen Smale
A) Poincaré recurrence theorem B) Lyapunov's theorem C) Sharkovsky's theorem D) Ergodic theorem
A) Henri Poincaré B) Aleksandr Lyapunov C) Stephen Smale D) George David Birkhoff
A) The ergodic theorem B) Poincaré recurrence theorem C) Sharkovsky's theorem D) The Smale horseshoe
A) The ergodic theorem B) The Smale horseshoe C) Lyapunov's stability methods D) Sharkovsky's theorem
A) Stephen Smale B) Ali H. Nayfeh C) Henri Poincaré D) George David Birkhoff
A) The identity matrix B) The zero vector C) The neutral element D) The identity element
A) A group B) A ring C) A manifold D) A vector space
A) An infinite field B) A continuous field C) A finite field D) A vector field
A) Lagrangian mechanics formulation. B) Classical mechanics formulation. C) Hamiltonian mechanics formulation. D) Newtonian mechanics formulation.
A) Non-associativity. B) Irreversibility. C) Randomness. D) Associativity.
A) T(1) = 0. B) T(0) = 1. C) T(0) = 0. D) T(1) = 1.
A) T-1 = T(t). B) T-1 = T(0). C) T-1 = 1. D) T-1 = T(-t).
A) Image processing systems. B) Stock prices. C) Planetary positions. D) Robot control parameters.
A) Stochastic. B) Non-deterministic. C) Deterministic. D) Chaotic.
A) T(t1 + t2) = T(t1) / T(t2). B) T(t1 + t2) = T(t1) - T(t2). C) T(t1 + t2) = T(t1) + T(t2). D) T(t1 + t2) = T(t1)T(t2).
A) Limit orbits are always unique. B) Limit orbits always have full Lebesgue measure. C) Limit orbits are always reached. D) Limit orbits may never be reached.
A) The iterates Φn = Φ / Φ / ... / Φ. B) The iterates Φn = Φ - Φ - ... - Φ. C) The iterates Φn = Φ + Φ + ... + Φ. D) The iterates Φn = Φ ∘ Φ ∘ ... ∘ Φ.
A) The Lebesgue measure. B) The Liouville measure. C) The Gaussian measure. D) The Riemann measure.
A) They become measure-preserving. B) They behave physically. C) They become non-invariant. D) They do not behave physically.
A) T B) U C) Φ D) X
A) The evolution parameter B) The orbit through x C) The trajectory through x D) The invariant set
A) Non-autonomous B) Homogeneous C) Autonomous D) Non-homogeneous
A) Integral equations B) Partial differential equations C) Ordinary differential equations D) Algebraic equations
A) The Fibonacci sequence. B) The Lorenz attractor. C) The Mandelbrot set. D) The Logistic map.
A) A continuous transformation. B) A non-transformative process. C) An irreversible change. D) A canonical transformation, ultimately a map.
A) cascades B) lattices C) maps D) automata
A) lattices B) maps C) automata D) avalanches
A) a map B) a semi-cascade C) a cellular automaton D) a cascade
A) a set of functions B) an evolution function C) the 'space' lattice D) the 'time' lattice
A) a set of functions B) the 'space' lattice C) the 'time' lattice D) an evolution function
A) a lattice B) a set of functions C) a tuple D) a (locally defined) evolution function
A) is an evolution function B) represents the 'time' lattice C) represents the 'space' lattice D) is a set of functions
A) Stability principle B) Oscillation principle C) Superposition principle D) Eigenvalue principle
A) Ignoring the vector field B) Increasing the size of each patch C) Stitching several patches together D) Removing singular points
A) Fourier series. B) Taylor series approximations. C) Laplace transforms. D) Partial differential equations.
A) 2-dimensional B) 3-dimensional C) 1-dimensional D) ν-dimensional
A) The energy B) The position C) The associated volume D) The momentum
A) Zermelo B) Koopman C) Boltzmann D) Ruelle
A) Experimental observation B) Functional analysis C) Classical mechanics D) Numerical simulation
A) Liouville measures B) Poincaré recurrences C) SRB measures D) Koopman operators
A) Determinism B) Periodicity C) Stability D) Chaos
A) Chemistry B) Meteorology C) Economics D) Biology
A) Fermi–Pasta–Ulam–Tsingou problem B) Picard-Lindelof theorem C) Horseshoe map D) Pomeau–Manneville scenario |