Search Results for ""

There are a number of interesting results related to the tiling of squares. For example, M. Laczkovich has shown that there are exactly three shapes of non-right triangles ...

A triangle tiling is a tiling of the plane by identical triangles. Any triangle tiles the plane (Wells 1991, p. 208). The total number of triangles (including inverted ones) ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p) and numbers are assigned to the edges of a grid. A b-cluster is an ...

Let v be a n-vector whose entries are each 1 (with probability p) or 0 (with probability q=1-p). An s-run is an isolated group of s consecutive 1s. Ignoring the boundaries, ...

An infinite set, such as the real numbers, which is not countably infinite.

The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...

A distance graph with distance set (0,1].

Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...

Consider a broadcast scheme on a connected graph from an originator vertex v in a graph G consisting of a sequence of parallel calls starting from v. In each time step, every ...

Let Q(x) be a real or complex piecewise-continuous function defined for all values of the real variable x and that is periodic with minimum period pi so that Q(x+pi)=Q(x). ...