Search Results for ""

Let F(m,n) be the number of m×n (0,1)-matrices with no adjacent 1s (in either columns or rows). For n=1, 2, ..., F(n,n) is given by 2, 7, 63, 1234, ... (OEIS A006506). The ...

Let L denote the n×n triangular lattice with wraparound. Call an orientation of L an assignment of a direction to each edge of L, and denote the number of orientations of L ...

Consider an n×n (0, 1)-matrix such as [a_(11) a_(23) ; a_(22) a_(34); a_(21) a_(33) ; a_(32) a_(44); a_(31) a_(43) ; a_(42) a_(54); a_(41) a_(53) ; a_(52) a_(64)] (1) for ...

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...

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 ...

The branch of mathematics dealing with the efficient and accurate storage, transmission, and representation of information.

Chess is a two-player board game believed to have been played in India as early as the sixth century AD. In different parts of this world, different chess games are played. ...

The unit of information obtained by using the natural logarithm lnx instead of the base-2 logarithm log_2x=lgx when defining entropy and related information theoretic ...

The theory of non-uniformly hyperbolic diffeomorphisms.

Let L denote the n×n square lattice with wraparound. Call an orientation of L an assignment of a direction to each edge of L, and denote the number of orientations of L such ...