TOPICS
Search

Search Results for ""


7711 - 7720 of 13134 for Extremal graph theorySearch Results
For a two-dimensional map with sigma_2>sigma_1, d_(Lya)=1-(sigma_1)/(sigma_2), where sigma_n are the Lyapunov characteristic exponents.
A necessary and sufficient condition for all the eigenvalues of a real n×n matrix A to have negative real parts is that the equation A^(T)V+VA=-I has as a solution where V is ...
If all the eigenvalues of a real matrix A have real parts, then to an arbitrary negative definite quadratic form (x,Wx) with x=x(t) there corresponds a positive definite ...
A Lyndon word is an aperiodic notation for representing a necklace.
If a sphere is covered by three closed sets, then one of them must contain a pair of antipodal points.
A robust estimation based on maximum likelihood arguments.
The MacBeath circle, a term coined here for the first time, is the circumcircle of the MacBeath triangle. It has a fairly complicated radius, center function, and circle ...
The MacBeath triangle DeltaX_AX_BX_C (a term coined here for the first time), is the triangle whose vertices are the contact points of the MacBeath inconic with the reference ...
Let E and F be paired spaces with S a family of absolutely convex bounded sets of F such that the sets of S generate F and, if B_1,B_2 in S, there exists a B_3 in S such that ...
The Maclaurin-Bézout theorem says that two curves of degree n intersect in n^2 points, so two cubics intersect in nine points. This means that n(n+3)/2 points do not always ...
1 ... 769|770|771|772|773|774|775 ... 1314 Previous Next

...