Search Results for ""

The problem of forecasting future values X_(t+tau) (tau>0) of a weakly stationary process {X_t} from the known values X_s (s<=t).

A type of cryptography in which the encoding key is revealed without compromising the encoded message. The two best-known methods are the knapsack problem and RSA encryption.

The small world problem asks for the probability that two people picked at random have at least one acquaintance in common.

When can homology classes be realized as the image of fundamental classes of manifolds? The answer is known, and singular bordism groups provide insight into this problem.

Stanley and Wilf conjectured (Bona 1997, Arratia 1999), that for every permutation pattern sigma, there is a constant c(sigma)<infty such that for all n, ...

Let B_k be the kth Bernoulli number and consider nB_(n-1)=-1 (mod n), where the residues of fractions are taken in the usual way so as to yield integers, for which the ...

In algebra, a period is a number that can be written an integral of an algebraic function over an algebraic domain. More specifically, a period is a real number ...

A series of the form sum_(k=1)^infty(-1)^(k+1)a_k (1) or sum_(k=1)^infty(-1)^ka_k, (2) where a_k>0. A series with positive terms can be converted to an alternating series ...

A Barker code is a string of digits a_i=+/-1 of length l>=2 such that |sum_(i=1)^(l-k)a_ia_(i+k)|<=1 for all 1<=k<l. Barker codes are used for pulse compression of radar ...

Barnette's conjecture asserts that every 3-connected bipartite cubic planar graph is Hamiltonian. The only graph on nine or fewer vertices satisfying Barnette's conditions is ...