Search Results for ""

Taylor's inequality is an estimate result for the value of the remainder term R_n(x) in any n-term finite Taylor series approximation. Indeed, if f is any function which ...

A normed vector space X=(X,||·||_X) is said to be uniformly convex if for sequences {x_n}={x_n}_(n=1)^infty, {y_n}={y_n}_(n=1)^infty, the assumptions ||x_n||_X<=1, ...

Mills' theorem states that there exists a real constant A such that |_A^(3^n)_| is prime for all positive integers n (Mills 1947). While for each value of c>=2.106, there are ...

The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...

Partial evaluation is a branch of computer science studying program transformation via specialization. Any function can be specialized by fixing one or more of its inputs to ...

Given a Hilbert space H, a *-subalgebra A of B(H) is said to be a von Neumann algebra in H provided that A is equal to its bicommutant A^('') (Dixmier 1981). Here, B(H) ...

The Lyapunov characteristic exponent [LCE] gives the rate of exponential divergence from perturbed initial conditions. To examine the behavior of an orbit around a point ...

Let G be a planar graph whose vertices have been properly colored and suppose v in V(G) is colored C_1. Define the C_1C_2-Kempe chain containing v to be the maximal connected ...

An embedding of a 1-sphere in a 3-manifold which exists continuously over the 2-disk also extends over the disk as an embedding. An alternate phrasing is that if a knot group ...

A metatheorem stating that every theorem on partially ordered sets remains true if all inequalities are reversed. In this operation, supremum must be replaced by infimum, ...