Search Results for ""

A nowhere-neat dissection is a dissection of an area into polygons such that no two polygons have a side in common. A nowhere-neat dissection in which squares of the same ...

An integer matrix whose entries satisfy a_(ij)={0 if j>i+1; -1 if j=i+1; 0 or 1 if j<=i. (1) There are 2^(n-1) special minimal matrices of size n×n.

A ring torus constructed out of a square of side length c can be dissected into two squares of arbitrary side lengths a and b (as long as they are consistent with the size of ...

Given a Poisson process, the probability of obtaining exactly n successes in N trials is given by the limit of a binomial distribution P_p(n|N)=(N!)/(n!(N-n)!)p^n(1-p)^(N-n). ...

The Gini coefficient (or Gini ratio) G is a summary statistic of the Lorenz curve and a measure of inequality in a population. The Gini coefficient is most easily calculated ...

An illusion named after the psychologist Joseph Jastrow. In the above figure, the left edges of the laminas A and B are colinear, creating an illusion of different size. ...

A connected dominating set in a connected graph G is a dominating set in G whose vertices induce a connected subgraph, i.e., one in which there is no dominating vertex not ...

In most computer programs and computing environments, the precision of any calculation (even including addition) is limited by the word size of the computer, that is, by ...

An independent edge set (also called a matching) of a graph G is a subset of the edges such that no two edges in the subset share a vertex of G (Skiena 1990, p. 219). The ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...