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