|
Cantitruncation
In geometry, an omnitruncation is an operation applied to a regular polytope (or honeycomb) in a Wythoff construction that creates a maximum number of facets. It is represented in a Coxeter–Dynkin diagram with all nodes ringed. It is a ''shortcut'' term which has a different meaning in progressively-higher-dimensional polytopes: * Uniform polytope truncation operators ** For regular polygons: An ordinary truncation, t_\ = t\ = \. *** Coxeter-Dynkin diagram ** For uniform polyhedra (3-polytopes): A cantitruncation, t_\ = tr\. (Application of both cantellation and truncation operations) *** Coxeter-Dynkin diagram: ** For uniform polychora: A runcicantitruncation, t_\. (Application of runcination, cantellation, and truncation operations) *** Coxeter-Dynkin diagram: , , ** For uniform polytera (5-polytopes): A steriruncicantitruncation, t0,1,2,3,4. t_\. (Application of sterication, runcination, cantellation, and truncation operations) *** Coxeter-Dynkin diagram: , , ** ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform 4-polytope
In geometry, a uniform 4-polytope (or uniform polychoron) is a 4-dimensional polytope which is vertex-transitive and whose cells are uniform polyhedra, and faces are regular polygons. There are 47 non-prismatic convex uniform 4-polytopes. There are two infinite sets of convex prismatic forms, along with 17 cases arising as prisms of the convex uniform polyhedra. There are also an unknown number of non-convex star forms. History of discovery * Convex Regular polytopes: ** 1852: Ludwig Schläfli proved in his manuscript ''Theorie der vielfachen Kontinuität'' that there are exactly 6 regular polytopes in 4 dimensions and only 3 in 5 or more dimensions. * Regular star 4-polytopes (star polyhedron cells and/or vertex figures) ** 1852: Ludwig Schläfli also found 4 of the 10 regular star 4-polytopes, discounting 6 with cells or vertex figures and . ** 1883: Edmund Hess completed the list of 10 of the nonconvex regular 4-polytopes, in his book (in German) ''Einleitung in die Leh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform 4-polytope
In geometry, a uniform 4-polytope (or uniform polychoron) is a 4-dimensional polytope which is vertex-transitive and whose cells are uniform polyhedra, and faces are regular polygons. There are 47 non-prismatic convex uniform 4-polytopes. There are two infinite sets of convex prismatic forms, along with 17 cases arising as prisms of the convex uniform polyhedra. There are also an unknown number of non-convex star forms. History of discovery * Convex Regular polytopes: ** 1852: Ludwig Schläfli proved in his manuscript ''Theorie der vielfachen Kontinuität'' that there are exactly 6 regular polytopes in 4 dimensions and only 3 in 5 or more dimensions. * Regular star 4-polytopes (star polyhedron cells and/or vertex figures) ** 1852: Ludwig Schläfli also found 4 of the 10 regular star 4-polytopes, discounting 6 with cells or vertex figures and . ** 1883: Edmund Hess completed the list of 10 of the nonconvex regular 4-polytopes, in his book (in German) ''Einleitung in die Leh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform Polytope
In geometry, a uniform polytope of dimension three or higher is a vertex-transitive polytope bounded by uniform facets. The uniform polytopes in two dimensions are the regular polygons (the definition is different in 2 dimensions to exclude vertex-transitive even-sided polygons that alternate two different lengths of edges). This is a generalization of the older category of ''semiregular'' polytopes, but also includes the regular polytopes. Further, star regular faces and vertex figures ( star polygons) are allowed, which greatly expand the possible solutions. A strict definition requires uniform polytopes to be finite, while a more expansive definition allows uniform honeycombs (2-dimensional tilings and higher dimensional honeycombs) of Euclidean and hyperbolic space to be considered polytopes as well. Operations Nearly every uniform polytope can be generated by a Wythoff construction, and represented by a Coxeter diagram. Notable exceptions include the great dirhombic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sterication
In geometry, a uniform polytope of dimension three or higher is a vertex-transitive polytope bounded by uniform Facet (mathematics), facets. The uniform polytopes in two dimensions are the regular polygons (the definition is different in 2 dimensions to exclude vertex-transitive even-sided polygons that alternate two different lengths of edges). This is a generalization of the older category of semiregular polytope, ''semiregular'' polytopes, but also includes the regular polytopes. Further, star regular faces and vertex figures (star polygons) are allowed, which greatly expand the possible solutions. A strict definition requires uniform polytopes to be finite, while a more expansive definition allows uniform honeycombs (2-dimensional uniform tiling, tilings and higher dimensional Honeycomb (geometry), honeycombs) of Euclidean space, Euclidean and hyperbolic space to be considered polytopes as well. Operations Nearly every uniform polytope can be generated by a Wythoff const ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polyhedra
In geometry, a polyhedron (plural polyhedra or polyhedrons; ) is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices. A convex polyhedron is the convex hull of finitely many points, not all on the same plane. Cubes and pyramids are examples of convex polyhedra. A polyhedron is a 3-dimensional example of a polytope, a more general concept in any number of dimensions. Definition Convex polyhedra are well-defined, with several equivalent standard definitions. However, the formal mathematical definition of polyhedra that are not required to be convex has been problematic. Many definitions of "polyhedron" have been given within particular contexts,. some more rigorous than others, and there is not universal agreement over which of these to choose. Some of these definitions exclude shapes that have often been counted as polyhedra (such as the self-crossing polyhedra) or include shapes that are often not considered as valid polyhed ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Norman Johnson (mathematician)
Norman Woodason Johnson () was a mathematician at Wheaton College, Norton, Massachusetts. Early life and education Norman Johnson was born on in Chicago. His father had a bookstore and published a local newspaper. Johnson earned his undergraduate mathematics degree in 1953 at Carleton College in Northfield, Minnesota followed by a master's degree from the University of Pittsburgh. After graduating in 1953, Johnson did alternative civilian service as a conscientious objector. He earned his PhD from the University of Toronto in 1966 with a dissertation title of ''The Theory of Uniform Polytopes and Honeycombs'' under the supervision of H. S. M. Coxeter. From there, he accepted a position in the Mathematics Department of Wheaton College in Massachusetts and taught until his retirement in 1998. Career In 1966, he enumerated 92 convex non-uniform polyhedra with regular faces. Victor Zalgaller later proved (1969) that Johnson's list was complete, and the set is now known a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Polytopes (book)
''Regular Polytopes'' is a geometry book on regular polytopes written by Harold Scott MacDonald Coxeter. It was originally published by Methuen in 1947 and by Pitman Publishing in 1948, with a second edition published by Macmillan in 1963 and a third edition by Dover Publications in 1973. The Basic Library List Committee of the Mathematical Association of America has recommended that it be included in undergraduate mathematics libraries. Overview The main topics of the book are the Platonic solids (regular convex polyhedra), related polyhedra, and their higher-dimensional generalizations. It has 14 chapters, along with multiple appendices, providing a more complete treatment of the subject than any earlier work, and incorporating material from 18 of Coxeter's own previous papers. It includes many figures (both photographs of models by Paul Donchian and drawings), tables of numerical values, and historical remarks on the subject. The first chapter discusses regular polygons, regula ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Coxeter
Harold Scott MacDonald "Donald" Coxeter, (9 February 1907 – 31 March 2003) was a British and later also Canadian geometer. He is regarded as one of the greatest geometers of the 20th century. Biography Coxeter was born in Kensington to Harold Samuel Coxeter and Lucy (). His father had taken over the family business of Coxeter & Son, manufacturers of surgical instruments and compressed gases (including a mechanism for anaesthetising surgical patients with nitrous oxide), but was able to retire early and focus on sculpting and baritone singing; Lucy Coxeter was a portrait and landscape painter who had attended the Royal Academy of Arts. A maternal cousin was the architect Sir Giles Gilbert Scott. In his youth, Coxeter composed music and was an accomplished pianist at the age of 10. Roberts, Siobhan, ''King of Infinite Space: Donald Coxeter, The Man Who Saved Geometry'', Walker & Company, 2006, He felt that mathematics and music were intimately related, outlining his ide ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Omnitruncated Polyhedron
In geometry, an omnitruncated polyhedron is a truncated quasiregular polyhedron. When they are alternated, they produce the snub polyhedra. All omnitruncated polyhedra are zonohedra. They have Wythoff symbol ''p q r , '' and vertex figures as ''2p.2q.2r''. More generally an omnitruncated polyhedron is a bevel operator in Conway polyhedron notation. List of convex omnitruncated polyhedra There are three convex forms. They can be seen as red faces of one regular polyhedron, yellow or green faces of the dual polyhedron, and blue faces at the truncated vertices of the quasiregular polyhedron. List of nonconvex omnitruncated polyhedra There are 5 nonconvex uniform omnitruncated polyhedra. Other even-sided nonconvex polyhedra There are 8 nonconvex forms with mixed Wythoff symbols ''p q (r s) , '', and bow-tie shaped vertex figures, 2p.2q.-2q.-2p. They are not true omnitruncated polyhedra: the true omnitruncates ''p q r , '' or ''p q s , '' have coinci ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Expansion (geometry)
In geometry, expansion is a polytope operation where facets are separated and moved radially apart, and new facets are formed at separated elements ( vertices, edges, etc.). Equivalently this operation can be imagined by keeping facets in the same position but reducing their size. The expansion of a regular polytope creates a uniform polytope, but the operation can be applied to any convex polytope, as demonstrated for polyhedra in Conway polyhedron notation (which represents expansion with the letter ). For polyhedra, an expanded polyhedron has all the faces of the original polyhedron, all the faces of the dual polyhedron, and new square faces in place of the original edges. Expansion of regular polytopes According to Coxeter, this multidimensional term was defined by Alicia Boole StottCoxeter, ''Regular Polytopes'' (1973), p. 123. p.210 for creating new polytopes, specifically starting from regular polytopes to construct new uniform polytopes. The ''expansion'' operation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform 5-polytope
In geometry, a uniform 5-polytope is a five-dimensional uniform polytope. By definition, a uniform 5-polytope is vertex-transitive and constructed from uniform 4-polytope Facet (geometry), facets. The complete set of convex uniform 5-polytopes has not been determined, but many can be made as Wythoff constructions from a small set of Coxeter groups, symmetry groups. These construction operations are represented by the permutations of rings of the Coxeter diagrams. History of discovery *Regular polytopes: (convex faces) **1852: Ludwig Schläfli proved in his manuscript ''Theorie der vielfachen Kontinuität'' that there are exactly 3 regular polytopes in 5 or more dimensions. *Convex semiregular polytopes: (Various definitions before Coxeter's uniform category) **1900: Thorold Gosset enumerated the list of nonprismatic semiregular convex polytopes with regular facets (convex regular 4-polytopes) in his publication ''On the Regular and Semi-Regular Figures in Space of n Dimension ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Runcination
In geometry, runcination is an operation that cuts a regular polytope (or honeycomb) simultaneously along the faces, edges, and vertices, creating new facets in place of the original face, edge, and vertex centers. It is a higher order truncation operation, following cantellation, and truncation. It is represented by an extended Schläfli symbol t0,3. This operation only exists for 4-polytopes or higher. This operation is dual-symmetric for regular uniform 4-polytopes and 3-space convex uniform honeycombs. For a regular 4-polytope, the original cells remain, but become separated. The gaps at the separated faces become p-gonal prisms. The gaps between the separated edges become r-gonal prisms. The gaps between the separated vertices become cells. The vertex figure for a regular 4-polytope is an ''q''-gonal antiprism (called an ''antipodium'' if ''p'' and ''r'' are different). For regular 4-polytopes/honeycombs, this operation is also called expansion by Alicia Boole Stott ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
