Searches , social queries for DISJOINT
Search references for DISJOINT. Phrases containing DISJOINT
See searches and references containing DISJOINT!
Search references for DISJOINT. Phrases containing DISJOINT
See searches and references containing DISJOINT!DISJOINT
Sets with no element in common
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
Disjoint_sets
In mathematics, operation on sets
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
Disjoint_union
Topics referred to by the same term
Look up disjoint in Wiktionary, the free dictionary. Disjoint may refer to: Disjoint sets, sets with no common elements Mutual exclusivity, the impossibility
Disjoint
Data structure for storing non-overlapping sets
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)
Disjoint-set_data_structure
Binary operation combining the vertex and edge sets of two graphs
theory, 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
Disjoint_union_of_graphs
Mathematical concept
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}
Lattice_disjoint
Two sets with a small overlap
almost disjoint if their intersection is small in some sense; different definitions of "small" will result in different definitions of "almost disjoint". The
Almost_disjoint_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
Vertex_cycle_cover
Mathematical term
equipping the disjoint union of the underlying sets with a natural topology called the disjoint union topology. Roughly speaking, in the disjoint union the
Disjoint_union_(topology)
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 ⊗
Linear_disjointness
On the existence of hyperplanes separating disjoint convex sets
In geometry, the hyperplane separation theorem is a theorem about disjoint convex sets in n-dimensional Euclidean space. There are several rather similar
Hyperplane_separation_theorem
Type of topological space
mathematics, a normal space is a topological space in which any two disjoint closed sets have disjoint open neighborhoods. Such spaces need not be Hausdorff in general
Normal_space
Algorithm for two disjoint paths in a graph
network routing, Suurballe's algorithm is an algorithm for finding two disjoint paths in a nonnegatively-weighted directed graph, so that both paths connect
Suurballe's_algorithm
Largest open subset of some given set
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
Interior_(topology)
Axioms in topology defining notions of "separation"
separation axioms are about the use of topological means to distinguish disjoint sets and distinct points. It's not enough for elements of a topological
Separation_axiom
Four-dimensional analog of the dodecahedron
hull of 25 disjoint 24-cells. Each 24-cell is the convex hull of 3 disjoint (8-point) 16-cells, so the 120-cell is the convex hull of 75 disjoint 16-cells
120-cell
Theorem in graph theory
graph, the size of a minimum cut set is equal to the maximum number of disjoint paths that can be found between any pair of vertices. Proved by Karl Menger
Menger's_theorem
Concept in model theory
structures has the strong amalgamation property (SAP), also called the disjoint amalgamation property (DAP), if for every amalgam with A,B,C ∈ K there
Amalgamation_property
Combinatorial and geometric result used in measure theory of Euclidean spaces
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
Vitali_covering_lemma
laminar set family is a set family in which each pair of sets are either disjoint or related by containment. Formally, a set family F = { S 1 , S 2 , … }
Laminar_set_family
Category of positional games
partition the elements of X (or a subset of them) into a set of pairwise-disjoint pairs. Under certain conditions, a player can win using the following greedy
Maker-Breaker_game
Category-theoretic construction
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
Coproduct
Sets whose elements have degrees of membership
Fuzzy sets are disjoint if and only if their supports are disjoint according to the standard definition for crisp sets. For disjoint fuzzy sets A , B
Fuzzy_set
Concept in computational geometry
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
Maximum_disjoint_set
Algebraic structure of set algebra
want the size of the union of disjoint sets to be the sum of their individual sizes, even for an infinite sequence of disjoint sets. One would like to assign
Σ-algebra
Topological space that is connected
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
Connected_space
Four-dimensional analog of the icosahedron
The 600-cell can be partitioned into five disjoint 24-cells (10 different ways), and also into 24 disjoint pentagons (inscribed in the 12 Clifford parallel
600-cell
Graph representing edges of another graph
extension to disconnected graphs would require that the graph is not a disjoint union of C3. More generally, a graph G is said to be a line perfect graph
Line_graph
Set of elements common to all of some sets
disjoint, while the set of even numbers intersects the set of multiples of 3 at the multiples of 6. two parallel lines in the same plane are disjoint
Intersection_(set_theory)
Graph formed by complementation and disjoint union
and disjoint union. That is, the family of cographs is the smallest class of graphs that includes K1 and is closed under complementation and disjoint union
Cograph
Type of relation for subsets of a topological space
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
Separated_sets
Characterization of normal spaces by continuous functions
that states that a topological space is normal if and only if any two disjoint closed subsets can be separated by a continuous function. Urysohn's lemma
Urysohn's_lemma
Way to join two given mathematical manifolds together
Now obtain M 1 # M 2 {\displaystyle M_{1}\mathbin {\#} M_{2}} from the disjoint sum ( M 1 − i 1 ( 0 ) ) ⊔ ( M 2 − i 2 ( 0 ) ) {\displaystyle (M_{1}-i_{1}(0))\sqcup
Connected_sum
For 2 disjoint analytic subsets of Polish space, there is a Borel set containing only one
mathematical logic, Lusin's separation theorem states that if A and B are disjoint analytic subsets of Polish space, then there is a Borel set C in the space
Lusin's_separation_theorem
Topological invariant in mathematics
characteristic of their disjoint union is the sum of their Euler characteristics, since homology is additive under disjoint union: χ ( M ⊔ N ) = χ (
Euler_characteristic
Partition of a graph's nodes into 2 disjoint subsets
graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have one endpoint
Cut_(graph_theory)
Collection of mathematical objects
distinct in the disjoint union. This is obtained by labelling the elements by the indexes of the set they are coming from. The disjoint union of two sets
Set_(mathematics)
Disjoint, equal-size subsets of a group's underlying set
subgroup H of a group G may be used to decompose the underlying set of G into disjoint, equal-size subsets called cosets. There are left cosets and right cosets
Coset
Division of an entire space into ≥2 disjoint subsets
dividing an entire space (usually a Euclidean space) into two or more disjoint subsets (see also partition of a set). In other words, space partitioning
Space_partitioning
Abstraction of disjoint paths in directed graphs
of matroid, describing sets of vertices that can be reached by vertex-disjoint paths in a directed graph. The concept of a gammoid was introduced and
Gammoid
Family closed under unions and relative complements
1 n C i {\displaystyle A\setminus B=\bigcup _{i=1}^{n}C_{i}} for some disjoint C 1 , … , C n ∈ S . {\displaystyle C_{1},\ldots ,C_{n}\in {\mathcal {S}}
Ring_of_sets
into non-disjoint and disjoint by the shape of their two non-bonding molecular orbitals (NBMOs). Both NBMOs of molecules with non-disjoint characteristics
Non-Kekulé_molecule
Family closed under complements and countable disjoint unions
unions of pairwise disjoint sets: if A 1 , A 2 , A 3 , … {\displaystyle A_{1},A_{2},A_{3},\ldots } is a sequence of pairwise disjoint sets in D {\displaystyle
Dynkin_system
Maximum number of disjoint dominating sets
E ) {\displaystyle G=(V,E)} is a partition of V {\displaystyle V} into disjoint sets V 1 {\displaystyle V_{1}} , V 2 {\displaystyle V_{2}} ,..., V K {\displaystyle
Domatic_number
Generalization of mass, length, area and volume
{ E k } k = 1 ∞ {\displaystyle \{E_{k}\}_{k=1}^{\infty }} of pairwise disjoint sets in Σ {\displaystyle \Sigma } , μ ( ⋃ k = 1 ∞ E k ) = ∑ k = 1 ∞ μ (
Measure_(mathematics)
Topological spaces whose union is a boundary
a manifold. Two manifolds of the same dimension are cobordant if their disjoint union is the boundary of a compact manifold one dimension higher. The boundary
Cobordism
Tree representation of the abstract syntactic structure of source code
A r i t y ( S ) {\displaystyle \mathrm {Arity} (S)} -indexed family of disjoint sets of operators. If o {\displaystyle o} is an operator arity ( s 1 ,
Abstract_syntax_tree
to the disjoint-set data structure. Thus, Tarjan and La Poutré used this model to prove lower bounds on the amortized complexity of a disjoint-set data
Pointer_algorithm
Mapping function
mapping sets to numbers, with the property that its value on a union of two disjoint sets equals the sum of its values on these sets, namely, μ ( A ∪ B ) =
Sigma-additive_set_function
Topology in mathematics
space is a sub-Stonean space, i.e., any two open σ-compact disjoint subsets have disjoint compact closures. Corona theorem Corona algebra, a non-commutative
Stone–Čech_remainder
have no vertices in common, the cover is called vertex-disjoint or sometimes simply disjoint cycle cover. In this case, the set of the cycles constitutes
Edge_cycle_cover
Certain dynamical systems will eventually return to (or approximate) their initial state
\dots } must all be mutually disjoint. Because T {\displaystyle T} is a measure-preserving transformation, all of these disjoint sets must have the exact
Poincaré_recurrence_theorem
Operation that combines two graphs
E_{1})} and G 2 = ( V 2 , E 2 ) {\displaystyle G_{2}=(V_{2},E_{2})} be two disjoint graphs. The join G 1 + G 2 {\displaystyle G_{1}+G_{2}} is a graph with:
Join_(graph_theory)
Mathematical property of a space
points have disjoint neighbourhoods. T2 spaces are always T1. T2½ or Urysohn. A space is Urysohn if every two distinct points have disjoint closed neighbourhoods
Topological_property
Operation in topology
{\displaystyle A\star B} , is a topological space formed by taking the disjoint union of the two spaces, and attaching line segments joining every point
Join_(topology)
Infinite set not splittable into infinite sets
In set theory, an amorphous set is an infinite set that is not the disjoint union of two infinite subsets. Amorphous sets cannot exist if the axiom of
Amorphous_set
Bound on eigenvalues
other two radii) covers all three eigenvalues. If one of the discs is disjoint from the others then it contains exactly one eigenvalue. If however it
Gershgorin_circle_theorem
Solved conjecture in graph theory
Alspach's conjecture is a mathematical theorem that characterizes the disjoint cycle covers of complete graphs with prescribed cycle lengths. It is named
Alspach's_conjecture
Sequence of edges which join a sequence of vertices on a given graph
edge-independent (or edge-disjoint) if they do not have any edge in common. Two internally disjoint paths are edge-disjoint, but the converse is not necessarily
Path_(graph_theory)
Type of topological space
σ-compact. A manifold need not be connected, but every manifold M is a disjoint union of connected manifolds. These are just the connected components of
Topological_manifold
Partially ordered vector space, ordered as a lattice
}}y} in a vector lattice X {\displaystyle X} are said to be lattice disjoint or disjoint if inf { | x | , | y | } = 0 , {\displaystyle \inf\{|x|,|y|\}=0,}
Riesz_space
Problem in computer science
the set packing problem asks if some k subsets in the list are pairwise disjoint (in other words, no two of them share an element). More formally, given
Set_packing
Procedures for constructing new graphs in graph theory
two definitions. In the most common one, the disjoint union of graphs, the union is assumed to be disjoint. Less commonly (though more consistent with
Graph_operations
Mathematical concept for comparing objects
Each equivalence relation provides a partition of the underlying set into disjoint equivalence classes. Two elements of the given set are equivalent to each
Equivalence_relation
portions, using a carving knife or meat-slicing machine. A meat carver disjoints the meat and slices in uniform portions. Meat carving is sometimes considered
Meat_carving
Elements in exactly one of two sets
occurs if and only if A {\displaystyle A} and B {\displaystyle B} are disjoint sets. Furthermore, denoting D = A Δ B {\displaystyle D=A\mathbin {\Delta
Symmetric_difference
Collection of sets in which every two sets have the same intersection
subsets, then it is vacuously a sunflower. If W {\displaystyle W} contains disjoint subsets, then it is a sunflower, with an empty kernel. The study of sunflowers
Sunflower_(mathematics)
Type of topological space
or separated space, is a topological space where distinct points have disjoint neighbourhoods. Of the many separation axioms that can be imposed on a
Hausdorff_space
Counting principle in combinatorics
actions. In mathematical terms, the addition principle states that, for disjoint sets A and B, we have | A ∪ B | = | A | + | B | {\displaystyle |A\cup B|=|A|+|B|}
Addition_principle
Graph formed from disjoint paths
forest is a kind of forest where each component is a path graph, or a disjoint union of nontrivial paths. Equivalently, it is an acyclic and claw-free
Linear_forest
Topological model
Equals, Contains, Covers, CoveredBy, Intersects, Within Anti-reflexive: Disjoint Symmetric: Equals, Intersects, Crosses, Touches, Overlaps Transitive: Equals
DE-9IM
Points with no three in a line
of Z 3 4 {\displaystyle \mathbb {Z} _{3}^{4}} can be partitioned into disjoint cap sets. They reported that it is possible to use four different cap sets
Cap_set
Measure of graph complexity
operations : Creation of a new vertex v with label i (denoted by i(v)) Disjoint union of two labeled graphs G and H (denoted by G ⊕ H {\displaystyle G\oplus
Clique-width
Function from sets to numbers
\left(\textstyle \bigcup \limits _{i=1}^{n}F_{i}\right)} for all pairwise disjoint finite sequences F 1 , … , F n ∈ F {\displaystyle F_{1},\ldots ,F_{n}\in
Set_function
Positional game strategy
force a draw. It is based on dividing the positions on the game-board into disjoint pairs. Whenever the opponent picks a position in a pair, the player picks
Pairing_strategy
Property in descriptive set theory
any closed subset of X {\displaystyle X} can be written uniquely as the disjoint union of a perfect set and a countable set. In particular, every uncountable
Perfect_set_property
Set disjoint from its sumset with itself
A of an abelian group G is said to be sum-free if the sumset A + A is disjoint from A. In other words, A is sum-free if the equation a + b = c {\displaystyle
Sum-free_set
Minimum spanning forest algorithm that greedily adds edges
form a cycle. The key steps of the algorithm are sorting and the use of a disjoint-set data structure to detect cycles. Its running time is dominated by the
Kruskal's_algorithm
Concept in point-set topology
p. If a continuum is indecomposable, then its composants are pairwise disjoint. The composants of a continuum are dense in that continuum. Solecki, Sławomir
Composant
Undirected, connected, and acyclic graph
one path, or equivalently an acyclic undirected graph, or equivalently a disjoint union of trees. A directed tree, oriented tree, polytree, or singly connected
Tree_(graph_theory)
Partition of a graph into spanning subgraphs
subgraph, and a k-factorization partitions the edges of the graph into disjoint k-factors. A graph G is said to be k-factorable if it admits a k-factorization
Graph_factorization
Theorem on edge-disjoint spanning trees
describes how many edge-disjoint spanning trees (and more generally forests) a graph can have: A graph G has t edge-disjoint spanning trees iff for every
Nash-Williams_theorem
Graph whose vertices correspond to combinations of a set of n elements
two vertices are adjacent if and only if the two corresponding sets are disjoint. Kneser graphs are named after Martin Kneser, who first investigated them
Kneser_graph
Partition of a graph by removing fewest possible edges
min-cut of a graph is a cut (a partition of the vertices of a graph into two disjoint subsets) that is minimal in some metric. In the simplest unweighted min-cut
Minimum_cut
Measure of total value one, generalizing probability distributions
additivity property says that the probability assigned to the union of two disjoint (mutually exclusive) events by the measure should be the sum of the probabilities
Probability_measure
Axiom of set theory
theory that states that every non-empty set A contains an element that is disjoint from A. In first-order logic, the axiom reads: ∀ x ( x ≠ ∅ → ( ∃ y ∈ x
Axiom_of_regularity
Gur language of Northern Ghana
phrasal categories including tense, aspect, negation, mood and the conjoint/disjoint paradigm. Dawuni Dawuni kú-r-í kill-IPFV-CONJ sòònsí rabbits máá. DEF Dawuni
Dagbani_language
Causal relationships between points in a manifold
tangent vectors at each point in the manifold can be classified into three disjoint types. A tangent vector X {\displaystyle X} is: timelike if g ( X , X )
Causal_structure
Concept in topology
as the disjoint union of a perfect set and a countable set. Moreover, if X {\displaystyle X} is uncountable, it can be written as the disjoint union of
Polish_space
Operations on ordinals that extend classical arithmetic
significant position first. Effectively, each element of T is replaced by a disjoint copy of S. The order-type of the Cartesian product is the ordinal that
Ordinal_arithmetic
be written as the union of two proper closed subsets (whether disjoint or non-disjoint). The name irreducible space is preferred in algebraic geometry
Hyperconnected_space
Topics referred to by the same term
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
Connected_component
Discrete probability distribution
at all times of day. If the number of calls received in any two given disjoint time intervals is independent, then the number k of calls received during
Poisson_distribution
Problems which attempt to find the most efficient way to pack objects into containers
degrees on each axis. The problem of finding the smallest ball such that k disjoint open unit balls may be packed inside it has a simple and complete answer
Packing_problems
Set of hyperedges where every pair is disjoint
a hypergraph is a set of hyperedges, in which every two hyperedges are disjoint. It is an extension of the notion of matching in a graph. Recall that a
Matching_in_hypergraphs
function is a set function whose value when applied to the union of two disjoint sets is greater than or equal to the sum of values of the function applied
Superadditive_set_function
Mathematical concept
limits. The dual notion of a colimit generalizes constructions such as disjoint unions, direct sums, coproducts, pushouts and direct limits. Limits and
Limit_(category_theory)
Maximal subgraph whose vertices can reach each other
connected subgraph. The components of any graph partition its vertices into disjoint sets, and are the induced subgraphs of those sets. A graph that is itself
Component_(graph_theory)
Topics referred to by the same term
Mexico, where the Hawikuh Ruins are located The Cibola National Forest, a disjoint forest stretching from New Mexico to Oklahoma, including parts of Cibola
Cibola
Type of (mathematical) permutation with no fixed element
permutation can be expressed as the product of disjoint cycles (more precisely: cycles with disjoint orbits); such cycles commute with each other, and
Cyclic_permutation
travel, tourism, insurance
DISJOINT
DISJOINT
DISJOINT
DISJOINT
DISJOINT
DISJOINT
DISJOINT
DISJOINT
DISJOINT
travel, tourism, insurance