Search Results for ""

Frequency representation is the notation (1^(a_1)2^(a_2)...) used to abbreviate a partition {1,...,1_()_(a_1),2,...,2_()_(a_2),...} (Andrews 1998, p. 1).

Let t be an infinite word over a finite alphabet Sigma. Then there exists a uniformly recurrent infinite word r such that Sub(r) subset= Sub(t), where Sub(w) is the set of ...

The computer animation format MPEG-7 uses Gabor functions to specify texture descriptors.

V_t=e^(-ytau)S_tN(d_1)-e^(-rtau)KN(d_2), where N is the cumulative normal distribution and d_1,d_2=(log((S_t)/K)+(r-y+/-1/2sigma^2)tau)/(sigmasqrt(tau)). If y=0, this is the ...

For even h, (1) (Nagell 1951, p. 176). Writing out symbolically, sum_(n=0)^h((-1)^nproduct_(k=0)^(n-1)(1-x^(h-k)))/(product_(k=1)^(n)(1-x^k))=product_(k=0)^(h/2-1)1-x^(2k+1), ...

The Gelfand-Naimark theorem states that each C^*-algebra is isometrically *-isomorphic to a closed *-subalgebra of the algebra B(H) consisting of all bounded operators acting ...

If A is a unital Banach algebra where every nonzero element is invertible, then A is the algebra of complex numbers.

The proposition that every consistent generalized theory has a model. The theorem is true if the axiom of choice is assumed.

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...