Search Results for ""

Let K subset= C be compact, let f be analytic on a neighborhood of K, and let P subset= C^*\K contain at least one point from each connected component of C^*\K. Then for any ...

An attractive compound of three regular tetrahedra can be obtained by taking three tetrahedra with a C_2 axes aligned along the z-axis and rotating them a sixth of a turn ...

The triangular graph T_n=L(K_n) is the line graph of the complete graph K_n (Brualdi and Ryser 1991, p. 152). The vertices of T_n may be identified with the 2-subsets of ...

The Desargues graph is the cubic symmetric graph on 20 vertices and 30 edges illustrated above in several embeddings. It is isomorphic to the generalized Petersen graph ...

A (general) octahedron is a polyhedron having eight faces. Examples include the 4-trapezohedron, augmented triangular prism (Johnson solid J_(49)), bislit cube, Dürer solid, ...

The 57-cell, also called the pentacontaheptachoron, is a regular self-dual locally projective polytope with 57 hemidodecahedral facets described by Coxeter (1982) and also ...

A (general) dodecahedron is a polyhedron having 12 faces. Examples include the Bilinski dodecahedron, decagonal prism, elongated square dipyramid (Johnson solid J_(15)), ...

The pentagonal antiprism is the antiprism having a regular pentagon for the top and bottom bases. It is also the uniform polyhedron with Maeder index 77 (Maeder 1997) and ...

How can a delegation of six regiments, each of which sends a colonel, a lieutenant-colonel, a major, a captain, a lieutenant, and a sub-lieutenant be arranged in a regular ...

The term discrete percolation is used to describe models of percolation theory whose media are discrete sets like sets of regular lattice points (e.g., bond percolation and ...