Search Results for ""

The great truncated cuboctahedron (Maeder 1997), also called the quasitruncated cuboctahedron (Wenninger 1989, p. 145), is the uniform polyhedron with Maeder index 20 (Maeder ...

The harmonic parameter of a polyhedron is the weighted mean of the distances d_i from a fixed interior point to the faces, where the weights are the areas A_i of the faces, ...

The Hartley Transform is an integral transform which shares some features with the Fourier transform, but which, in the most common convention, multiplies the integral kernel ...

A d-dimensional discrete percolation model is said to be inhomogeneous if different graph edges (in the case of bond percolation models) or vertices (in the case of site ...

The Jahangir graph J_(n,m) is a kind of generalized wheel graph with consisting of mn circular vertices and a central vertex connected to every mth vertex around the circle. ...

There are at least three theorems known as Jensen's theorem. The first states that, for a fixed vector v=(v_1,...,v_m), the function |v|_p=(sum_(i=1)^m|v_i|^p)^(1/p) is a ...

The sequence of numbers {j_n} giving the number of digits in the three-fold power tower n^(n^n). The values of n^(n^n) for n=1, 2, ... are 1, 16, 7625597484987, ... (OEIS ...

A combinatorial conjecture formulated by Kneser (1955). It states that whenever the n-subsets of a (2n+k)-set are divided into k+1 classes, then two disjoint subsets end up ...

The problem of determining how many nonattacking knights K(n) can be placed on an n×n chessboard. For n=8, the solution is 32 (illustrated above). In general, the solutions ...

The most general form of Lagrange's group theorem, also known as Lagrange's lemma, states that for a group G, a subgroup H of G, and a subgroup K of H, (G:K)=(G:H)(H:K), ...