Search Results for ""
591 - 600 of 3570 for Matrix Tree TheoremSearch Results
If an analytic function has a single simple pole at the radius of convergence of its power series, then the ratio of the coefficients of its power series converges to that ...
The Fermat number F_n is prime iff 3^(2^(2^n-1))=-1 (mod F_n).
Let H be a Hilbert space, B(H) the set of bounded linear operators from H to itself, T an operator on H, and sigma(T) the operator spectrum of T. Then if T in B(H) and T is ...
According to Euler's rotation theorem, any rotation may be described using three angles. If the rotations are written in terms of rotation matrices D, C, and B, then a ...
The circles on the polygon diagonals of a complete quadrilateral as diameters are coaxal. Furthermore, the orthocenters of the four triangles of a complete quadrilateral are ...
Let G be a group, then there exists a piecewise linear knot K^(n-2) in S^n for n>=5 with G=pi_1(S^n-K) iff G satisfies 1. G is finitely presentable, 2. The Abelianization of ...
The cross graph is the 6-vertex tree illustrated above. It is implemented in the Wolfram Language as GraphData["CrossGraph"].
The external (internal) similarity point of two fixed circles is the point at which all the circles homogeneously (nonhomogeneously) tangent to the fixed circles have the ...
Two nodes connected to the same node which are same distance from the root vertex in a rooted tree are called siblings. A function to return the siblings of a vertex v in a ...
Let A_r=a_(ij) be a sequence of N symmetric matrices of increasing order with i,j=1, 2, ..., r and r=1, 2, ..., N. Let lambda_k(A_r) be the kth eigenvalue of A_r for k=1, 2, ...
...
View search results from all Wolfram sites (23765 matches)

