Search Results for ""

A wide variety of large numbers crop up in mathematics. Some are contrived, but some actually arise in proofs. Often, it is possible to prove existence theorems by deriving ...

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

The mathematical study of combinatorial objects in which a certain degree of order must occur as the scale of the object becomes large. Ramsey theory is named after Frank ...

The field of semidefinite programming (SDP) or semidefinite optimization (SDO) deals with optimization problems over symmetric positive semidefinite matrix variables with ...

The simple process of voting leads to surprisingly counterintuitive paradoxes. For example, if three people vote for three candidates, giving the rankings A, B, C; B, C, A; ...

R(X_1,...X_n)=sum_(i=1)^nH(X_i)-H(X_1,...,X_n), where H(x_i) is the entropy and H(X_1,...,X_n) is the joint entropy. Linear redundancy is defined as ...

Given a marked point process Phi of the form Phi=(T,Y)=((T_n)_(n>=1),(Y_n)_(n>=1)), the space Y=(Y_n)_(n>=1) is said to be the mark space of Phi.

A moving average may generate an irregular oscillation even if none exists in the original data.

A moving average using 15 points having weights -3, -6, -5, 3, 21, 46, 67, 74, 67, 46, 21, 3, -5, -6, and -3. It is sometimes used by actuaries.

Variables x_i and x_j are said to be uncorrelated if their covariance is zero: cov(x_i,x_j)=0. Independent statistics are always uncorrelated, but the converse is not ...