Search Results for ""

A continuous distribution in which the logarithm of a variable has a normal distribution. It is a general case of Gibrat's distribution, to which the log normal distribution ...

Consider the sequence of partial sums defined by s_n=sum_(k=1)^n(-1)^kk^(1/k). (1) As can be seen in the plot above, the sequence has two limit points at -0.812140... and ...

Let there be three polynomials a(x), b(x), and c(x) with no common factors such that a(x)+b(x)=c(x). Then the number of distinct roots of the three polynomials is one or more ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings of ...

The (upper) matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set. Equivalently, it is the degree ...

(d^2V)/(dv^2)+[a-2qcos(2v)]V=0 (1) (Abramowitz and Stegun 1972; Zwillinger 1997, p. 125), having solution y=C_1C(a,q,v)+C_2S(a,q,v), (2) where C(a,q,v) and S(a,q,v) are ...

Measure theory is the study of measures. It generalizes the intuitive notions of length, area, and volume. The earliest and most important examples are Jordan measure and ...

A merge sort (or collation sort) is the combination of two or more ordered lists into a single ordered list (Knuth 1998, p. 158). Merge sorting was one of the first methods ...

A minimum vertex cover is a vertex cover having the smallest possible number of vertices for a given graph. The size of a minimum vertex cover of a graph G is known as the ...

Let A be an involutive algebra over the field C of complex numbers with involution xi|->xi^♯. Then A is a modular Hilbert algebra if A has an inner product <··> and a ...