Search Results for ""

The downward Clenshaw recurrence formula evaluates a sum of products of indexed coefficients by functions which obey a recurrence relation. If f(x)=sum_(k=0)^Nc_kF_k(x) (1) ...

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...

A prime number obtained by reading digits around an analog clock. In a clockwise direction, the primes are 2, 3, 5, 7, 11, 23, 67, 89, 4567, 23456789, 23456789101112123, ... ...

A linear operator A:D(A)->H from its domain D(A) into a Hilbert space H is closable if it has a closed extension B:D(B)->H where D(A) subset D(B). Closable operators are ...

The closed graph theorem states that a linear operator between two Banach spaces X and Y is continuous iff it has a closed graph, where the "graph" {(x,f(x)):x in X} is ...

A closed sentential formula is a sentential formula in which none of the variables are free (i.e., all variables are bound). Examples of closed sentential formulas are given ...

There are several equivalent definitions of a closed set. Let S be a subset of a metric space. A set S is closed if 1. The complement of S is an open set, 2. S is its own set ...

The term "closure" has various meanings in mathematics. The topological closure of a subset A of a topological space X is the smallest closed subset of X containing A. If R ...

Cluster analysis is a technique used for classification of data in which data elements are partitioned into groups called clusters that represent collections of data elements ...

An odd prime p is called a cluster prime if every even positive integer less than p-2 can be written as a difference of two primes q-q^', where q,q^'<=p. The first 23 odd ...