Search Results for ""

A theory is decidable iff there is an algorithm which can determine whether or not any sentence r is a member of the theory.

Qualitatively, a deep theorem is a theorem whose proof is long, complicated, difficult, or appears to involve branches of mathematics which are not obviously related to the ...

A test for the convergence of Fourier series. Let phi_x(t)=f(x+t)+f(x-t)-2f(x), then if int_0^pi(|phi_x(t)|dt)/t is finite, the Fourier series converges to f(x) at x.

int_0^pi(sin[(n+1/2)x])/(2sin(1/2x))dx=1/2pi, where the integral kernel is the Dirichlet kernel.

Disconnectivities are mathematical entities which stand in the way of a space being contractible (i.e., shrunk to a point, where the shrinking takes place inside the space ...

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

A generalization by Kronecker of Kummer's theory of prime ideal factors. A divisor on a full subcategory C of mod(A) is an additive mapping chi on C with values in a ...

The set of all edge automorphisms of G, denoted Aut^*(G). Let L(G) be the line graph of a graph G. Then the edge automorphism group Aut^*(G) is isomorphic to Aut(L(G)), ...

A proof which can be accomplished using only real numbers (i.e., real analysis instead of complex analysis; Hoffman 1998, pp. 92-93).

delta(r)=sqrt(r)-2alpha(r), where alpha(r) is the elliptic alpha function.