Search Results for ""

Jung's theorem states that the generalized diameter D of a compact set X in R^n satisfies D>=Rsqrt((2(n+1))/n), where R is the circumradius of X (Danzer et al. 1963). This ...

The problem of determining how many nonattacking kings can be placed on an n×n chessboard. For n=8, the solution is 16, as illustrated above (Madachy 1979). In general, the ...

For every k>=1, let C_k be the set of composite numbers n>k such that if 1<a<n, GCD(a,n)=1 (where GCD is the greatest common divisor), then a^(n-k)=1 (mod n). Special cases ...

On a measure space X, the set of square integrable L2-functions is an L^2-space. Taken together with the L2-inner product with respect to a measure mu, <f,g>=int_Xfgdmu (1) ...

The Lebesgue covering dimension is an important dimension and one of the first dimensions investigated. It is defined in terms of covering sets, and is therefore also called ...

The Lemoine cubic is the triangle cubic with trilinear equation It passes through Kimberling centers X_n for n=3, 4, 32, 56, and 1147.

There are at least two distinct notions of linear space throughout mathematics. The term linear space is most commonly used within functional analysis as a synonym of the ...

A marked point process with mark space E is a double sequence (T,Y)=((T_n)_(n>=1),(Y_n)_(n>=1)) of R^^^+-valued random variables and E^_-valued random variables Y_n defined ...

A maximal irredundant set is an irredundant set that cannot be expanded to another irredundant set by addition of any vertex in the graph. Note that a maximal irredundant set ...

A minimum vertex cut of a graph is a vertex cut of smallest possible size. A vertex cut set of size 1 in a connected graph corresponds to an articulation vertex. The size of ...