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

The Fourier transform of a Gaussian function f(x)=e^(-ax^2) is given by F_x[e^(-ax^2)](k) = int_(-infty)^inftye^(-ax^2)e^(-2piikx)dx (1) = ...

The maximum possible weight of a fractional clique of a graph G is called the fractional clique number of G, denoted omega^*(G) (Godsil and Royle 2001, pp. 136-137) or ...

In 1750, Benjamin Franklin constructed the above 8×8 semimagic square having magic constant 260. Any half-row or half-column in this square totals 130, and the four corners ...

A graph G is fully reconstructible in C^d if the graph is determined from its d-dimensional measurement variety. If G is globally rigid in R^d on n>=d+2 vertices, then G is ...

Every polynomial equation having complex coefficients and degree >=1 has at least one complex root. This theorem was first proven by Gauss. It is equivalent to the statement ...

Consider h_+(d) proper equivalence classes of forms with discriminant d equal to the field discriminant, then they can be subdivided equally into 2^(r-1) genera of ...

Let p and q be partitions of a positive integer, then there exists a (0,1)-matrix A such that c(A)=p, r(A)=q iff q is dominated by p^*.

The Gall orthographic projection is a cylindrical equal-area projection with standard parallel of 45 degrees.

For a general two-player zero-sum game, max_(i<=m)min_(j<=n)a_(ij)<=min_(j<=n)max_(i<=m)a_(ij). If the two are equal, then write ...