Search Results for ""

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

A maximum spanning tree is a spanning tree of a weighted graph having maximum weight. It can be computed by negating the weights for each edge and applying Kruskal's ...

The parabolic cylinder functions are a class of functions sometimes called Weber functions. There are a number of slightly different definitions in use by various authors. ...

Elliptic rational functions R_n(xi,x) are a special class of rational functions that have nice properties for approximating other functions over the interval x in [-1,1]. In ...

The Bessel functions of the first kind J_n(x) are defined as the solutions to the Bessel differential equation x^2(d^2y)/(dx^2)+x(dy)/(dx)+(x^2-n^2)y=0 (1) which are ...

A letter of the alphabet drawn with doubled vertical strokes is called doublestruck, or sometimes blackboard bold (because doublestruck characters provide a means of ...

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

A finite set of contraction maps w_i for i=1, 2, ..., N, each with a contractivity factor s<1, which map a compact metric space onto itself. It is the basis for fractal image ...

Denoted zn(u,k) or Z(u). Z(phi|m)=E(phi|m)-(E(m)F(phi|m))/(K(m)), where phi is the Jacobi amplitude, m is the parameter, and F(phi|m) and K(m) are elliptic integrals of the ...

Odd values of Q(n) are 1, 1, 3, 5, 27, 89, 165, 585, ... (OEIS A051044), and occur with ever decreasing frequency as n becomes large (unlike P(n), for which the fraction of ...