Search Results for ""

For any sequence of integers 0<n_1<...<n_k, there is a flag manifold of type (n_1, ..., n_k) which is the collection of ordered sets of vector subspaces of R^(n_k) (V_1, ..., ...

Let M^n be an n-manifold and let F={F_alpha} denote a partition of M^n into disjoint pathwise-connected subsets. Then F is called a foliation of M^n of codimension c (with ...

The Fourier cosine transform of a real function is the real part of the full complex Fourier transform, F_x^((c))[f(x)](k) = R[F_x[f(x)](k)] (1) = ...

Given a semicircular hump f(x) = sqrt(L^2-(x-L)^2) (1) = sqrt((2L-x)x), (2) the Fourier coefficients are a_0 = 1/2piL (3) a_n = ((-1)^nLJ_1(npi))/n (4) b_n = 0, (5) where ...

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

For any nonzero lambda in C, either 1. The equation Tv-lambdav=0 has a nonzero solution v, or 2. The equation Tv-lambdav=f has a unique solution v for any function f. In the ...

Let f(x) be a monic polynomial of degree d with discriminant Delta. Then an odd integer n with (n,f(0)Delta)=1 is called a Frobenius pseudoprime with respect to f(x) if it ...

The functional derivative is a generalization of the usual derivative that arises in the calculus of variations. In a functional derivative, instead of differentiating a ...

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

A method of determining coefficients alpha_k in a power series solution y(x)=y_0(x)+sum_(k=1)^nalpha_ky_k(x) of the ordinary differential equation L^~[y(x)]=0 so that ...