Search Results for ""

The Fourier sine transform is the imaginary part of the full complex Fourier transform, F_x^((s))[f(x)](k) = I[F_x[f(x)](k)] (1) = int_(-infty)^inftysin(2pikx)f(x)dx. (2) The ...

A subset G subset R of the real numbers is said to be a G_delta set provided G is the countable intersection of open sets. The name G_delta comes from German: The G stands ...

If T is a set of axioms in a first-order language, and a statement p holds for any structure M satisfying T, then p can be formally deduced from T in some appropriately ...

Let (a)_i be a sequence of complex numbers and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as f_(nk)=(product_(j=k)^(n-1)(a_j+k))/((n-k)!) and ...

A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...

The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...

Any locally compact Hausdorff topological group has a unique (up to scalars) nonzero left invariant measure which is finite on compact sets. If the group is Abelian or ...

A square matrix with constant skew diagonals. In other words, a Hankel matrix is a matrix in which the (i,j)th entry depends only on the sum i+j. Such matrices are sometimes ...

A tiling consisting of a rhombus such that 17 rhombuses fit around a point and a second tile in the shape of six rhombuses stuck together. These two tiles can fill the plane ...

A connected labeled graph with n graph edges in which all graph vertices can be labeled with distinct integers (mod n) so that the sums of the pairs of numbers at the ends of ...