Search Results for ""

Inspired by computer simulations of fossilized worms trails published by Raup and Seilacher (1969), computer scientist Mike Paterson at the University of Warwick and ...

The set of all lines through a point. The term was first used by Desargues (Cremona 1960, p. x). The six angles of any pencils of four rays O{ABCD} are connected by the ...

Percolation theory deals with fluid flow (or any other similar process) in random media. If the medium is a set of regular lattice points, then there are two main types of ...

A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...

A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...

An involution of a set S is a permutation of S which does not contain any permutation cycles of length >2 (i.e., it consists exclusively of fixed points and transpositions). ...

A set of ascending sequences in a permutation is called a run (Graham et al. 1994) or sometimes a rise (Comtet 1974, p. 241). A sorted permutation consists of a single run, ...

The Petersen family of graphs, not to be confused with generalized Petersen graphs, are a set of seven graphs obtained from the Petersen graph (or complete graph K_6) by del ...

A phase curve is a plot of the solution to a set of equations of motion in a phase plane (or more generally, a phase space) as a function of time (Tabor 1989, p. 14). Phase ...

A phi-prime is a prime number appearing in the decimal expansion of the golden ratio phi. The first few are 1618033, 1618033988749, ... (OEIS A064117). The numbers of decimal ...