Search Results for ""

An n-component of a graph G is a maximal n-connected subgraph.

A compositeness certificate is a piece of information which guarantees that a given number p is composite. Possible certificates consist of a factor of a number (which, in ...

A test which always identifies prime numbers correctly, but may incorrectly identify a composite number as a prime.

The concatenation of two strings a and b is the string ab formed by joining a and b. Thus the concatenation of the strings "book" and "case" is the string "bookcase". The ...

A set in R^d is concave if it does not contain all the line segments connecting any pair of its points. If the set does contain all the line segments, it is called convex.

A function f(x) is said to be concave on an interval [a,b] if, for any points x_1 and x_2 in [a,b], the function -f(x) is convex on that interval (Gradshteyn and Ryzhik 2000).

Let mu be a positive measure on a sigma-algebra M, and let lambda be an arbitrary (real or complex) measure on M. If there is a set A in M such that lambda(E)=lambda(A ...

A conclusion is a statement arrived at by applying a set of logical rules known as syllogisms to a set of premises. The process of drawing conclusions from premises and ...

A concordance between knots K_0 and K_1 in S^3 is a locally flat cylinder C=S^1×[0,1] embedded in S^3×[0,1] in such a way that the ends S^1×{1} are embedded in S^3×{i} as ...

A requirement necessary for a given statement or theorem to hold. Also called a criterion.