Search Results for ""

A chamfered cube, also inaccurately called a truncated rhombic dodecahedron or more accurately called a tetratruncated rhombic dodecahedron, is a polyhedron obtained by ...

A chamfered octahedron, which could also know known as a tritruncated rhombic dodecahedron, is a polyhedron obtained by chamfering a regular octahedron. The illustration ...

A problem sometimes known as Moser's circle problem asks to determine the number of pieces into which a circle is divided if n points on its circumference are joined by ...

A surface which is simultaneously complete and minimal. There have been a large number of fundamental breakthroughs in the study of such surfaces in recent years, and they ...

A convex polyhedron can be defined algebraically as the set of solutions to a system of linear inequalities mx<=b, where m is a real s×3 matrix and b is a real s-vector. ...

Conway's knot is the prime knot on 11 crossings with braid word sigma_2^3sigma_1sigma_3^(-1)sigma_2^(-2)sigma_1sigma_2^(-1)sigma_1sigma_3^(-1). The Jones polynomial of ...

The Cookson Hills series is the series similar to the Flint Hills series, but with numerator sec^2n instead of csc^2n: S_2=sum_(n=1)^infty(sec^2n)/(n^3) (Pickover 2002, p. ...

The average number of regions into which n randomly chosen planes divide a cube is N^_(n)=1/(324)(2n+23)n(n-1)pi+n+1 (Finch 2003, p. 482). The maximum number of regions is ...

The cubeplex graph is the cubic Hamiltonian graph on 12 nodes illustrated above in several embeddings and corresponding to the graph Gamma_1 in Fischer and Little (2001). It ...

The cubohemioctahedron is the uniform polyhedron with Maeder index 15 (Maeder 1997), Wenninger index 78 (Wenninger 1989), Coxeter index 51 (Coxeter et al. 1954), and Har'El ...