Search Results for ""

Complex infinity is an infinite number in the complex plane whose complex argument is unknown or undefined. Complex infinity may be returned by the Wolfram Language, where it ...

The set P^2 is the set of all equivalence classes [a,b,c] of ordered triples (a,b,c) in C^3\(0,0,0) under the equivalence relation (a,b,c)∼(a^',b^',c^') if ...

A complex vector bundle is a vector bundle pi:E->M whose fiber bundle pi^(-1)(x) is a complex vector space. It is not necessarily a complex manifold, even if its base ...

A complex vector space is a vector space whose field of scalars is the complex numbers. A linear transformation between complex vector spaces is given by a matrix with ...

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.

Let L be a link in R^3 and let there be a disk D in the link complement R^3-L. Then a surface F such that D intersects F exactly in its boundary and its boundary does not ...

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 concave polygon is a polygon that is not convex. A simple polygon is concave iff at least one of its internal angles is greater than 180 degrees. An example of a non-simple ...