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