Search Results for ""

Consider a set of points X_i on an attractor, then the correlation integral is C(l)=lim_(N->infty)1/(N^2)f, where f is the number of pairs (i,j) whose distance |X_i-X_j|<l. ...

The elliptic curve factorization method, abbreviated ECM and sometimes also called the Lenstra elliptic curve method, is a factorization algorithm that computes a large ...

An integer is k-smooth if it has no prime factors >k. The following table gives the first few k-smooth numbers for small k. Berndt (1994, p. 52) called the 7-smooth numbers ...

A RAT-free ("right angle triangle-free") set is a set of points, no three of which determine a right triangle. Let f(n) be the largest integer such that a RAT-free subset of ...

The curve produced by fixed point P on the circumference of a small circle of radius b rolling around the inside of a large circle of radius a>b. A hypocycloid is therefore a ...

A manifold is a topological space that is locally Euclidean (i.e., around every point, there is a neighborhood that is topologically the same as the open unit ball in R^n). ...

The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

The baby monster group, also known as Fischer's baby monster group, is the second-largest sporadic group. It is denoted B and has group order |B| = ...

A point in a weighted tree that has minimum weight for the tree. The set of all centroid points is called a tree centroid (Harary 1994, p. 36). The largest possible values ...