Search Results for ""
1901 - 1910 of 3571 for Kirchhoffs Matrix Tree TheoremSearch Results
sum_(n=0)^(infty)(-1)^n[((2n-1)!!)/((2n)!!)]^3 = 1-(1/2)^3+((1·3)/(2·4))^3+... (1) = _3F_2(1/2,1/2,1/2; 1,1;-1) (2) = [_2F_1(1/4,1/4; 1;-1)]^2 (3) = ...
The slope b of a line obtained using linear least squares fitting is called the regression coefficient.
Rényi's polynomial is the polynomial (Rényi 1947, Coppersmith and Davenport 1991) that has 29 terms and whose square has 28, making it a sparse polynomial square.
The recurrence relation E_n=E_2E_(n-1)+E_3E_(n-2)+...+E_(n-1)E_2 which gives the solution to Euler's polygon division problem.
A relationship between knot polynomials for links in different orientations (denoted below as L_+, L_0, and L_-). J. H. Conway was the first to realize that the Alexander ...
The dual polyhedron of the small icosihemidodecahedron U_(49) and Wenninger dual W_(89). When rendered, the small icosihemidodecacron and small dodecahemidodecacron appear ...
Every dense linear order complete set without endpoints having at most omega disjoint intervals is order isomorphic to the continuum of real numbers, where omega is the set ...
A point which does not lie on at least one ordinary line.
A moving average using 15 points having weights -3, -6, -5, 3, 21, 46, 67, 74, 67, 46, 21, 3, -5, -6, and -3. It is sometimes used by actuaries.
A three-colorable graph G is a graph with chromatic number chi(G)<=3.
...
View search results from all Wolfram sites (23804 matches)

