Search Results for ""

An n-Hadamard graph is a graph on 4n vertices defined in terms of a Hadamard matrix H_n=(h)_(ij) as follows. Define 4n symbols r_i^+, r_i^-, c_i^+, and c_i^-, where r stands ...

A system of variables which can be written in the form of Hamilton's equations.

A database accessed by one or more hash functions.

The boundary of complex hyperbolic 2-space.

Given a Euclidean n-space, H_n=n+1.

e is transcendental.

A set of six.

Two graphs are homeomorphic if there is a graph isomorphism from some graph subdivision of one to some subdivision of the other.

A multivariate polynomial (i.e., a polynomial in more than one variable) with all terms having the same degree. For example, x^3+xyz+y^2z+z^3 is a homogeneous polynomial of ...

A set of statistical distributions having the same variance.