Search Results for ""

A simplex, sometimes called a hypertetrahedron (Buekenhout and Parker 1998), is the generalization of a tetrahedral region of space to n dimensions. The boundary of a ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p). An s-cluster is an isolated group of s adjacent (i.e., horizontally ...

Let T be a tree defined on a metric over a set of paths such that the distance between paths p and q is 1/n, where n is the number of nodes shared by p and q. Let A be a ...

Given a point lattice, a cluster is a group of filled cells which are all connected to their neighbors vertically or horizontally.

Suppose a,b in N, n=ab+1, and x_1, ..., x_n is a sequence of n real numbers. Then this sequence contains a monotonic increasing (decreasing) subsequence of a+1 terms or a ...

The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...

Isomorphism is a very general concept that appears in several areas of mathematics. The word derives from the Greek iso, meaning "equal," and morphosis, meaning "to form" or ...

An algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.

A near-perfect matching is a matching in which a single vertex is left unmatched. Just as perfect matchings can occur only for graphs with an even number of vertices, ...

A point which lies on at least one ordinary line is called an ordinary point, or sometimes a regular point.