Search Results for ""

Also known as Kolmogorov entropy, Kolmogorov-Sinai entropy, or KS entropy. The metric entropy is 0 for nonchaotic motion and >0 for chaotic motion.

A topology induced by the metric g defined on a metric space X. The open sets are all subsets that can be realized as the unions of open balls B(x_0,r)={x in X|g(x_0,x)<r}, ...

The middle levels conjecture, also known as revolving door conjecture, posits that the middle layer graph has a Hamilton cycle for every n>=1. The conjecture was proved by ...

A derived polygon with side ratios chosen as r=1/2 so that inscribed polygons are constructed by connecting the midpoints of the base polygon. For a triangle P, the ...

Given order statistics Y_1=min_(j)X_j, Y_2, ..., Y_(N-1), Y_N=max_(j)X_j with sample size N, the midrange of the random sample is defined by MR=1/2(Y_1+Y_N) (Hogg and Craig ...

The n-roll mill curve is given by the equation x^n-(n; 2)x^(n-2)y^2+(n; 4)x^(n-4)y^4-...=a^n, where (n; k) is a binomial coefficient.

For a catastrophically unstable recurrence in one direction, any seed values for consecutive x_j and x_(j+1) will converge to the desired sequence of functions in the ...

If a compact manifold M has nonnegative Ricci curvature tensor, then its fundamental group has at most polynomial growth. On the other hand, if M has negative curvature, then ...

A matrix with 0 determinant whose determinant becomes nonzero when any element on or below the diagonal is changed from 0 to 1. An example is M=[1 -1 0 0; 0 0 -1 0; 1 1 1 -1; ...

A minimal vertex cut is an vertex cut of a graph that is not a proper subset of any other vertex cut. Every minimum vertex cut is a minimal vertex cut, but the converse does ...