TOPICS
Search

Search Results for ""


401 - 410 of 3571 for Kirchhoffs Matrix Tree TheoremSearch Results
The dual of Brianchon's theorem (Casey 1888, p. 146), discovered by B. Pascal in 1640 when he was just 16 years old (Leibniz 1640; Wells 1986, p. 69). It states that, given a ...
The theorem of Möbius tetrads, also simply called Möbius's theorem by Baker (1925, p. 18), may be stated as follows. Let P_1, P_2, P_3, and P_4 be four arbitrary points in a ...
The three circles theorem, also called Hadamard's three circles theorem (Edwards 2001, p. 187), states that if f is an analytic function in the annulus 0<r_1<|z|<r_2<infty, ...
Let phi_x^((k)) denote the recursive function of k variables with Gödel number x, where (1) is normally omitted. Then if g is a partial recursive function, there exists an ...
A limb of a tree at a vertex v is the union of one or more branches at v in the tree. v is then called the base of the limb.
Given an arithmetic progression of terms an+b, for n=1, 2, ..., the series contains an infinite number of primes if a and b are relatively prime, i.e., (a,b)=1. This result ...
A theorem giving a criterion for an origami construction to be flat. Kawasaki's theorem states that a given crease pattern can be folded to a flat origami iff all the ...
The most common statement known as Steiner's theorem (Casey 1893, p. 329) states that the Pascal lines of the hexagons 123456, 143652, and 163254 formed by interchanging the ...
The proposition that every proper ideal of a Boolean algebra can be extended to a maximal ideal. It is equivalent to the Boolean representation theorem, which can be proved ...
There are at least two theorems known as Weierstrass's theorem. The first states that the only hypercomplex number systems with commutative multiplication and addition are ...
1 ... 38|39|40|41|42|43|44 ... 358 Previous Next

...