Search Results for ""

The Farey sequence F_n for any positive integer n is the set of irreducible rational numbers a/b with 0<=a<=b<=n and (a,b)=1 arranged in increasing order. The first few are ...

Let A be a matrix and x and b vectors. Then the system Ax=b, x>=0 has no solution iff the system A^(T)y>=0, b^(T)y<0 has a solution, where y is a vector (Fang and Puthenpura ...

For a general second-order linear recurrence equation f_(n+1)=xf_n+yf_(n-1), (1) define a multiplication rule on ordered pairs by (A,B)(C,D)=(AD+BC+xAC,BD+yAC). (2) The ...

The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2N^2 to 2NlgN, where lg is the ...

An efficient version of the Walsh transform that requires O(nlnn) operations instead of the n^2 required for a direct Walsh transform (Wolfram 2002, p. 1072).

A Cantor set with Lebesgue measure greater than 0.

Fatou dust is a Fatou set for a point outside the underlying set. Such a set has zero area and has an infinite number of disconnected components.

A Julia set J consisting of a set of isolated points which is formed by taking a point outside an underlying set M (e.g., the Mandelbrot set). If the point is outside but ...

If {f_n} is a sequence of nonnegative measurable functions, then intlim inf_(n->infty)f_ndmu<=lim inf_(n->infty)intf_ndmu. (1) An example of a sequence of functions for which ...

Let f(theta) be Lebesgue integrable and let f(r,theta)=1/(2pi)int_(-pi)^pif(t)(1-r^2)/(1-2rcos(t-theta)+r^2)dt (1) be the corresponding Poisson integral. Then almost ...