Search Results for ""

A sequence of real numbers {x_n} is equidistributed on an interval [a,b] if the probability of finding x_n in any subinterval is proportional to the subinterval length. The ...

A graph G on more than two vertices is said to be k-connected (or k-vertex connected, or k-point connected) if there does not exist a vertex cut of size k-1 whose removal ...

A fractal which can be constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[0 1 0; 1 1 1; 0 1 0],1->[1 1 1; 1 1 1; 1 1 1]}. (1) The size ...

Two or more lines are said to be concurrent if they intersect in a single point. Two lines concur if their trilinear coordinates satisfy |l_1 m_1 n_1; l_2 m_2 n_2; l_3 m_3 ...

Consider a symmetric triangle wave T(x) of period 2L. Since the function is odd, a_0 = 0 (1) a_n = 0, (2) and b_n = (3) = (32)/(pi^2n^2)cos(1/4npi)sin^3(1/4npi) (4) = ...

A second-order ordinary differential equation arising in the study of stellar interiors, also called the polytropic differential equations. It is given by ...

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 n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...

Let P be a finite partially ordered set, then an antichain in P is a set of pairwise incomparable elements. Antichains are also called Sperner systems in older literature ...

A subset B of a vector space E is said to be absorbing if for any x in E, there exists a scalar lambda>0 such that x in muB for all mu in F with |mu|>=lambda, where F is the ...