Search Results for ""
571 - 580 of 3570 for Matrix Tree TheoremSearch Results
There are two different statements, each separately known as the greatest common divisor theorem. 1. Given positive integers m and n, it is possible to choose integers x and ...
The depth of a vertex v in a rooted tree as the number of edges from v to the root vertex. A function to return the depth of a vertex v in a tree g may be implemented in a ...
The matrix decomposition of a square matrix A into so-called eigenvalues and eigenvectors is an extremely important one. This decomposition generally goes under the name ...
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, then there exists a B_3 in S such ...
The generalized Gell-Mann matrices are the n^2-1 matrices generating the Lie algebra associated to the special unitary group SU(n), n>=2. As their name suggests, these ...
The eigenvalues lambda satisfying P(lambda)=0, where P(lambda) is the characteristic polynomial, lie in the unions of the disks |z|<=1 |z+b_1|<=sum_(j=1)^n|b_j|.
The numerators and denominators obtained by taking the ratios of adjacent terms in the triangular array of the number of +1 "bordered" alternating sign matrices A_n with a 1 ...
Let the nth composition of a function f(x) be denoted f^((n))(x), such that f^((0))(x)=x and f^((1))(x)=f(x). Denote the composition of f and g by f degreesg(x)=f(g(x)), and ...
The nth cubic number n^3 is a sum of n consecutive odd numbers, for example 1^3 = 1 (1) 2^3 = 3+5 (2) 3^3 = 7+9+11 (3) 4^3 = 13+15+17+19, (4) etc. This identity follows from ...
If n=1,2 (mod 4), and the squarefree part of n is divisible by a prime p=3 (mod 4), then no difference set of order n exists. Equivalently, if a projective plane of order n ...
...
View search results from all Wolfram sites (23765 matches)

