TOPICS
Search

Search Results for ""


911 - 920 of 3570 for Matrix Tree TheoremSearch Results
Let j, r, and s be distinct integers (mod n), and let W_i be the point of intersection of the side or diagonal V_iV_(i+j) of the n-gon P=[V_1,...,V_n] with the transversal ...
Except for triangles, every simple polygon has at least two nonoverlapping ears.
Let f_n(z) be a sequence of functions, each regular in a region D, let |f_n(z)|<=M for every n and z in D, and let f_n(z) tend to a limit as n->infty at a set of points ...
Let a group G have a group presentation G=<x_1,...,x_n|r_j(x_1,...,x_n),j in J> so that G=F/R, where F is the free group with basis {x_1,...,x_n} and R is the normal subgroup ...
If F(x) is a probability distribution with zero mean and rho=int_(-infty)^infty|x|^3dF(x)<infty, (1) where the above integral is a stieltjes integral, then for all x and n, ...
A fixed point for which the stability matrix has equal nonzero eigenvectors.
The minimum leaf number ml(G) of a connected graph G is the smallest number of tree leaves in any of its spanning trees. (The corresponding largest number of leaves is known ...
If the trilinear polars of the polygon vertices of a triangle are distinct from the respectively opposite sides, they meet the sides in three collinear points.
_2F_1(a,b;c;1)=((c-b)_(-a))/((c)_(-a))=(Gamma(c)Gamma(c-a-b))/(Gamma(c-a)Gamma(c-b)) for R[c-a-b]>0, where _2F_1(a,b;c;x) is a (Gauss) hypergeometric function. If a is a ...
If T is a set of axioms in a first-order language, and a statement p holds for any structure M satisfying T, then p can be formally deduced from T in some appropriately ...
1 ... 89|90|91|92|93|94|95 ... 357 Previous Next

...