Search Results for ""

A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...

Given a circular table of diameter 9 feet, which is the minimal number of planks (each 1 foot wide and length greater than 9 feet) needed in order to completely cover the ...

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

WireWorld is a two-dimensional four-color cellular automaton introduced by Brian Silverman in 1987. The rule for the automaton uses the cell's old value a together with the ...

The stomachion is a 14-piece dissection puzzle similar to tangrams. It is described in fragmentary manuscripts attributed to Archimedes as noted by Magnus Ausonius (310-395 ...

Zeno's paradoxes are a set of four paradoxes dealing with counterintuitive aspects of continuous space and time. 1. Dichotomy paradox: Before an object can travel a given ...

Let G=SL(n,C). If lambda in Z^n is the highest weight of an irreducible holomorphic representation V of G, (i.e., lambda is a dominant integral weight), then the G-map ...

The clove hitch is the hitch illustrated above that is also called the boatman's knot or peg knot.

If the parameters of a Lie group vary over a closed interval, them the Lie group is said to be compact. Every representation of a compact group is equivalent to a unitary ...

A formal description of the constraints on the possible configurations of an experiment which is subject to given conditions. A design is sometimes called an experimental ...