Search Results for ""

The bipartite double graph, also called the Kronecker cover, Kronecker double cover, bipartite double cover, canonical double cover, or bipartite double, of a given graph G ...

A busy beaver is an n-state, 2-color Turing machine which writes a maximum number Sigma(n) of 1s before halting (Rado 1962; Lin and Rado 1965; Shallit 1998). Alternatively, ...

For every positive integer n, there exists a circle which contains exactly n lattice points in its interior. H. Steinhaus proved that for every positive integer n, there ...

Clean tile is a game investigated by Buffon (1777) in which players bet on the number of different tiles a thrown coin will partially cover on a floor that is regularly ...

Let there be n>=2 integers 0<a_1<...<a_n with GCD(a_1,a_2,...,a_n)=1. The values a_i represent the denominations of n different coins, where these denominations have greatest ...

A convex polyomino (sometimes called a "convex polygon") is a polyomino whose perimeter is equal to that of its minimal bounding box (Bousquet-Mélou et al. 1999). ...

An order-n Costas array is a permutation on {1,...,n} such that the distances in each row of the triangular difference table are distinct. For example, the permutation ...

Let A be an edge cut of a connected graph G. Then the cyclic edge connectivity lambda_c(G) is the size of a smallest cyclic edge cut, i.e., a smallest edge cut A such that ...

The dilogarithm Li_2(z) is a special case of the polylogarithm Li_n(z) for n=2. Note that the notation Li_2(x) is unfortunately similar to that for the logarithmic integral ...

The simplest class of one-dimensional cellular automata. Elementary cellular automata have two possible values for each cell (0 or 1), and rules that depend only on nearest ...