Search Results for ""

A tournament sequence is an increasing sequence of positive integers (t_1, t_2, ...) such that t_1=1 and t_(i+1)<=2t_i. Cook and Kleber (2000) show that Meeussen sequences ...

A Saunders graphic is a plot of the dth base-b digits of a function f(x,y) as a function of x and y. The plots above show Saunders graphics for the functions ...

Let L be a nontrivial bounded lattice (or a complemented lattice, etc.). Then L is a tight lattice if every proper tolerance rho of L satisfies (0,a) in rho=>a=0, and dually ...

An almost perfect number, also known as a least deficient or slightly defective (Singh 1997) number, is a positive integer n for which the divisor function satisfies ...

The skeleton of the bislit cube is the 8-vertex simple graph, illustrated above in several embeddings, which consists of a cube in which two opposite faces have polyhedron ...

Let A and B be any sets, and let |X| be the cardinal number of a set X. Then cardinal exponentiation is defined by |A|^(|B|)=|set of all functions from B into A| (Ciesielski ...

An algorithm originally described by Barnsley in 1988. Pick a point at random inside a regular n-gon. Then draw the next point a fraction r of the distance between it and a ...

The deltoidal hexecontahedral graph is an Archimedean dual graph which is the skeleton of the deltoidal hexecontahedron as well as the rhombic hexecontahedron. It is ...

Define the Euler measure of a polyhedral set as the Euler integral of its indicator function. It is easy to show by induction that the Euler measure of a closed bounded ...

A triple (a,b,c) of positive integers satisfying a<b<c is said to be geometric if ac=b^2. In particular, such a triple is geometric if its terms form a geometric sequence ...