Search Results for ""

In set theory, a unary operation on set A is a function A->A. More generally, a unary operation is a function with exactly one operand, such as the factorial, square root, or ...

A set in R^n which can be reduced to one of its points, say P, by a continuous deformation, is said to be contractible. The transformation is such that each point of the set ...

A function is a relation that uniquely associates members of one set with members of another set. More formally, a function from A to B is an object f such that every a in A ...

A set of class representatives is a subset of X which contains exactly one element from each equivalence class.

A relational system is a structure R=(S,{P_i:i in I},{f_j:j in J}) consisting of a set S, a collection of relations P_i(i in I) on S, and a collection of functions f_j(j in ...

A p-system of a set S is a sequence of subsets A_1, A_2, ..., A_p of S, among which some may be empty or coinciding with each other.

The largest n such that |z_n|<4 in a Mandelbrot set. Points of different count are often assigned different colors.

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

Let X be a set of urelements, and let V(X) be the superstructure with X as its set of individuals. Let kappa be a cardinal number. An enlargement V(^*X) is kappa-saturated ...

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...