Search Results for ""

If it is possible to transform a coordinate system to a form where the metric elements g_(munu) are constants independent of x^mu, then the space is flat.

A region in a knot or link projection plane surrounded by a circle such that the knot or link crosses the circle exactly four times. Two tangles are equivalent if a sequence ...

The discrete Fourier transform of length N (where N is even) can be rewritten as the sum of two discrete Fourier transforms, each of length N/2. One is formed from the ...

A substitution which can be used to transform integrals involving square roots into a more tractable form. form substitution sqrt(x^2+a^2) x=asinhu sqrt(x^2-a^2) x=acoshu

The function K(alpha,t) in an integral or integral transform g(alpha)=int_a^bf(t)K(alpha,t)dt. Whittaker and Robinson (1967, p. 376) use the term nucleus for kernel.

Let f(t) and g(t) be arbitrary functions of time t with Fourier transforms. Take f(t) = F_nu^(-1)[F(nu)](t)=int_(-infty)^inftyF(nu)e^(2piinut)dnu (1) g(t) = ...

The even impulse pair is the Fourier transform of cos(pik), AdjustmentBox[I, BoxMargins -> {{0.13913, -0.13913}, {-0.5, 0.5}}]I(x)=1/2delta(x+1/2)+1/2delta(x-1/2). (1) It ...

Expresses a function in terms of its Radon transform, f(x,y) = R^(-1)(Rf)(x,y) (1) = ...

Any discrete finite wavelet transform can be represented as a matrix, and such a wavelet matrix can be computed in O(n) steps, compared to O(nlgn) for the Fourier matrix, ...

Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...