Search Results for ""
1941 - 1950 of 3570 for Matrix Tree TheoremSearch Results
The word polyhedron has slightly different meanings in geometry and algebraic geometry. In geometry, a polyhedron is simply a three-dimensional solid which consists of a ...
There are at least two results known as "the area principle." The geometric area principle states that (|A_1P|)/(|A_2P|)=(|A_1BC|)/(|A_2BC|). (1) This can also be written in ...
An AB percolation is a discrete percolation model in which the underlying point lattice graph L has the properties that each of its graph vertices is occupied by an atom ...
Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...
A method of solving combinatorial problems by means of an algorithm which is allowed to run forward until a dead end is reached, at which point previous steps are retraced ...
The attractor of the iterated function system given by the set of "fern functions" f_1(x,y) = [0.85 0.04; -0.04 0.85][x; y]+[0.00; 1.60] (1) f_2(x,y) = [-0.15 0.28; 0.26 ...
The bei_nu(z) function is defined through the equation J_nu(ze^(3pii/4))=ber_nu(z)+ibei_nu(z), (1) where J_nu(z) is a Bessel function of the first kind, so ...
The "binary" Champernowne constant is obtained by concatenating the binary representations of the integers C_2 = 0.(1)(10)(11)(100)(101)(110)(111)..._2 (1) = ...
A centered polygonal number consisting of a central dot with five dots around it, and then additional dots in the gaps between adjacent dots. The general term is ...
A number of spellings of "Chebyshev" (which is the spelling used exclusively in this work) are commonly found in the literature. These include Tchebicheff, Čebyšev, ...
...
View search results from all Wolfram sites (23765 matches)

