Search Results for ""
21 - 30 of 343 for UnionSearch Results

The Diophantine equation x^2+y^2+z^2=3xyz. The Markov numbers m are the union of the solutions (x,y,z) to this equation and are related to Lagrange numbers.
A subset E of a topological space S is said to be nonmeager if E is of second category in S, i.e., if E cannot be written as the countable union of subsets which are nowhere ...
The Reeb foliation of the hypersphere S^3 is a foliation constructed as the union of two solid tori with common boundary.
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.
A set partition of a set S is a collection of disjoint subsets of S whose union is S. The number of partitions of the set {k}_(k=1)^n is called a Bell number.
The space |K| which is the subset of R^n that is the union of the simplices in a simplicial complex K. The term polytope is sometimes used as a synonym for underlying space ...
The set of elements belonging to one but not both of two given sets. It is therefore the union of the complement of A with respect to B and B with respect to A, and ...
The n-wheel complement graph W^__n is the graph complement of the n-wheel graph. For n>4, W^__n is isomorphic to the graph disjoint union of a circulant graph ...
The concept of irredundance was introduced by Cockayne et al. (1978). Let N_G[v] denote the graph neighborhood of a vertex v in a graph G (including v itself), and let N_G[S] ...
Given a set X, let F be a nonempty set of subsets of X. Then F is a ring if, for every pair of sets in F, the intersection, union, and set difference is also in F. F is ...

...