Search Results for ""

The bias of a series is defined as Q[a_i,a_(i+1),a_(i+2)]=(a_ia_(i+2)-a_(i+1)^2)/(a_ia_(i+1)a_(i+2)). A series is geometric iff Q=0. A series is artistic iff the bias is ...

Let A be a unital C^*-algebra. An element u in A is called unitary if u^*u=uu^*=1. For example, for each self-adjoint element a in A, the element ...

The partial differential equation u_t=(1+ia)u_(xx)+(1+ic)u-(1+id)|u|^2u.

A sequence of n 0s and 1s is called an odd sequence if each of the n sums sum_(i=1)^(n-k)a_ia_(i+k) for k=0, 1, ..., n-1 is odd.

A plot of the cells on a grid satisfying bitwise XOR(a,b)<n for consecutive values of n=1, 2, .... It is thought that it was discovered by Jackson Wright on the RLE PDP-1 ...

Let T(x,y,z) be the number of times "otherwise" is called in the TAK function, then the Takeuchi numbers are defined by T_n(n,0,n+1). A recursive formula for T_n is given by ...

If A is a normed algebra, a net {e_i} in A is called an approximate identity for A if sup_(i)|e_i|<infty and if for each a in A, e_ia->a and ae_i->a. Though this definition ...

An infinite sequence {a_i} of positive integers is called strongly independent if any relation sumepsilon_ia_i, with epsilon_i=0, +/-1, or +/-2 and epsilon_i=0 except ...

An infinite sequence {a_i} of positive integers is called weakly independent if any relation sumepsilon_ia_i with epsilon_i=0 or +/-1 and epsilon_i=0, except finitely often, ...

A genetic algorithm is a class of adaptive stochastic optimization algorithms involving search and optimization. Genetic algorithms were first used by Holland (1975). The ...