Search Results for ""

Given two intersecting lines or line segments, the amount of rotation about the point of intersection (the vertex) required to bring one into correspondence with the other is ...

A half-space is that portion of an n-dimensional space obtained by removing that part lying on one side of an (n-1)-dimensional hyperplane. For example, half a Euclidean ...

A number triangle of order n with entries 1 to n such that entries are nondecreasing across rows and down columns and all entries in column j are less than or equal to j. An ...

A compactification of a topological space X is a larger space Y containing X which is also compact. The smallest compactification is the one-point compactification. For ...

An n-dimensional disk (sometimes spelled "disc") of radius r is the collection of points of distance <=r (closed disk) or <r (open disk) from a fixed point in Euclidean ...

Two figures are homothetic if they are related by an expansion or geometric contraction. This means that they lie in the same plane and corresponding sides are parallel; such ...

A bijective map between two metric spaces that preserves distances, i.e., d(f(x),f(y))=d(x,y), where f is the map and d(a,b) is the distance function. Isometries are ...

A polygon P is said to be simple (or a Jordan polygon) if the only points of the plane belonging to two polygon edges of P are the polygon vertices of P. Such a polygon has a ...

The polylogarithm Li_n(z), also known as the Jonquière's function, is the function Li_n(z)=sum_(k=1)^infty(z^k)/(k^n) (1) defined in the complex plane over the open unit ...

The braced square problem asks, given a hinged square composed of four equal rods (indicated by the red lines above), how many more hinged rods must be added in the same ...