Search results

Look up disjoint in Wiktionary, the free dictionary. Disjoint may refer to: Disjoint sets, sets with no common elements Mutual exclusivity, the impossibility...

formal logic, two sets are said to be disjoint sets if they have no element in common. Equivalently, two disjoint sets are sets whose intersection is the...

In mathematics, the disjoint union (or discriminated union) A ⊔ B {\displaystyle A\sqcup B} of the sets A and B is the set formed from the elements of...

equipping the disjoint union of the underlying sets with a natural topology called the disjoint union topology. Roughly speaking, in the disjoint union the...

a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that stores a collection of disjoint (non-overlapping)...

almost disjoint if their intersection is small in some sense; different definitions of "small" will result in different definitions of "almost disjoint". The...

field extension Ω {\displaystyle \Omega } of k are said to be linearly disjoint over k if the following equivalent conditions are met: (i) The map A ⊗...

mathematics, the disjoint union of graphs is an operation that combines two or more graphs to form a larger graph. It is analogous to the disjoint union of sets...

called edge-disjoint or simply disjoint cycle cover. Similar definitions exist for digraphs, in terms of directed cycles. Finding a vertex-disjoint cycle cover...

analysis, two elements x and y of a vector lattice X are lattice disjoint or simply disjoint if inf { | x | , | y | } = 0 {\displaystyle \inf \left\{|x|,|y|\right\}=0}...

topological space X that satisfies Axiom T4: every two disjoint closed sets of X have disjoint open neighborhoods. A normal Hausdorff space is also called...

In computational geometry, a maximum disjoint set (MDS) is a largest set of non-overlapping geometric shapes selected from a given set of candidate shapes...

topological space that cannot be represented as the union of two or more disjoint non-empty open subsets. Connectedness is one of the principal topological...

separated. A most basic way in which two sets can be separated is if they are disjoint, that is, if their intersection is the empty set. This property has nothing...

In geometry, the hyperplane separation theorem is a theorem about disjoint convex sets in n-dimensional Euclidean space. There are several rather similar...

largest open set disjoint from S , {\displaystyle S,} namely, it is the union of all open sets in X {\displaystyle X} that are disjoint from S . {\displaystyle...

structures has the strong amalgamation property (SAP), also called the disjoint amalgamation property (DAP), if for every amalgam with A,B,C ∈ K there...

subset of a topological space that cannot be covered by the union of two disjoint non-empty open sets Connected-component labeling, an algorithm for finding...

or categorical sum, is a construction which includes as examples the disjoint union of sets and of topological spaces, the free product of groups, and...

to cover, up to a Lebesgue-negligible set, a given subset E of Rd by a disjoint family extracted from a Vitali covering of E. There are two basic versions...