Search Results for ""

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 ...

The asymptotic form of the n-step Bernoulli distribution with parameters p and q=1-p is given by P_n(k) = (n; k)p^kq^(n-k) (1) ∼ 1/(sqrt(2pinpq))e^(-(k-np)^2/(2npq)) (2) ...

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 ...

Consider the problem of comparing two real numbers x and y based on their continued fraction representations. Then the mean number of iterations needed to determine if x<y or ...

Kontsevich's integral is a far-reaching generalization of the Gauss integral for the linking number, and provides a tool to construct the universal Vassiliev invariant of a ...

Unlike quadratic, cubic, and quartic polynomials, the general quintic cannot be solved algebraically in terms of a finite number of additions, subtractions, multiplications, ...