Search Results for ""

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

A lucky number of Euler is a number p such that the prime-generating polynomial n^2-n+p is prime for n=1, 2, ..., p-1. Such numbers are related to the imaginary quadratic ...

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

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

A deconvolution algorithm (sometimes abbreviated MEM) which functions by minimizing a smoothness function ("entropy") in an image. Maximum entropy is also called the ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

A type of integral containing gamma functions in its integrand. A typical such integral is given by ...

An algorithm for finding the nearest local minimum of a function which presupposes that the gradient of the function can be computed. The method of steepest descent, also ...

The middle layer graph of order n is the graph whose vertex set consists of all bitstrings of length 2n+1 that have exactly n or n+1 entries equal to 1, with an edge between ...

The Miller Institute knot is the 6-crossing prime knot 6_2. It is alternating, chiral, and invertible. A knot diagram of its laevo form is illustrated above, which is ...