Search Results for ""

Let four lines in a plane represent four roads in general position, and let one traveler T_i be walking along each road at a constant (but not necessarily equal to any other ...

The term "homology group" usually means a singular homology group, which is an Abelian group which partially counts the number of holes in a topological space. In particular, ...

A hosohedron is a regular tiling or map on a sphere composed of p digons or spherical lunes, all with the same two vertices and the same vertex angles, 2pi/p. Its Schläfli ...

A discrete subset of R^s which is closed under addition and subtraction and which contains Z^s as a subset.

Let E be a set of expressions representing real, single-valued partially defined functions of one real variable. Let E^* be the set of functions represented by expressions in ...

A statistic defined to improve the Kolmogorov-Smirnov test in the tails.

F_k[P_N(k)](x)=F_k[exp(-N|k|^beta)](x), where F is the Fourier transform of the probability P_N(k) for N-step addition of random variables. Lévy showed that beta in (0,2) for ...

Sequences x_n^((1)), x_n^((2)), ..., x_n^((k)) are linearly dependent if constants c_1, c_2, ..., c_k (not all zero) exist such that sum_(i=1)^kc_ix_n^((i))=0 for n=0, 1, ....

A member of a collection of sets is said to be maximal if it cannot be expanded to another member by addition of any element. Maximal sets are important in graph theory since ...

A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...