TOPICS
Search

Search Results for ""


811 - 820 of 2557 for Complement Set,Search Results
The direct product of the rings R_gamma, for gamma some index set I, is the set product_(gamma in I)R_gamma={f:I-> union _(gamma in I)R_gamma|f(gamma) in R_gamma all gamma in ...
Suppose W is the set of all complex-valued functions f on the interval [0,2pi] of the form f(t)=sum_(k=-infty)^inftyalpha_ke^(ikt) (1) for t in [0,2pi], where the alpha_k in ...
A transition function describes the difference in the way an object is described in two separate, overlapping coordinate charts, where the description of the same set may ...
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 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 ...
1 ... 79|80|81|82|83|84|85 ... 256 Previous Next

...