disjoint union


Also found in: Wikipedia.

disjoint union

In domain theory, a union (or sum) which results in a domain without a least element.
References in periodicals archive ?
2]) [union] {(u, v) [member of] V(G): u [member of] C(i), [upsilon] [member of] C(j)}, which connects in the disjoint union all vertices in C(i) with all vertices in C(j).
However, the two are interdefinable with the help of disjoint union.
alpha]] G is commutative; (ii) G is the disjoint union of the monoids [G.
If A is commutative, G a disjoint union of abelian monoids and [alpha] is symmetric, then the commutant of A in A [[?
i] is a finite disjoint union of compacts with Jordan boundary, and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.
2) There exists nonempty disjoint topological spaces Y and Z such that X = Y [union] Z and X is topological disjoint union of Y and Z, i.
1] can be expressed as a disjoint union of a class C of countably infinite sets, the cardinality of C being [[omega].
Also, we proved that the disjoint union of all paths are skolem mean graph.
Our philosophy is to replace graphs with any notion of combinatorial objects which have operations analogous to disjoint union and taking induced subgraphs.
and X' + X" denotes the disjoint union of two copies of X.
c] is a disjoint union of three families corresponding to the schemes depicted in Fig.
greater than or equal to] k] is the disjoint union of [SEQ.