Search Results for ""

A space-filling function which maps a one-dimensional interval into a two-dimensional area. Plane-filling functions were thought to be impossible until Hilbert discovered the ...

A Poisson process is a process satisfying the following properties: 1. The numbers of changes in nonoverlapping intervals are independent for all intervals. 2. The ...

As first shown by Meyer and Ritchie (1967), do-loops (which have a fixed iteration limit) are a special case of while-loops. A function that can be implemented using only ...

Consider the Fibonacci-like recurrence a_n=+/-a_(n-1)+/-a_(n-2), (1) where a_0=0, a_1=1, and each sign is chosen independently and at random with probability 1/2. ...

Let a closed interval [a,b] be partitioned by points a<x_1<x_2<...<x_(n-1)<b, where the lengths of the resulting intervals between the points are denoted Deltax_1, Deltax_2, ...

Salem constants, sometimes also called Salem numbers, are a set of numbers of which each point of a Pisot number is a limit point from both sides (Salem 1945). The Salem ...

A simple point process (or SPP) is an almost surely increasing sequence of strictly positive, possibly infinite random variables which are strictly increasing as long as they ...

How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...

Transfinite induction, like regular induction, is used to show a property P(n) holds for all numbers n. The essential difference is that regular induction is restricted to ...

Let F_n be the nth Fibonacci number, and let (p|5) be a Legendre symbol so that e_p=(p/5)={1 for p=1,4 (mod 5); -1 for p=2,3 (mod 5). (1) A prime p is called a Wall-Sun-Sun ...