Search Results for ""

A binary Hamming code H_r of length n=2^r-1 (with r>=2) is a linear code with parity-check matrix H whose columns consist of all nonzero binary vectors of length r, each used ...

The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.

J_m(x)=(x^m)/(2^(m-1)sqrt(pi)Gamma(m+1/2))int_0^1cos(xt)(1-t^2)^(m-1/2)dt, where J_m(x) is a Bessel function of the first kind and Gamma(z) is the gamma function. Hankel's ...

An addition chain for which there is a subset H of members such that each member of the chain uses the largest element of H which is less than the member.

A number n for which a shortest chain exists (which is also a Hansen chain) is called a Hansen number.

Hansen's problem is a problem in surveying described as follows. From the position of two known but inaccessible points A and B, determine the position of two unknown ...

A perspective collineation with center O and axis o not incident is called a geometric homology. A geometric homology is said to be harmonic if the points A and A^' on a line ...

Let D=D(z_0,R) be an open disk, and let u be a harmonic function on D such that u(z)>=0 for all z in D. Then for all z in D, we have 0<=u(z)<=(R/(R-|z-z_0|))^2u(z_0).

Let u_1<=u_2<=... be harmonic functions on a connected open set U subset= C. Then either u_j->infty uniformly on compact sets or there is a finite-values harmonic function u ...

The partial differential equation u_t=u_(xxx)u^3.