Search Results for ""

The cotree T^* of a spanning tree T in a connected graph G is the spacing subgraph of G containing exactly those edges of G which are not in T (Harary 1994, p. 39).

The Coulomb wave function is a special case of the confluent hypergeometric function of the first kind. It gives the solution to the radial Schrödinger equation in the ...

The largest n such that |z_n|<4 in a Mandelbrot set. Points of different count are often assigned different colors.

A set function mu possesses countable additivity if, given any countable disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union ...

For a countable set of n disjoint events E_1, E_2, ..., E_n P( union _(i=1)^nE_i)=sum_(i=1)^nP(E_i).

Let X be a set and S a collection of subsets of X. A set function mu:S->[0,infty] is said to possess countable monotonicity provided that, whenever a set E in S is covered by ...

A countable set is a set that is either finite or denumerable. However, some authors (e.g., Ciesielski 1997, p. 64) use the definition "equipollent to the finite ordinals," ...

A set function mu is said to possess countable subadditivity if, given any countable disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union ...

Any set which can be put in a one-to-one correspondence with the natural numbers (or integers) so that a prescription can be given for identifying its members one at a time ...

A counterexample is a form of counter proof. Given a hypothesis stating that F(x) is true for all x in S, show that there exists a b in S such that F(b) is false, ...