Search Results for ""
61 - 70 of 3259 for Partially Ordered SetSearch Results
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 structure consisting of an ordered set of sorted lists such that the head and tail entries of later lists nest within earlier ones. For example, an encroaching list set for ...
A set of plane measure 0 that contains a circle of every radius.
In a complete metric space, a countable union of nowhere dense sets is said to be meager; the complement of such a set is a residual set.
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 ...
...
View search results from all Wolfram sites (36822 matches)

