TOPICS
Search

Search Results for ""


1001 - 1010 of 2903 for Minimum Total Dominating SetSearch Results
Let A and B be any sets with empty intersection, and let |X| denote the cardinal number of a set X. Then |A|+|B|=|A union B| (Ciesielski 1997, p. 68; Dauben 1990, p. 173; ...
For {M_i}_(i in I) a family of R-modules indexed by a directed set I, let sigma_(ij):M_i->M_j i<=j be an R-module homomorphism. Call (M_i,sigma_(ij)) a direct system over I ...
For {M_i}_(i in I) a family of R-modules indexed by a directed set I, let sigma_(ji):M_j->M_i i<=j be an R-module homomorphism. Call (M_i,sigma_(ji)) an inverse system over I ...
A set-like object in which order is ignored, but multiplicity is explicitly significant. Therefore, multisets {1,2,3} and {2,1,3} are equivalent, but {1,1,2,3} and {1,2,3} ...
A semiring is a set together with two binary operators S(+,*) satisfying the following conditions: 1. Additive associativity: For all a,b,c in S, (a+b)+c=a+(b+c), 2. Additive ...
The vertex count of a graph g, commonly denoted V(g) or |g|, is the number of vertices in g. In other words, it is the cardinality of the vertex set. The vertex count of a ...
If K is a simplicial complex, let V be the vertex set of K. Furthermore, let K be the collection of all subsets {a_0,...,a_n} of V such that the vertices a_0, ..., a_n span a ...
A species of structures is a rule F which 1. Produces, for each finite set U, a finite set F[U], 2. Produces, for each bijection sigma:U->V, a function F[sigma]:F[U]->F[V]. ...
Whitehead and Russell (1927) devised a hierarchy of "types" in order to eliminate self-referential statements from Principia Mathematica, which purported to derive all of ...
A Goldbach number is a positive integer that is the sum of two odd primes (Li 1999). Let E(x) (the "exceptional set of Goldbach numbers") denote the number of even numbers ...
1 ... 98|99|100|101|102|103|104 ... 291 Previous Next

...