TOPICS
Search

Search Results for ""


8351 - 8360 of 13135 for Computational GeometrySearch Results
The categorical notion which is dual to product. The coproduct of a family {X_i}_(i in I) of objects of a category is an object C=coproduct_(i in I)X_i, together with a ...
Let {a_n} be a nonnegative sequence and f(x) a nonnegative integrable function. Define A_n = sum_(k=1)^(n)a_k (1) B_n = sum_(k=n)^(infty)a_k (2) and F(x) = int_0^xf(t)dt (3) ...
A graph is called cordial if it is possible to label its vertices with 0s and 1s so that when the edges are labeled with the difference of the labels at their endpoints, the ...
y approx m+sigmaw, (1) where w = (2) where h_1(x) = 1/6He_2(x) (3) h_2(x) = 1/(24)He_3(x) (4) h_(11)(x) = -1/(36)[2He_3(x)+He_1(x)] (5) h_3(x) = 1/(120)He_4(x) (6) h_(12)(x) ...
Correlation is the degree to which two or more quantities are linearly associated. In a two-dimensional plot, the degree of correlation between the values on the two axes is ...
For a subgroup H of a group G and an element x of G, define xH to be the set {xh:h in H} and Hx to be the set {hx:h in H}. A subset of G of the form xH for some x in G is ...
The cototient of a positive number n is defined as n-phi(n), where n is the totient function. It is therefore the number of positive integers <=n that have at least one prime ...
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 ...
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 ...
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 ...
1 ... 833|834|835|836|837|838|839 ... 1314 Previous Next

...