Search Results for ""

The small dodecicosidodecahedron is the uniform polyhedron with Maeder index 33 (Maeder 1997), Wenninger index 72 (Wenninger 1989), Coxeter index 42 (Coxeter et al. 1954), ...

The snub dodecadodecahedron, not to be confused with the Archimdean snub dodecahedron, is the uniform polyhedron is the uniform polyhedron with Maeder index 40 (Maeder 1997), ...

The stellated truncated hexahedron (Maeder 1997), also called the quasitruncated hexahedron (Wenninger 1989, p. 144), is the uniform polyhedron with Maeder index 19 (Maeder ...

Tarski's theorem says that the first-order theory of reals with +, *, =, and > allows quantifier elimination. Algorithmic quantifier elimination implies decidability assuming ...

The truncated great dodecahedron is the uniform polyhedron with Maeder index 37 (Maeder 1997), Wenninger index 75 (Wenninger 1989), Coxeter index 47 (Coxeter et al. 1954), ...

Let b(k) be the number of 1s in the binary expression of k, i.e., the binary digit count of 1, giving 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, ... (OEIS A000120) for k=1, 2, .... ...

An unfolding is the cutting along edges and flattening out of a polyhedron to form a net. Determining how to unfold a polyhedron into a net is tricky. For example, cuts ...

Let f:M|->N be a map between two compact, connected, oriented n-dimensional manifolds without boundary. Then f induces a homomorphism f_* from the homology groups H_n(M) to ...

A convex polyomino containing at least one edge of its minimal bounding rectangle. The perimeter and area generating function for directed polygons of width m, height n, and ...

An identity graph, sometimes also known as an asymmetric graph or rigid graph (Albertson and Collins 1996), is a graph possessing a single graph automorphism. The numbers of ...