TOPICS
Search

Search Results for ""


271 - 280 of 3570 for Matrix Tree TheoremSearch Results
A generalization of Turán's theorem to non-complete graphs.
If we expand the determinant of a matrix A using determinant expansion by minors, first in terms of the minors of order r formed from any r rows, with their complementaries, ...
Let {y^k} be a set of orthonormal vectors with k=1, 2, ..., K, such that the inner product (y^k,y^k)=1. Then set x=sum_(k=1)^Ku_ky^k (1) so that for any square matrix A for ...
Alexandrov's theorem addresses conditions under which a polygon will fold into a convex polyhedron (Malkevitch).
A theorem which treats constructions of fields of field characteristic p.
A Tauberian theorem is a theorem that deduces the convergence of an series on the basis of the properties of the function it defines and any kind of auxiliary hypothesis ...
Let f(x) be differentiable on the open interval (a,b) and continuous on the closed interval [a,b]. Then there is at least one point c in (a,b) such that ...
If p is a prime number and a is a natural number, then a^p=a (mod p). (1) Furthermore, if pa (p does not divide a), then there exists some smallest exponent d such that ...
If n>19, there exists a Poulet number between n and n^2. The theorem was proved in 1965.
The Schröder-Bernstein theorem for numbers states that if n<=m<=n, then m=n. For sets, the theorem states that if there are injections of the set A into the set B and of B ...
1 ... 25|26|27|28|29|30|31 ... 357 Previous Next

...