Search Results for ""

Define T as the set of all points t with probabilities P(x) such that a>t=>P(a<=x<=a+da)<P_0 or a<t=>P(a<=x<=a+da)<P_0, where P_0 is a point probability (often, the ...

Let X be an alphabet (i.e., a finite and nonempty set), and call its member letters. A word on X is a finite sequence of letters a_1...a_n, where a_1,...,a_n in X. Denote the ...

A set of orthogonal functions {phi_n(x)} is termed complete in the closed interval x in [a,b] if, for every piecewise continuous function f(x) in the interval, the minimum ...

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 connected graph G of graph diameter d, the distance-k graph G_k for k=1, ..., d is a graph with the same vertex set and having edge set consisting of the pairs of ...

A knot invariant is a function from the set of all knots to any other set such that the function does not change as the knot is changed (up to isotopy). In other words, a ...

A perfect ruler also called a complete ruler, is type of ruler considered by Guy (1994) which has k distinct marks spaced such that the distances between marks can be used to ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

For n points in the plane, there are at least N_1=sqrt(n-3/4)-1/2 different distances. The minimum distance can occur only <=3n-6 times, and the maximum distance can occur ...

A subset {v_1,...,v_k} of a vector space V, with the inner product <,>, is called orthonormal if <v_i,v_j>=0 when i!=j. That is, the vectors are mutually perpendicular. ...