Search Results for ""

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

A generalization of the polyominoes using a collection of equal-sized equilateral triangles (instead of squares) arranged with coincident sides. Polyiamonds are sometimes ...

In analysis, the phrase "Riesz-Fischer theorem" is used to describe a number of results concerning the convergence of Cauchy sequences in L-p spaces. The theorem is named for ...

Roundoff error is the difference between an approximation of a number used in computation and its exact (correct) value. In certain types of computation, roundoff error can ...

The Steiner tree of some subset of the vertices of a graph G is a minimum-weight connected subgraph of G that includes all the vertices. It is always a tree. Steiner trees ...

The asymptotic series for the gamma function is given by (1) (OEIS A001163 and A001164). The coefficient a_n of z^(-n) can given explicitly by ...

A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...

A fractal which can be constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[0 1 0; 1 1 1; 0 1 0],1->[1 1 1; 1 1 1; 1 1 1]}. (1) The size ...

For |z|<1, product_(k=1)^infty(1+z^k)=product_(k=1)^infty(1-z^(2k-1))^(-1). (1) Both of these have closed form representation 1/2(-1;z)_infty, (2) where (a;q)_infty is a ...

A trivalent tree, also called a 3-valent tree or a 3-Cayley tree, is a tree for which each node has vertex degree <=3. The numbers of trivalent trees on n=1, 2, ... nodes are ...