Search Results for ""

What is the area of the largest square that can be inscribed on a unit cube (Trott 2004, p. 104)? The answer is 9/8, given by a square with vertices (1/4, 0, 0), (0, 1, 1/4), ...

A topological space that is not connected, i.e., which can be decomposed as the disjoint union of two nonempty open subsets. Equivalently, it can be characterized as a space ...

A family of functors H_n(·) from the category of pairs of topological spaces and continuous maps, to the category of Abelian groups and group homomorphisms satisfies the ...

An epsilon-delta definition is a mathematical definition in which a statement on a real function of one variable f having, for example, the form "for all neighborhoods U of ...

Let f(z) = z+a_1+a_2z^(-1)+a_3z^(-2)+... (1) = zsum_(n=0)^(infty)a_nz^(-n) (2) = zg(1/z) (3) be a Laurent polynomial with a_0=1. Then the Faber polynomial P_m(f) in f(z) of ...

Let M^n be an n-manifold and let F={F_alpha} denote a partition of M^n into disjoint pathwise-connected subsets. Then F is called a foliation of M^n of codimension c (with ...

French curves are plastic (or wooden) templates having an edge composed of several different curves. French curves are used in drafting (or were before computer-aided design) ...

Finch (2010) gives an overview of known results for random Gaussian triangles. Let the vertices of a triangle in n dimensions be normal (normal) variates. The probability ...

The generalized diameter is the greatest distance between any two points on the boundary of a closed figure. The diameter of a subset E of a Euclidean space R^n is therefore ...

The eccentricity epsilon(v) of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. For a disconnected graph, all ...