Search Results for ""

A generalized octagon GO(n,k) is a generalized polygon of order 8. GO(1,2) is the (3,8)-cage graph, the incidence graph of the Cremona-Richmond configuration, the cubic ...

A geodesic is a locally length-minimizing curve. Equivalently, it is a path that a particle which is not accelerating would follow. In the plane, the geodesics are straight ...

The centroid is center of mass of a two-dimensional planar lamina or a three-dimensional solid. The mass of a lamina with surface density function sigma(x,y) is ...

The geometric distribution is a discrete distribution for n=0, 1, 2, ... having probability density function P(n) = p(1-p)^n (1) = pq^n, (2) where 0<p<1, q=1-p, and ...

The study of the probabilities involved in geometric problems, e.g., the distributions of length, area, volume, etc. for geometric objects under stated conditions. The ...

The goat problem (or bull-tethering problem) considers a fenced circular field of radius a with a goat (or bull, or other animal) tied to a point on the interior or exterior ...

Turing machines are defined by sets of rules that operate on four parameters: (state, tape cell color, operation, state). Let the states and tape cell colors be numbered and ...

The first Göllnitz-Gordon identity states that the number of partitions of n in which the minimal difference between parts is at least 2, and at least 4 between even parts, ...

A root-finding method which was among the most popular methods for finding roots of univariate polynomials in the 19th and 20th centuries. It was invented independently by ...

Graham's biggest little hexagon is the largest possible (not necessarily regular) convex hexagon with polygon diameter 1 (i.e., for which no two of the vertices are more than ...