Search Results for ""

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

Let p be an odd prime and F_n the cyclotomic field of p^(n+1)th roots of unity over the rational field. Now let p^(e(n)) be the power of p which divides the class number h_n ...

A 1-cusped epicycloid has b=a, so n=1. The radius measured from the center of the large circle for a 1-cusped epicycloid is given by epicycloid equation (◇) with n=1 so r^2 = ...

An extreme point of a subset K of a vector space X is an extreme set S of K which consists of a single point x in K. The collection of all extreme points of K is sometimes ...

A smooth curve which corresponds to the limiting case of a histogram computed for a frequency distribution of a continuous distribution as the number of data points becomes ...

Every graph with n vertices and maximum vertex degree Delta(G)<=k is (k+1)-colorable with all color classes of size |_n/(k+1)_| or [n/(k+1)], where |_x_| is the floor ...

Let Gamma be an algebraic curve in a projective space of dimension n, and let p be the prime ideal defining Gamma, and let chi(p,m) be the number of linearly independent ...

100=10^2. Madachy (1979) gives a number of algebraic equations using the digits 1 to 9 which evaluate to 100, such as (7-5)^2+96+8-4-3-1 = 100 (1) 3^2+91+7+8-6-5-4 = 100 (2) ...

A Fourier series in which there are large gaps between nonzero terms a_n or b_n.

An algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.