Search Results for ""

A prime factorization algorithm in which a sequence of trial divisors is chosen using a quadratic sieve. By using quadratic residues of N, the quadratic residues of the ...

Given a collection of sets, a member set that is not a proper subset of another member set is called a minimal set. Minimal sets are important in graph theory, since many ...

A base for a neighborhood system of a point x is a collection N of open sets such that x belongs to every member of N, and any open set containing x also contains a member of ...

A set of maximum degree to which all other degrees of recursively enumerable sets can be one-one reduced. If set A is many-one complete, then it is one-one complete, and vice ...

A topology defined on a totally ordered set X whose open sets are all the finite intersections of subsets of the form {x in X|x>a} or {x in X|x<a}, where a in X. The order ...

The function f(x,y)=(2x^2-y)(y-x^2) which does not have a local maximum at (0, 0), despite criteria commonly touted in the second half of the 1800s which indicated the ...

A Reeb component is a Reeb foliation (M,F) whose leaves are proper. A foliation which has no Reeb components is said to be Reebless.

A polyhedron with extra triangular faces, given by the Schläfli symbol s{p; q}.

The symbol ∼ used to denote similarity, equivalence relations, or asymptosy.

When a Young tableau is constructed using the so-called insertion algorithm, an element starts in some position on the first row, from which it may later be bumped. In ...