- recurrence theorem
- мат. теорема возвращения (в эргодической теории)
Большой англо-русский и русско-английский словарь. 2001.
recurrence theorem
Смотреть что такое "recurrence theorem" в других словарях:
Poincaré recurrence theorem — In mathematics, the Poincaré recurrence theorem states that certain systems will, after a sufficiently long time, return to a state very close to the initial state. The Poincaré recurrence time is the length of time elapsed until the recurrence.… … Wikipedia
Recurrence — and recurrent may refer to: *Recurrence relation, an equation which defines a sequence recursively *Poincaré recurrence theorem, Henri Poincaré s theorem on dynamical systems *Recurrence plot, a statistical plot that shows a pattern that re… … Wikipedia
Recurrence plot — In descriptive statistics and chaos theory, a recurrence plot (RP) is a plot showing, for a given moment in time, the times at which a phase space trajectory visits roughly the same area in the phase space. In other words, it is a graph of… … Wikipedia
Recurrence quantification analysis — (RQA) is a method of nonlinear data analysis (cf. chaos theory) for the investigation of dynamical systems. It quantifies the number and duration of recurrences of a dynamical system presented by its phase space trajectory.BackgroundThe… … Wikipedia
Recurrence relation — Difference equation redirects here. It is not to be confused with differential equation. In mathematics, a recurrence relation is an equation that recursively defines a sequence, once one or more initial terms are given: each further term of the… … Wikipedia
Master theorem — For a result in enumerative combinatorics, see MacMahon Master theorem. In the analysis of algorithms, the master theorem provides a cookbook solution in asymptotic terms (using Big O notation) for recurrence relations of types that occur in the… … Wikipedia
Pentagonal number theorem — In mathematics, the pentagonal number theorem, originally due to Euler, relates the product and series representations of the Euler function. It states that:prod {n=1}^infty (1 x^n)=sum {k= infty}^infty( 1)^kx^{k(3k 1)/2}.In other words, :(1 x)(1 … Wikipedia
Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane … Wikipedia
Banach fixed-point theorem — In mathematics, the Banach fixed point theorem (also known as the contraction mapping theorem or contraction mapping principle) is an important tool in the theory of metric spaces; it guarantees the existence and uniqueness of fixed points of… … Wikipedia
Fundamental theorem of combinatorial enumeration — The fundamental theorem of combinatorial enumeration is a theorem in combinatorics that solves the enumeration problem of labelled and unlabelled combinatorial classes. The unlabelled case is based on the Pólya enumeration theorem.This theorem is … Wikipedia
Cauchy–Kowalevski theorem — In mathematics, the Cauchy–Kowalevski theorem is the main local existence and uniqueness theorem for analytic partial differential equations associated with Cauchy initial value problems. A special case was proved by harvs|authorlink=Augustin… … Wikipedia
