TOPICS
Search

Search Results for ""


781 - 790 of 2518 for Inline 12Search Results
The integral 1/(2pi(n+1))int_(-pi)^pif(x){(sin[1/2(n+1)x])/(sin(1/2x))}^2dx which gives the nth Cesàro mean of the Fourier series of f(x).
A knot or link L^n in S^(n+2) is said to be fibered if there exists a fibration f:S^(n+2)-L->S^1 and if the fibration is well-behaved near L (Rolfsen 1976, p. 323). Examples ...
In elliptic n-space, the pole of an (n-1)-flat is a point located at an arc length of pi/2 radians away from each point of the (n-1)-flat.
Let f:R×R->R be a one-parameter family of C^3 maps satisfying f(0,0) = 0 (1) [(partialf)/(partialx)]_(mu=0,x=0) = -1 (2) [(partial^2f)/(partialx^2)]_(mu=0,x=0) < 0 (3) ...
Let F be a field of field characteristic p. Then the Frobenius automorphism on F is the map phi:F->F which maps alpha to alpha^p for each element alpha of F.
If f^'(x) is continuous and the integral converges, int_0^infty(f(ax)-f(bx))/xdx=[f(0)-f(infty)]ln(b/a).
A ruled surface is called a generalized cone if it can be parameterized by x(u,v)=p+vy(u), where p is a fixed point which can be regarded as the vertex of the cone. A ...
If the abstract simplicial complex S is isomorphic with the vertex scheme of the simplicial complex K, then K is said to be a geometric realization of S, and is uniquely ...
The co-rank of a graph G is defined as s(G)=m-n+c, where m is the number of edges of G, n is the number of vertices, and c is the number of connected components (Biggs 1993, ...
The number of nodes in a graph is called its order.
1 ... 76|77|78|79|80|81|82 ... 252 Previous Next

...