Search Results for ""

There are several theorems that generally are known by the generic name "Pappus's Theorem." They include Pappus's centroid theorem, the Pappus chain, Pappus's harmonic ...

Graham's biggest little hexagon is the largest possible (not necessarily regular) convex hexagon with polygon diameter 1 (i.e., for which no two of the vertices are more than ...

The Tucker circles are a generalization of the cosine circle and first Lemoine circle which can be viewed as a family of circles obtained by parallel displacing sides of the ...

The triangular grid graph T_n is the lattice graph obtained by interpreting the order-(n+1) triangular grid as a graph, with the intersection of grid lines being the vertices ...

Let the number of random walks on a d-D hypercubic lattice starting at the origin which never land on the same lattice point twice in n steps be denoted c_d(n). The first few ...

There are three types of cubic lattices corresponding to three types of cubic close packing, as summarized in the following table. Now that the Kepler conjecture has been ...

A hexagon (not necessarily regular) on whose polygon vertices a circle may be circumscribed. Let sigma_i=Pi_i(a_1^2,a_2^2,a_3^2,a_4^2,a_5^2,a_6^2) (1) denote the ith-order ...

The converse of Pascal's theorem, which states that if the three pairs of opposite sides of (an irregular) hexagon meet at three collinear points, then the six vertices lie ...

The 60 Pascal lines of a hexagon inscribed in a conic section intersect three at a time through 20 Steiner points. There is a dual relationship between the 15 Plücker lines ...

The 20 Cayley lines generated by a hexagon inscribed in a conic section pass four at a time though 15 points known as Salmon points (Wells 1991). There is a dual relationship ...