Search Results for ""

Let f(x) be a finite and measurable function in (-infty,infty), and let epsilon be freely chosen. Then there is a function g(x) such that 1. g(x) is continuous in ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

Metamathematics is another word for proof theory. The branch of logic dealing with the study of the combination and application of mathematical symbols is also sometimes ...

A minimal edge cover is an edge cover of a graph that is not a proper subset of any other edge cover. Every minimum edge cover is a minimal edge cover, but the converse does ...

The Minkowski measure of a bounded, closed set is the same as its Lebesgue measure.

The sum of sets A and B in a vector space, equal to {a+b:a in A,b in B}.

(b-c)/a = (sin[1/2(B-C)])/(cos(1/2A)) (1) (c-a)/b = (sin[1/2(C-A)])/(cos(1/2B)) (2) (a-b)/c = (sin[1/2(A-B)])/(cos(1/2C)). (3)

Generalizes the secant method of root finding by using quadratic 3-point interpolation q=(x_n-x_(n-1))/(x_(n-1)-x_(n-2)). (1) Then define A = ...

Let M be a sigma-algebra M, and let lambda_1 and lambda_2 be measures on M. If there exists a pair of disjoint sets A and B such that lambda_1 is concentrated on A and ...

The geometry of the Lie group consisting of real matrices of the form [1 x y; 0 1 z; 0 0 1], i.e., the Heisenberg group.