Search Results for ""

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...

According to G. Pólya, the method of finding geometric objects by intersection. 1. For example, the centers of all circles tangent to a straight line s at a given point P lie ...

The Patterson graph is the graph whose vertices are the 22880 centers of the Sylow 3-groups of the Suzuki group and in which two vertices are adjacent whenever they generate ...

The eighth proposition in the third book of the Elements is one of Euclid's most complex propositions. It shows that a segment through an outside point D and a circle is ...

The Peano-Gosper curve is a plane-filling function originally called a "flowsnake" by R. W. Gosper and M. Gardner. Mandelbrot (1977) subsequently coined the name Peano-Gosper ...

The theory of natural numbers defined by the five Peano's axioms. Paris and Harrington (1977) gave the first "natural" example of a statement which is true for the integers ...

A number of fractal curves are associated with Peano. The Peano curve is the fractal curve illustrated above which can be written as a Lindenmayer system. The nth iteration ...

Given a statistical distribution with measured mean, mode, and standard deviation sigma, the Pearson mode skewness is (mean-mode)/sigma. The function was incorrectly ...

A skewed distribution which is similar to the binomial distribution when p!=q (Abramowitz and Stegun 1972, p. 930). y=k(t+A)^(A^2-1)e^(-At), (1) for t in [0,infty) where A = ...

Given a statistical distribution with measured mean, statistical median, mode, and standard deviation sigma, Pearson's first skewness coefficient, also known as the Pearson ...