Search Results for ""

The great snub dodecicosidodecahedral graph is the skeleton of the great snub dodecicosidodecahedron, illustrated above in a few embeddings. It will be implemented in a ...

A collection of equations satisfies the Hasse principle if, whenever one of the equations has solutions in R and all the Q_p, then the equations have solutions in the ...

The hemicubical graph is the skeleton of the hemicube. It has 7 vertices, 11 edges, and 6 faces. It is implemented in the Wolfram Language as GraphData["HemicubicalGraph"].

The hemiobelisk graph is the skeleton of the hemiobelisk. It has 7 vertices, 11 edges, and 6 faces. It is a minimal unit-distance forbidden graph. It is implemented in the ...

A hyperbolic version of the Euclidean cube.

Let sigma_infty(n) be the sum of the infinitary divisors of a number n. An infinitary k-multiperfect number is a number n such that sigma_infty(n)=kn. Cohen (1990) found 13 ...

Every Möbius strip dissection of unequal squares can be glued along its edge to produce a dissection of the Klein bottle. There are no other ways to tile a Klein bottle with ...

The knot curve is a quartic curve with implicit Cartesian equation (x^2-1)^2=y^2(3+2y). (1) The x- and y-intercepts are (0,-1), (0,1/2), and (+/-1,0). It has horizontal ...

The Lemke graph is the 8-node graph with 13 edges illustrated above (Lemke and Kleitman 1989, Hurlbert 2011, Hurlbert 2013). The Lemke graph is the smallest graph that does ...

A magic tesseract is a four-dimensional generalization of the two-dimensional magic square and the three-dimensional magic cube. A magic tesseract has magic constant ...