Search Results for ""

The Fibonacci number F_(n+1) gives the number of ways for 2×1 dominoes to cover a 2×n checkerboard, as illustrated in the diagrams above (Dickau). The numbers of domino ...

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

In discrete percolation theory, site percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice vertices ...

An archaic term for calculus.

A function used to study ordinary differential equations.

The Motzkin numbers enumerate various combinatorial objects. Donaghey and Shapiro (1977) give 14 different manifestations of these numbers. In particular, they give the ...

An 8-polyiamond.

The map x^' = x+1 (1) y^' = 2x+y+1, (2) which leaves the parabola x^('2)-y^'=(x+1)^2-(2x+y+1)=x^2-y (3) invariant.

The symbol v variously means "disjunction" (i.e., OR in logic) or "join" (for a lattice).

An AB percolation is a discrete percolation model in which the underlying point lattice graph L has the properties that each of its graph vertices is occupied by an atom ...