Search Results for ""

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 ...

The number of "prime" boxes is always finite, where a set of boxes is prime if it cannot be built up from one or more given configurations of boxes.

If, in the Gershgorin circle theorem for a given m, |a_(jj)-a_(mm)|>Lambda_j+Lambda_m for all j!=m, then exactly one eigenvalue of A lies in the disk Gamma_m.

One name for the figure used by Euclid to prove the Pythagorean theorem. It is sometimes also known as the "windmill."

A finite group G has a finite number of conjugacy classes and a finite number of distinct irreducible representations. The group character of a group representation is ...

If a one-parameter family of curves has index N and class M, the number tangent to a curve of order n_1 and class m_1 in general position is m_1N+n_1M.

In 1891, Chebyshev and Sylvester showed that for sufficiently large x, there exists at least one prime number p satisfying x<p<(1+alpha)x, where alpha=0.092.... Since the ...

A sum of the digits in a given transmission modulo some number. The simplest form of checksum is a parity bit appended on to 7-bit numbers (e.g., ASCII characters) such that ...

A fake knot (i.e., a knot equivalent to the unknot) created by tying a square knot, then looping one end twice through the knot such that when both ends are pulled, the knot ...

A node which is one graph edge further away from a given node in a rooted tree.