Search Results for ""

A point process is a probabilistic model for random scatterings of points on some space X often assumed to be a subset of R^d for some d. Oftentimes, point processes describe ...

A plot of a function expressed in polar coordinates, with radius r as a function of angle theta. Polar plots can be drawn in the Wolfram Language using PolarPlot[r, {t, tmin, ...

The polar sine is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the lengths of the n edges of the ...

A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...

A polynomial discriminant is the product of the squares of the differences of the polynomial roots r_i. The discriminant of a polynomial is defined only up to constant ...

If P be a point in the plane of an equilateral triangle DeltaABC, then the lengths of line segments AP, BP, and CP correspond the sides of a triangle, which is degenerate ...

Porter's constant is the constant appearing in formulas for the efficiency of the Euclidean algorithm, C = (6ln2)/(pi^2)[3ln2+4gamma-(24)/(pi^2)zeta^'(2)-2]-1/2 (1) = ...

A prime ideal is an ideal I such that if ab in I, then either a in I or b in I. For example, in the integers, the ideal a=<p> (i.e., the multiples of p) is prime whenever p ...

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 ...

A principal bundle is a special case of a fiber bundle where the fiber is a group G. More specifically, G is usually a Lie group. A principal bundle is a total space E along ...