Search Results for ""

The smallI icosicosidodecahedron is the uniform polyhedron with Maeder index 31 (Maeder 1997), Wenninger index 71 (Wenninger 1989), Coxeter index 40 (Coxeter et al. 1954), ...

Solid partitions are generalizations of plane partitions. MacMahon (1960) conjectured the generating function for the number of solid partitions was ...

The first Strehl identity is the binomial sum identity sum_(k=0)^n(n; k)^3=sum_(k=0)^n(n; k)^2(2k; n), (Strehl 1993, 1994; Koepf 1998, p. 55), which are the so-called Franel ...

Sudoku (literally, "single number"), sometimes also is a pencil-and-paper logic puzzle whose goal is to complete a grid satisfying various constraints. In the "classic" ...

The skeleton of a trapezohedron may be termed a trapezohedral graph. n-trapezohedral graphs are illustrated above for n=3 to 10 in circular embeddings with the two interior ...

A triangular prism is a prism composed of two triangular bases and three rectangular sides. It is a pentahedron. It is implemented in the Wolfram Language as ...

Given a reference triangle DeltaABC, the trilinear vertex matrix of another triangle DeltaA^'B^'C^' is the 3×3 matrix whose rows are the trilinear coordinates of the vertices ...

The truncated icosahedral graph is the cubic Archimedean graph on 60 nodes and 90 edges that is the skeleton of the truncated icosahedron. It is sometimes known as the ...

There are several different definitions of the term "unital" used throughout various branches of mathematics. In geometric combinatorics, a block design of the form (q^3+1, ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...