Search Results for ""

A set S of positive integers is said to be Diophantine iff there exists a polynomial Q with integral coefficients in m>=1 indeterminates such that ...

A set of elements S is said to be infinite if the elements of a proper subset S^' can be put into one-to-one correspondence with the elements of S. An infinite set whose ...

Let G be a group of group order h and D be a set of k elements of G. If the set of differences d_i-d_j contains every nonzero element of G exactly lambda times, then D is a ...

A set-theoretic term having a number of different meanings. Fraenkel (1953, p. 37) used the term as a synonym for "finite set." However, according to Russell's definition ...

A subset E of a topological space S is said to be meager if E is of first category in S, i.e., if E can be written as the countable union of subsets which are nowhere dense ...

A set X is called a "cone" with vertex at the origin if for any x in X and any scalar a>=0, ax in X.

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 ...

Giving a set F={f_1,f_2,...,f_n} of contracting similitudes of R^l, the closed set E is said to be subselfsimilar for F if E subset union _(i=1)^nf_i(E) (Falconer 1995, ...

A k-automatic set is a set of integers whose base-k representations form a regular language, i.e., a language accepted by a finite automaton or state machine. If bases a and ...

A subset G subset R of the real numbers is said to be a G_delta set provided G is the countable intersection of open sets. The name G_delta comes from German: The G stands ...