Search Results for ""
691 - 700 of 2376 for onnected Dominating SetSearch Results
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 ...
The partial order width of a set P is equal to the minimum number of chains needed to cover P. Equivalently, if a set P of ab+1 elements is partially ordered, then P contains ...
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 k-subset is a subset of a set on n elements containing exactly k elements. The number of k-subsets on n elements is therefore given by the binomial coefficient (n; k). For ...
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 ...
The free module of rank n over a nonzero unit ring R, usually denoted R^n, is the set of all sequences {a_1,a_2,...,a_n} that can be formed by picking n (not necessarily ...
An irrational number is a number that cannot be expressed as a fraction p/q for any integers p and q. Irrational numbers have decimal expansions that neither terminate nor ...
A metric space is a set S with a global distance function (the metric g) that, for every two points x,y in S, gives the distance between them as a nonnegative real number ...
A real-valued function g defined on a convex subset C subset R^n is said to be quasi-concave if for all real alpha in R, the set {x in C:g(x)>=alpha} is convex. This is ...
...
View search results from all Wolfram sites (33238 matches)

