Search Results for ""

The Eulerian number <n; k> gives the number of permutations of {1,2,...,n} having k permutation ascents (Graham et al. 1994, p. 267). Note that a slightly different ...

The Heilbronn triangle problem is to place n>=3 points in a disk (square, equilateral triangle, etc.) of unit area so as to maximize the area Delta(n) of the smallest of the ...

The orchard-planting problem (also known as the orchard problem or tree-planting problem) asks that n trees be planted so that there will be r(n,k) straight rows with k trees ...

A Turing machine is a theoretical computing machine invented by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine consists of a ...

A Turing machine which, by appropriate programming using a finite length of input tape, can act as any Turing machine whatsoever. In his seminal paper, Turing himself gave ...

Five or six Wolf prizes are awarded yearly to outstanding living scientists and artists for achievements in the interest of mankind and friendly relations among peoples. In ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

A sequence of circles which closes (such as a Steiner chain or the circles inscribed in the arbelos) is called a chain.

Not decidable as a result of being neither formally provable nor unprovable.

A biconnected graph is a connected graph having no articulation vertices (Skiena 1990, p. 175). An equivalent definition for graphs on more than two vertices is a graph G ...