Search Results for ""

The pair of sequences defined by F(0)=1, M(0)=0, and F(n) = n-M(F(n-1)) (1) M(n) = n-F(M(n-1)). (2) The first few terms of the "male" sequence M(n) for n=0, 1, ... are 0, 0, ...

Let (A,<=) be a well ordered set. Then the set {a in A:a<k} for some k in A is called an initial segment of A (Rubin 1967, p. 161; Dauben 1990, pp. 196-197; Moore 1982, pp. ...

Let S(T) be the group of symmetries which map a monohedral tiling T onto itself. The transitivity class of a given tile T is then the collection of all tiles to which T can ...

A fractal derived from the Koch snowflake. The base curve and motif for the fractal are illustrated below. The area enclosed by pieces of the curve after the nth iteration is ...

A theorem which plays a fundamental role in computer science because it is one of the main tools for showing that certain orderings on trees are well-founded. These orderings ...

Given a Taylor series f(x)=f(x_0)+(x-x_0)f^'(x_0)+((x-x_0)^2)/(2!)f^('')(x_0)+... +((x-x_0)^n)/(n!)f^((n))(x_0)+R_n, (1) the error R_n after n terms is given by ...

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A lattice isomorphism is a one-to-one and onto lattice homomorphism.

A fractal curve, also called the C-curve (Gosper 1972). The base curve and motif are illustrated below. Duvall and Keesling (1999) proved that the Hausdorff dimension of the ...

For any algebraic number x of degree n>2, a rational approximation p/q to x must satisfy |x-p/q|>1/(q^n) for sufficiently large q. Writing r=n leads to the definition of the ...

The Ljubljana graph is a graph on 112 vertices that is the third smallest cubic semisymmetric graph. It was discovered by Brouwer et al. (1993) and rediscovered by Conder et ...