Norman W. Johnson (November 12, 1930 July 13, 2017) was a mathematician at Wheaton College, Norton, Massachusetts. Johnson was born in Chicago. He earned his undergraduate mathematics degree in 1953 at Carleton College in Northfield, Minnesota, followed by a master's degree from the University of Pittsburgh. He earned his Ph.D. from University of Toronto in 1966 under H. S. M. Coxeter. He taught until his retirement in 1998 in the Mathematics Department of Wheaton College in Massachusetts. Uniform polytopesThis website has been created to bring Johnson's final unpublished work, Uniform Polytopes, into public attention. His 1966 Ph.D thesis has been uploaded here: The Theory of Uniform Polytopes and Honeycombs Johnson's final book Geometries and Transformations was completed in 2017 just before his death and published in 2018. It was taken and expanded from introductory chapters of Uniform Polytopes. A copy of both Uniform Polytopes and Geometries and Transformations are included below in this website. Johnson SolidsIn 1966 Johnson enumerated 92 convex non-uniform polyhedra with regular faces, now called the Johnson solids. The list was proved complete in 1969 by Victor Zalgaller. The final form listed is called a triangular hebesphenorotunda, containing 18 vertices, 36 edges, and 20 faces . It is the only Johnson solid with 3, 4, 5 and 6 sided faces (13 triangles 3 squares 3 pentagons 1 hexagon). Uniform PolyhedraThe list of uniform polyhedra with 75 uniform solutions with families of prism and antiprisms, were first published in 1954 by H.S.M. Coxeter (19072003), M.S. Longuet-Higgins, and J. C. P. Miller. The list was proved complete in 1970 by S.P. Sopov, while J. Skilling in 1975 found one more if coinciding edges are allowed. In 1971, Johnson collaborated with teacher and polyhedral model builder Magnus Wenninger (19192017) in the naming of all of the uniform star polyhedra and duals, adding names for the duals in 1983. Uniform PolychoraBetween 1900 and 1912, Thorold Gosset, Alicia Boole Stott, Pieter Hendrik Schoute, and E. L. Elte began enumerating convex semiregular (archimedean) polytopes above 3 dimensions, most being related to the regular polytopes, 6 in 4-dimensions, now called the 5-cell, tesseract, 16-cell, 24-cell, 120-cell, and 600-cell. Gosset found one special form called a snub 24-cell as the truncated 24-cell with half of the vertices removed with new edges adjusted to be equal length, similar to the snub cube being a truncated cuboctahedron with half of the vertices removed. In 1965 John Horton Conway and Michael Guy proved the complete list of uniform 4-polytopes, identifying one special case, called a grand antiprism. Uniform polychoron projectAfter retirement, Johnson collaborated with amateur mathematicians including George Olshevsky (19462021), Jonathan Bower (1969), Wendy Krieger and Richard Klitzing in a Uniform polychoron project to define terminology and identify and document all star uniform polytopes in 4-dimensions. Olshevsky originally tried the name polychoremata when he publish his list of the Archimedean 4-polytopes in 1997, from Greek choros meaning "room" or "space", and Johnson suggested the shorter name polychoron. For example, the regular 5-cell can also be called a pentachoron, and an 8-cell/tesseract an octachoron. In 2005, Johnson presented a preliminary count of 1845 uniform polychora, with the current count by Bower is 2188 and is not complete. Scaliform polytopes (originally called weakly uniform) were identified from alternations, being vertex-transitive, with regular faces, but not all uniform cells. Cells can include Johnson solids like pyramids and cupolae. Truncation terminologyJohnson extended Johannes Kepler's names for the Archimedean polyhedra into higher dimensions. Most of the convex uniform polytopes can be described as permutations of ringed linear Coxeter-Dynkin diagrams as Wythoffian construction. The nodes of the linear diagrams are labeled 0...n-1. Coxeter's t notation list indices for the ringed nodes. Starting with truncation, t0,1 (cutting vertices) Johnson added cantellation t0,2 (cutting edges, Kepler's rhombi- forms), and runcination (t0,3 cutting faces). (For higher polytopes, a sterication, t0,4 cuts cells.) A uniform polychoron,t0,1,2,3, can be called an omnitruncation, or explicitly a runcicantitruncation. Deeper truncations, like t1,2 is called a bitruncation, and t1,2,3, a bicantitruncation. Single ringed diagrams like t1 are called rectification, making new vertices on mid-edges of original polytope, and t2 is a birectification, with vertices centerd on the original faces. A dual polychoron is a trirectification, t2, with vertices centered on original cells. Johnson followed Coxeter's snub terminology, as an alternated truncation, so Kepler's snub cube is a snub cuboctahedron, as an alternated truncated cuboctahedron. In his PhD thesis, The Theory of Uniform Polytopes and Honeycombs, Johnson defined a new operator holosnub as a generalization of alternation, using letter eszett, ß, working across odd-order branches, retaining all vertices, but connected alternately. A holosnubbed pentagon, ß{5} becomes a pentagram, {5/2}. CircumradiusA finite uniform polytope has all its vertices on an n-sphere. Assuming integer edge lengths, the n-sphere radius is called the circumradius. Vertex figuresAll (finite) uniform polytopes and uniform honeycombs contain a single vertex figure type which exists in a hyperplane. (Skew regular polytopes have skew vertex figures that are not in a hyperplane.) Regular polytopes have regular vertex figures. A regular polytope {p,q,r,s,..y,z} has facets {p,q,r,s,..y}, and vertex figures {q,r,s,..y,z} Rectified regular polytopes have vertex figures as prism as a product of two regular polytopes, seen from the Coxeter diagram, the ringed node is removed, and adjacent nodes are ringed. For example t2{p,q,r,s} has a duoprism vertex figure {p}×{s}, while t1{p,q,r,s} has vertex figure {}×{r,s}. Multiple ringed uniform polytopes have more complex vertex figures, but can be extracted from the Coxeter-Dykin diagram. A dual polytope of a uniform polytope has identical facets, each facet the dual polytope of the vertex figure of the uniform Composite polytopesJohnson defined product, sum, and join operators for constructing higher dimensional polytopes from lower. Johnson defines ( ) as a point (0-polytope), { } is a line segment defined between two points (1-polytope). Many vertex figures for uniform polytopes can be expressed with these operators. A product operator, ×, defines rectangles and prisms with independent proportions. dim(A×B) = dim(A)+dim(B). For instance { } × { } is a rectangle, symmetry [2], (a lower symmetry form of a square), and {4} × { } is a square prism, symmetry [4,2] (a lower symmetry form of a cube), and {4} × {4} is called a duoprism in 4-dimensions, symmetry [4,2,4] (a lower symmetry form of a tesseract). A sum operator, +, makes duals to the prisms. dim(A+B) = dim(A)+dim(B). For instance, { } + { } is a rhombus or fusil in general, symmetry [2], {4} + { } is a square bipyramid, symmetry [4,2] (lower symmetry form of a regular octahedron), and {4} + {4} is called a duopyramid in 4-dimensions, symmetry [4,2,4] (a lower symmetry form of the 16-cell). A join operator, v, makes pyramidal composites, orthogonal orientations with an offset direction as well, with edges between all pairs of vertices across the two. dim(AvB) = dim(A)+dim(B)+1. The isosceles triangle can be seen as ( ) v { }, symmetry [ ], and tetragonal disphenoid is { } v { }, symmetry [2]. Two further operator, , a skew-rhombic sum, and , a skew-rectangular product. dim(AB) = dim(AB) = max(dim(A),dim(B))+1. For example, {3} {3}, and {3} {3}. {} {3} is a cube. A final operator, atop, ||, is similar to join, except the two elements exist in the same space rather than orthogonal. In simple cases, new elements exist on a convex hull of the vertices. dim(A||B) = max(dim(A),dim(B))+1. For example, { } || { } is two parallel line segments, a square or trapezoid. And {3} || t{3} is a triangular cupola. {3} || {3} is a triangular prism, and {3} || dual {3} is a triangular antiprism.
Incidence matricesAn incidence matrix or polytope configuration is a compact description of a regular polytope, with elements ei,j and ej,i as the number of i-faces in contact with j-faces. The diagonal ei,i counts the total number of i-faces. All polytopes can be represented by incidence matrices, except there will be multiple rows and columns for each class of i-face within its symmetry. For example, a scalene triangles has 3 types of edges a,b,c, and 3 types of vertices A,B,C, so has a 6x6 incidence matrix. Having the incidence matrix of a polytope allows a quick summary of the number of elements with it. In practice, they become unwieldy unless a polytope has a very high symmetry. Coxeter notationJohnson worked with Coxeter's bracket notation for symmetry, being a symbolic form of a Coxeter-Dynkin diagram. A cube has Schlafli_symbol {4,3} with octahedral symmetry in brackets [4,3], order 48. The snub cube is sr{4,3}, and chiral octahedral symmetry [4,3]+, order 24. A regular 600-cell is also called {5,3,3} by it Schlafli symbol, and symmetry [5,3,3]. A snub 24-cell can be given different Schläfli symbols: s{3,4,3}, sr{3,3,4}, s{31,1,1}, representing symmetries [3+,4,3], [(3,3)+,4], and [31,1,1]+, order 576, 192, and 96 respectively. The + represents an alternation and cuts the symmetry order in half. The + operator can apply to portions of a Coxeter-Dynkin diagrams with all even-ordered branches. So [3+,4,3+] is an index 4 subgroup of [3,4,3], order 1152. Johnson added a 1+ notation for removing one mirror so [1+,4,3] reduces octahedral symmetry to tetrahedral symmetry [3,3]. This is related to the alternation or half operator on polyhedra. h{4,3}, half cube is one of 2 tetrahedra. Johnson also added a * operator for radial subgroups. It removes all mirrors at a branch, so n* makes an index 2n subgroup. For example, [4,3*] ~ [2,2], removing mirrors at 3-order crossings, index 6, order 8. The generators of a Coxeter group are the mirrors, each node. For example the affine Coxeter group [4,4] has generator mirrors {0,1,2} from its 3 nodes. The group [4,4]+ has rotational generators {01,12,02}, with two generators making the other, while [4+,4+] has generators glide reflection generators {012,120,210}, also with 2 generators making the third one. Johnson also defined trionic operator, which reduced a symmetry by a factor of three. [3,3] ~ [2+,4]. All of the bracket notation markups have equivant markups on the Coxeter-Dynkin diagram directly, with open nodes for alternations and gaps drawn to clarify independent alternations.
Geometries and Transfomation (2018)
Uniform Polytopes (final manuscript)
References
For questions or corrections on this website, you may contact Tom Ruen, tomruen at gmail dot com. Thank you to Roice Nelson for hosting these pages at www.roice3.org. |