Search Results for ""

A countable set is a set that is either finite or denumerable. However, some authors (e.g., Ciesielski 1997, p. 64) use the definition "equipollent to the finite ordinals," ...

The arc set of a directed graph is the set of all arcs (directed edges) of the graph. The arc set for a directed graph g is given in the Wolfram Language by EdgeList[g].

The set difference A\B is defined by A\B={x:x in A and x not in B}. Here, the backslash symbol is defined as Unicode U+2216. The set difference is therefore equivalent to the ...

A set of plane measure 0 that contains a circle of every radius.

The index set for the collection of submodules in a graded module.

The continuous image of a Polish space, also called an analytic set.

A set S in a vector space over R is called a convex set if the line segment joining any pair of points of S lies entirely in S.

A group set is a set whose elements are acted on by a group. If the group G acts on the set S, then S is called a G-set. Let G be a group and let S be a G-set. Then for every ...

A totally ordered set (A,<=) is said to be well ordered (or have a well-founded order) iff every nonempty subset of A has a least element (Ciesielski 1997, p. 38; Moore 1982, ...

A set function is a function whose domain is a collection of sets. In many instances in real analysis, a set function is a function which associates an affinely extended real ...