Search Results for ""

A compactum (plural: compacta) is a compact metric space. An example of a compactum is any finite discrete metric space. Also, the space [0,1] union [2,3] is a compactum, ...

The word configuration is sometimes used to describe a finite collection of points p=(p_1,...,p_n), p_i in R^d, where R^d is a Euclidean space. The term "configuration" also ...

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

A shift-invariant operator Q for which Qx is a nonzero constant. 1. Qa=0 for every constant a. 2. If p(x) is a polynomial of degree n, Qp(x) is a polynomial of degree n-1. 3. ...

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.

A puzzle in which one object is to be converted to another by making a finite number of cuts and reassembling it. The cuts are often, but not always, restricted to straight ...

A number which can be specified implicitly or explicitly by exponential, logarithmic, and algebraic operations.

There are two similar but distinct concepts related to equidecomposability: "equidecomposable" and "equidecomposable by dissection." The difference is in that the pieces ...

Consider a finite collection of points p=(p_1,...,p_n), p_i in R^d Euclidean space (known as a configuration) and a graph G whose graph vertices correspond to pairs of points ...

A frustum (unfortunately commonly misspelled "frustrum") is that portion of a solid which lies between two parallel planes cutting the solid. Degenerate cases are obtained ...