Search Results for ""

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 ...

Let {f_n} and {a_n} be sequences with f_n>=f_(n+1)>0 for n=1, 2, ..., then |sum_(n=1)^ma_nf_n|<=Af_1, where A=max{|a_1|,|a_1+a_2|,...,|a_1+a_2+...+a_m|}.

Let |sum_(n=1)^pa_n|<K, (1) where K is independent of p. Then if f_n>=f_(n+1)>0 and lim_(n->infty)f_n=0, (2) it follows that sum_(n=1)^inftya_nf_n (3) converges.

Let f:R×R->R be a one-parameter family of C^3 maps satisfying f(0,0) = 0 (1) [(partialf)/(partialx)]_(mu=0,x=0) = -1 (2) [(partial^2f)/(partialx^2)]_(mu=0,x=0) < 0 (3) ...

Orthogonal polynomials associated with weighting function w(x) = pi^(-1/2)kexp(-k^2ln^2x) (1) = pi^(-1/2)kx^(-k^2lnx) (2) for x in (0,infty) and k>0. Defining ...

Find the maximum number of bishops B(n) that can be placed on an n×n chessboard such that no two attack each other. The answer is 2n-2 (Dudeney 1970, Madachy 1979), giving ...