Search Results for ""

A graph with graph edges of two possible "colors," usually identified as red and blue. For a bichromatic graph with R red graph edges and B blue graph edges, R+B>=2.

If a_1>=a_2>=...>=a_n (1) b_1>=b_2>=...>=b_n, (2) then nsum_(k=1)^na_kb_k>=(sum_(k=1)^na_k)(sum_(k=1)^nb_k). (3) This is true for any distribution.

The point of concurrence S of a triangle's cleavers M_1C_1, M_2C_2, and M_3C_3, which is simply the Spieker center, i.e., the incenter of the medial triangle DeltaM_1M_2M_3 ...

The covercosine, also called the coversed cosine, is a little-used trigonometric function defined by covercos(z) = vercos(1/2pi-z) (1) = 1+sinz, (2) where vercosz is the ...

A generalization of the hypergeometric function identity (1) to the generalized hypergeometric function _3F_2(a,b,c;d,e;x). Darling's products are (2) and (3) which reduce to ...

The prime link 02-0201 which has Jones polynomial V(t)=-t-t^(-1) and HOMFLY polynomial P(z,alpha)=z^(-1)(alpha^(-1)-alpha^(-3))+zalpha^(-1). It has braid word sigma_1^2.

1000 bytes. Unfortunately, the term is sometimes also used to mean 2^(10)=1024 bytes. However, this usage is deprecated, and the term kibibyte is preferred for 1024 bytes.

Four bits or half a byte, also sometimes spelled "nybble." Since a nibble encodes values from 0 to 2^4-1=15, it can conveniently be represented using a single hexadecimal ...

A subspace A of X is called a retract of X if there is a continuous map f:X->X (called a retraction) such that for all x in X and all a in A, 1. f(x) in A, and 2. f(a)=a. ...

A class of area-preserving maps of the form theta_(i+1) = theta_i+2pialpha(r_i) (1) r_(i+1) = r_i, (2) which maps circles into circles but with a twist resulting from the ...