Search Results for ""

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 ...

A linkage with six rods which draws the inverse of a given curve. When a pencil is placed at P, the inverse is drawn at P^' (or vice versa). If a seventh rod (dashed) is ...

The triangular orthobicupola is Johnson solid J_(27), consisting of eight equilateral triangles and six squares. If a triangular orthobicupola is oriented with triangles on ...

The Zara graph is the unique graph on 126 vertices satisfying the properties that 1) every maximal clique (of which there are a total of 567) has six vertices, and 2) that if ...

The 10_3 configuration of ten lines intersecting three at a time in 10 points which arises in Desargues' theorem. Its Levi graph is the Desargues graph.

The Diophantine equation x^n+y^n=z^n. The assertion that this equation has no nontrivial solutions for n>2 has a long and fascinating history and is known as Fermat's last ...

A conjecture which relates the minimal elliptic discriminant of an elliptic curve to the j-conductor. If true, it would imply Fermat's last theorem for sufficiently large ...

A point about which inversion of two circles produced concentric circles. Every pair of distinct circles has two limiting points. The limiting points correspond to the point ...

Cayley's cubic surface is the unique cubic surface having four ordinary double points (Hunt), the maximum possible for cubic surface (Endraß). The Cayley cubic is invariant ...

A hexahedron is a polyhedron with six faces. The figure above shows a number of named hexahedra, in particular the acute golden rhombohedron, cube, cuboid, hemicube, ...