1.
List of regular polytopes
–
This page lists the regular polytopes and regular polytope compounds in Euclidean, spherical and hyperbolic spaces. The Schläfli symbol describes every regular tessellation of an n-sphere, Euclidean, a Schläfli symbol describing an n-polytope equivalently describes a tessellation of a -sphere. Another related symbol is the Coxeter-Dynkin diagram which represents a group with no rings. For example, the cube has Schläfli symbol, and with its octahedral symmetry, the regular polytopes are grouped by dimension and subgrouped by convex, nonconvex and infinite forms. Nonconvex forms use the same vertices as the forms, but have intersecting facets. Infinite forms tessellate a one-lower-dimensional Euclidean space, infinite forms can be extended to tessellate a hyperbolic space. Hyperbolic space is like normal space at a scale. This allows vertex figures to have negative angle defects, like making a vertex with seven equilateral triangles and it cannot be done in a regular plane, but can be at the right scale of a hyperbolic plane. A more general definition of regular polytopes which do not have simple Schläfli symbols includes regular skew polytopes and this table shows a summary of regular polytope counts by dimension. *1 if the number of dimensions is of the form 2k −1,2 if the number of dimensions is a power of two,0 otherwise, There are no Euclidean regular star tessellations in any number of dimensions. A one-dimensional polytope or 1-polytope is a line segment, bounded by its two endpoints. A 1-polytope is regular by definition and is represented by Schläfli symbol, norman Johnson calls it a ditel and gives it the Schläfli symbol. Although trivial as a polytope, it appears as the edges of polygons and it is used in the definition of uniform prisms like Schläfli symbol ×, or Coxeter diagram as a Cartesian product of a line segment and a regular polygon. The two-dimensional polytopes are called polygons, Regular polygons are equilateral and cyclic. A p-gonal regular polygon is represented by Schläfli symbol, usually only convex polygons are considered regular, but star polygons, like the pentagram, can also be considered regular. They use the same vertices as the forms, but connect in an alternate connectivity which passes around the circle more than once to complete. Star polygons should be called nonconvex rather than concave because the edges do not generate new vertices. The Schläfli symbol represents a regular p-gon, the regular digon can be considered to be a degenerate regular polygon
2.
Uniform polytope
–
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 and this is a generalization of the older category of semiregular polytopes, but also includes the regular polytopes. Further, star regular faces and vertex figures are allowed, which expand the possible solutions. A strict definition requires uniform polytopes to be finite, while a more expansive definition allows uniform honeycombs of Euclidean, nearly every uniform polytope can be generated by a Wythoff construction, and represented by a Coxeter diagram. Notable exceptions include the antiprism in four dimensions. Equivalently, the Wythoffian polytopes can be generated by applying basic operations to the regular polytopes in that dimension and this approach was first used by Johannes Kepler, and is the basis of the Conway polyhedron notation. Regular n-polytopes have n orders of rectification, the zeroth rectification is the original form. The th rectification is the dual, an extended Schläfli symbol can be used for representing rectified forms, with a single subscript, k-th rectification = tk = kr. Truncation operations that can be applied to regular n-polytopes in any combination, the resulting Coxeter diagram has two ringed nodes, and the operation is named for the distance between them. Truncation cuts vertices, cantellation cuts edges, runcination cuts faces, each higher operation also cuts lower ones too, so a cantellation also truncates vertices. T0,1 or t, Truncation - applied to polygons, a truncation removes vertices, and inserts a new facet in place of each former vertex. Faces are truncated, doubling their edges and it can be seen as rectifying its rectification. A cantellation truncates both vertices and edges and replaces them with new facets, cells are replaced by topologically expanded copies of themselves. There are higher cantellations also, bicantellation t1,3 or r2r, tricantellation t2,4 or r3r, quadricantellation t3,5 or r4r, etc. t0,1,2 or tr, Cantitruncation - applied to polyhedra and higher. It can be seen as a truncation of its rectification, a cantitruncation truncates both vertices and edges and replaces them with new facets. Cells are replaced by topologically expanded copies of themselves, runcination truncates vertices, edges, and faces, replacing them each with new facets. 4-faces are replaced by topologically expanded copies of themselves, There are higher runcinations also, biruncination t1,4, triruncination t2,5, etc. t0,4 or 2r2r, Sterication - applied to Uniform 5-polytopes and higher. It can be seen as birectifying its birectification, Sterication truncates vertices, edges, faces, and cells, replacing each with new facets
3.
10-simplex
–
In geometry, a 10-simplex is a self-dual regular 10-polytope. Its dihedral angle is cos−1, or approximately 84. 26° and it can also be called a hendecaxennon, or hendeca-10-tope, as an 11-facetted polytope in 10-dimensions. The name hendecaxennon is derived from hendeca for 11 facets in Greek and -xenn, having 9-dimensional facets and this construction is based on facets of the 11-orthoplex. The 2-skeleton of the 10-simplex is topologically related to the 11-cell abstract regular polychoron which has the same 11 vertices,55 edges, but only 1/3 the faces. Coxeter, Coxeter, Regular Polytopes, Dover edition, ISBN 0-486-61480-8, p.296, Table I, Regular Polytopes, three regular polytopes in n-dimensions H. S. M. Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973, p.296, Table I, Regular Polytopes, Coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, Coxeter, Regular and Semi Regular Polytopes I, H. S. M. Coxeter, Regular and Semi-Regular Polytopes II, H. S. M, johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D. 10D uniform polytopes x3o3o3o3o3o3o3o3o3o - ux, Polytopes of Various Dimensions Multi-dimensional Glossary
4.
Rectified 10-simplex
–
In ten-dimensional geometry, a rectified 10-simplex is a convex uniform 10-polytope, being a rectification of the regular 10-simplex. These polytopes are part of a family of 527 uniform 10-polytopes with A10 symmetry, there are unique 5 degrees of rectifications including the zeroth, the 10-simplex itself. Vertices of the rectified 10-simplex are located at the edge-centers of the 10-simplex, vertices of the birectified 10-simplex are located in the triangular face centers of the 10-simplex. Vertices of the trirectified 10-simplex are located in the cell centers of the 10-simplex. Vertices of the quadrirectified 10-simplex are located in the 5-cell centers of the 10-simplex, the rectified 10-simplex is the vertex figure of the 11-demicube. Rectified hendecaxennon The Cartesian coordinates of the vertices of the rectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the rectified 11-orthoplex. Birectified hendecaxennon The Cartesian coordinates of the vertices of the birectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the birectified 11-orthoplex. Trirectified hendecaxennon The Cartesian coordinates of the vertices of the trirectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the triirectified 11-orthoplex. Quadrirectified hendecaxennon The Cartesian coordinates of the vertices of the quadrirectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the quadrirectified 11-orthoplex. Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, coxeter, Regular and Semi Regular Polytopes I, H. S. M. Coxeter, Regular and Semi-Regular Polytopes II, H. S. M, coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Manuscript N. W. Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D, x3o3o3o3o3o3o3o3o3o - ux, o3x3o3o3o3o3o3o3o3o - ru, o3o3x3o3o3o3o3o3o3o - bru, o3o3o3x3o3o3o3o3o3o - tru, o3o3o3o3x3o3o3o3o3o - teru Olshevsky, George. Archived from the original on 4 February 2007, Polytopes of Various Dimensions Multi-dimensional Glossary
5.
10-orthoplex
–
It has two constructed forms, the first being regular with Schläfli symbol, and the second with alternately labeled facets, with Schläfli symbol or Coxeter symbol 711. It is one of an family of polytopes, called cross-polytopes or orthoplexes. The dual polytope is the 10-hypercube or 10-cube, decacross is derived from combining the family name cross polytope with deca for ten in Greek Chilliaicositetraxennon as a 1024-facetted 10-polytope. Cartesian coordinates for the vertices of a 10-orthoplex, centred at the origin are, Every vertex pair is connected by an edge, Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, Selected Writings of H. S. M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M. Coxeter, Regular and Semi Regular Polytopes I, H. S. M, Coxeter, Regular and Semi-Regular Polytopes II, H. S. M. Coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D. 10D uniform polytopes x3o3o3o3o3o3o3o3o4o - ka, archived from the original on 4 February 2007. Polytopes of Various Dimensions Multi-dimensional Glossary
6.
Rectified 10-orthoplex
–
In ten-dimensional geometry, a rectified 10-orthoplex is a convex uniform 10-polytope, being a rectification of the regular 10-orthoplex. There are 10 rectifications of the 10-orthoplex, vertices of the rectified 10-orthoplex are located at the edge-centers of the 9-orthoplex. Vertices of the birectified 10-orthoplex are located in the face centers of the 10-orthoplex. Vertices of the trirectified 10-orthoplex are located in the cell centers of the 10-orthoplex. These polytopes are part of a family 1023 uniform 10-polytopes with BC10 symmetry, in ten-dimensional geometry, a rectified 10-orthoplex is a 10-polytope, being a rectification of the regular 10-orthoplex. The rectified 10-orthoplex is the figure for the demidekeractic honeycomb. The vertices can be seen in 3 hyperplanes, with the 45 vertices rectified 9-simplices facets on opposite sides, when combined with the 20 vertices of the 9-orthoplex, these vertices represent the 200 root vectors of the simple Lie group B10. S. M. Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, coxeter, Regular and Semi Regular Polytopes I, H. S. M. Coxeter, Regular and Semi-Regular Polytopes II, H. S. M, coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Manuscript N. W. Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D, archived from the original on 4 February 2007. Polytopes of Various Dimensions Multi-dimensional Glossary
7.
10-cube
–
In geometry, a 10-cube is a ten-dimensional hypercube. It can be named by its Schläfli symbol, being composed of 3 9-cubes around each 8-face and it is a part of an infinite family of polytopes, called hypercubes. The dual of a dekeract can be called a 10-orthoplex or decacross, cartesian coordinates for the vertices of a dekeract centered at the origin and edge length 2 are while the interior of the same consists of all points with −1 < xi <1. Applying an alternation operation, deleting alternating vertices of the dekeract, creates another uniform polytope, called a 10-demicube, which has 20 demienneractic and 512 enneazettonic facets. Coxeter, Coxeter, Regular Polytopes, Dover edition, ISBN 0-486-61480-8, p.296, Table I, Regular Polytopes, three regular polytopes in n-dimensions H. S. M. Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973, p.296, Table I, Regular Polytopes, Coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, Coxeter, Regular and Semi Regular Polytopes I, H. S. M. Coxeter, Regular and Semi-Regular Polytopes II, H. S. M, Coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Manuscript N. W. Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D, 10D uniform polytopes o3o3o3o3o3o3o3o3o4x - deker. Archived from the original on 4 February 2007, multi-dimensional Glossary, hypercube Garrett Jones Sloanes A135289, Hypercubes, 10-cube. The On-Line Encyclopedia of Integer Sequences
8.
Rectified 10-cube
–
In ten-dimensional geometry, a rectified 10-cube is a convex uniform 10-polytope, being a rectification of the regular 10-cube. There are 10 rectifications of the 10-cube, with the zeroth being the 10-cube itself, vertices of the rectified 10-cube are located at the edge-centers of the 10-cube. Vertices of the birectified 10-cube are located in the face centers of the 10-cube. Vertices of the trirectified 10-cube are located in the cell centers of the 10-cube. The others are simply constructed relative to the 10-cube dual polytpoe. These polytopes are part of a family 1023 uniform 10-polytopes with BC10 symmetry. S. M, coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, Selected Writings of H. S. M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M. Coxeter, Regular and Semi Regular Polytopes I, H. S. M, coxeter, Regular and Semi-Regular Polytopes II, H. S. M. Coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D. Archived from the original on 4 February 2007, Polytopes of Various Dimensions Multi-dimensional Glossary
9.
10-demicube
–
In geometry, a 10-demicube or demidekeract is a uniform 10-polytope, constructed from the 10-cube with alternated vertices truncated. It is part of an infinite family of uniform polytopes called demihypercubes. E. L. Elte identified it in 1912 as a semiregular polytope, Coxeter named this polytope as 171 from its Coxeter diagram, with a ring on one of the 1-length branches, and Schläfli symbol or. Cartesian coordinates for the vertices of a demidekeract centered at the origin are alternate halves of the dekeract, with an odd number of plus signs. Coxeter, Coxeter, Regular Polytopes, Dover edition, ISBN 0-486-61480-8, p.296, Table I, Regular Polytopes, three regular polytopes in n-dimensions H. S. M. Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973, p.296, Table I, Regular Polytopes, Coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, Coxeter, Regular and Semi Regular Polytopes I, H. S. M. Coxeter, Regular and Semi-Regular Polytopes II, H. S. M, johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D. 10D uniform polytopes x3o3o *b3o3o3o3o3o3o3o - hede, archived from the original on 4 February 2007
10.
Geometry
–
Geometry is a branch of mathematics concerned with questions of shape, size, relative position of figures, and the properties of space. A mathematician who works in the field of geometry is called a geometer, Geometry arose independently in a number of early cultures as a practical way for dealing with lengths, areas, and volumes. Geometry began to see elements of mathematical science emerging in the West as early as the 6th century BC. By the 3rd century BC, geometry was put into a form by Euclid, whose treatment, Euclids Elements. Geometry arose independently in India, with texts providing rules for geometric constructions appearing as early as the 3rd century BC, islamic scientists preserved Greek ideas and expanded on them during the Middle Ages. By the early 17th century, geometry had been put on a solid footing by mathematicians such as René Descartes. Since then, and into modern times, geometry has expanded into non-Euclidean geometry and manifolds, while geometry has evolved significantly throughout the years, there are some general concepts that are more or less fundamental to geometry. These include the concepts of points, lines, planes, surfaces, angles, contemporary geometry has many subfields, Euclidean geometry is geometry in its classical sense. The mandatory educational curriculum of the majority of nations includes the study of points, lines, planes, angles, triangles, congruence, similarity, solid figures, circles, Euclidean geometry also has applications in computer science, crystallography, and various branches of modern mathematics. Differential geometry uses techniques of calculus and linear algebra to problems in geometry. It has applications in physics, including in general relativity, topology is the field concerned with the properties of geometric objects that are unchanged by continuous mappings. In practice, this often means dealing with large-scale properties of spaces, convex geometry investigates convex shapes in the Euclidean space and its more abstract analogues, often using techniques of real analysis. It has close connections to convex analysis, optimization and functional analysis, algebraic geometry studies geometry through the use of multivariate polynomials and other algebraic techniques. It has applications in areas, including cryptography and string theory. Discrete geometry is concerned mainly with questions of relative position of simple objects, such as points. It shares many methods and principles with combinatorics, Geometry has applications to many fields, including art, architecture, physics, as well as to other branches of mathematics. The earliest recorded beginnings of geometry can be traced to ancient Mesopotamia, the earliest known texts on geometry are the Egyptian Rhind Papyrus and Moscow Papyrus, the Babylonian clay tablets such as Plimpton 322. For example, the Moscow Papyrus gives a formula for calculating the volume of a truncated pyramid, later clay tablets demonstrate that Babylonian astronomers implemented trapezoid procedures for computing Jupiters position and motion within time-velocity space
11.
Polytope
–
In elementary geometry, a polytope is a geometric object with flat sides, and may exist in any general number of dimensions n as an n-dimensional polytope or n-polytope. For example, a polygon is a 2-polytope and a three-dimensional polyhedron is a 3-polytope. Polytopes in more than three dimensions were first discovered by Ludwig Schläfli, the German term polytop was coined by the mathematician Reinhold Hoppe, and was introduced to English mathematicians as polytope by Alicia Boole Stott. The term polytope is nowadays a broad term that covers a class of objects. Many of these definitions are not equivalent, resulting in different sets of objects being called polytopes and they represent different approaches to generalizing the convex polytopes to include other objects with similar properties. In this approach, a polytope may be regarded as a tessellation or decomposition of some given manifold, an example of this approach defines a polytope as a set of points that admits a simplicial decomposition. However this definition does not allow star polytopes with interior structures, the discovery of star polyhedra and other unusual constructions led to the idea of a polyhedron as a bounding surface, ignoring its interior. A polyhedron is understood as a surface whose faces are polygons, a 4-polytope as a hypersurface whose facets are polyhedra and this approach is used for example in the theory of abstract polytopes. In certain fields of mathematics, the terms polytope and polyhedron are used in a different sense and this terminology is typically confined to polytopes and polyhedra that are convex. A polytope comprises elements of different dimensionality such as vertices, edges, faces, cells, terminology for these is not fully consistent across different authors. For example, some authors use face to refer to an -dimensional element while others use face to denote a 2-face specifically, authors may use j-face or j-facet to indicate an element of j dimensions. Some use edge to refer to a ridge, while H. S. M. Coxeter uses cell to denote an -dimensional element, the terms adopted in this article are given in the table below, An n-dimensional polytope is bounded by a number of -dimensional facets. These facets are themselves polytopes, whose facets are -dimensional ridges of the original polytope, Every ridge arises as the intersection of two facets. Ridges are once again polytopes whose facets give rise to -dimensional boundaries of the original polytope and these bounding sub-polytopes may be referred to as faces, or specifically j-dimensional faces or j-faces. A 0-dimensional face is called a vertex, and consists of a single point, a 1-dimensional face is called an edge, and consists of a line segment. A 2-dimensional face consists of a polygon, and a 3-dimensional face, sometimes called a cell, the convex polytopes are the simplest kind of polytopes, and form the basis for several different generalizations of the concept of polytopes. A convex polytope is defined as the intersection of a set of half-spaces. This definition allows a polytope to be neither bounded nor finite, Polytopes are defined in this way, e. g. in linear programming
12.
9-polytope
–
In nine-dimensional geometry, a nine-dimensional polytope or 9-polytope is a polytope contained by 8-polytope facets. Each 7-polytope ridge being shared by exactly two 8-polytope facets, a uniform 9-polytope is one which is vertex-transitive, and constructed from uniform 8-polytope facets. Regular 9-polytopes can be represented by the Schläfli symbol, with w 8-polytope facets around each peak, There are exactly three such convex regular 9-polytopes, - 9-simplex - 9-cube - 9-orthoplex There are no nonconvex regular 9-polytopes. The topology of any given 9-polytope is defined by its Betti numbers, the value of the Euler characteristic used to characterise polyhedra does not generalize usefully to higher dimensions, whatever their underlying topology. This inadequacy of the Euler characteristic to distinguish between different topologies in higher dimensions led to the discovery of the more sophisticated Betti numbers. Similarly, the notion of orientability of a polyhedron is insufficient to characterise the surface twistings of toroidal polytopes, - 9-orthoplex,611 - The A9 family has symmetry of order 3628800. There are 256+16-1=271 forms based on all permutations of the Coxeter-Dynkin diagrams with one or more rings, bowers-style acronym names are given in parentheses for cross-referencing. There are 511 forms based on all permutations of the Coxeter-Dynkin diagrams with one or more rings, eleven cases are shown below, Nine rectified forms and 2 truncations. Bowers-style acronym names are given in parentheses for cross-referencing, bowers-style acronym names are given in parentheses for cross-referencing. The D9 family has symmetry of order 92,897,280 and this family has 3×128−1=383 Wythoffian uniform polytopes, generated by marking one or more nodes of the D9 Coxeter-Dynkin diagram. Of these,255 are repeated from the B9 family and 128 are unique to this family, bowers-style acronym names are given in parentheses for cross-referencing. However, there are 4 noncompact hyperbolic Coxeter groups of rank 9, T. Gosset, On the Regular and Semi-Regular Figures in Space of n Dimensions, Messenger of Mathematics, Macmillan,1900 A. S. M. Miller, Uniform Polyhedra, Philosophical Transactions of the Royal Society of London, Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, Selected Writings of H. S. M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M. Coxeter, Regular and Semi Regular Polytopes I, H. S. M, Coxeter, Regular and Semi-Regular Polytopes II, H. S. M. Coxeter, Regular and Semi-Regular Polytopes III, N. W, johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D. Dissertation, University of Toronto,1966 Klitzing, Richard, polytope names Polytopes of Various Dimensions, Jonathan Bowers Multi-dimensional Glossary Glossary for hyperspace, George Olshevsky
13.
8-polytope
–
In eight-dimensional geometry, an eight-dimensional polytope or 8-polytope is a polytope contained by 7-polytope facets. Each 6-polytope ridge being shared by exactly two 7-polytope facets, a uniform 8-polytope is one which is vertex-transitive, and constructed from uniform 7-polytope facets. Regular 8-polytopes can be represented by the Schläfli symbol, with v 7-polytope facets around each peak, There are exactly three such convex regular 8-polytopes, - 8-simplex - 8-cube - 8-orthoplex There are no nonconvex regular 8-polytopes. The topology of any given 8-polytope is defined by its Betti numbers, the value of the Euler characteristic used to characterise polyhedra does not generalize usefully to higher dimensions, and is zero for all 8-polytopes, whatever their underlying topology. This inadequacy of the Euler characteristic to distinguish between different topologies in higher dimensions led to the discovery of the more sophisticated Betti numbers. Similarly, the notion of orientability of a polyhedron is insufficient to characterise the surface twistings of toroidal polytopes, There are 135 forms based on all permutations of the Coxeter-Dynkin diagrams with one or more rings. Bowers-style acronym names are given in parentheses for cross-referencing, see also a list of 8-simplex polytopes for symmetric Coxeter plane graphs of these polytopes. The B8 family has symmetry of order 10321920, There are 255 forms based on all permutations of the Coxeter-Dynkin diagrams with one or more rings. See also a list of B8 polytopes for symmetric Coxeter plane graphs of these polytopes, the D8 family has symmetry of order 5,160,960. This family has 191 Wythoffian uniform polytopes, from 3x64-1 permutations of the D8 Coxeter-Dynkin diagram with one or more rings,127 are repeated from the B8 family and 64 are unique to this family, all listed below. See list of D8 polytopes for Coxeter plane graphs of these polytopes, the E8 family has symmetry order 696,729,600. There are 255 forms based on all permutations of the Coxeter-Dynkin diagrams with one or more rings, eight forms are shown below,4 single-ringed,3 truncations, and the final omnitruncation are given below. Bowers-style acronym names are given for cross-referencing, see also list of E8 polytopes for Coxeter plane graphs of this family. However, there are 4 noncompact hyperbolic Coxeter groups of rank 8, T. Gosset, On the Regular and Semi-Regular Figures in Space of n Dimensions, Messenger of Mathematics, Macmillan,1900 A. S. M. Miller, Uniform Polyhedra, Philosophical Transactions of the Royal Society of London, Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, Selected Writings of H. S. M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 Wiley, Kaleidoscopes, Selected Writings of H. S. M. Coxeter, Regular and Semi Regular Polytopes I, H. S. M, Coxeter, Regular and Semi-Regular Polytopes II, H. S. M. Coxeter, Regular and Semi-Regular Polytopes III, N. W, johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D
14.
Ridge (geometry)
–
In solid geometry, a face is a flat surface that forms part of the boundary of a solid object, a three-dimensional solid bounded exclusively by flat faces is a polyhedron. In more technical treatments of the geometry of polyhedra and higher-dimensional polytopes, in elementary geometry, a face is a polygon on the boundary of a polyhedron. Other names for a polygonal face include side of a polyhedron, for example, any of the six squares that bound a cube is a face of the cube. Sometimes face is used to refer to the 2-dimensional features of a 4-polytope. With this meaning, the 4-dimensional tesseract has 24 square faces, some other polygons, which are not faces, are also important for polyhedra and tessellations. These include Petrie polygons, vertex figures and facets, any convex polyhedrons surface has Euler characteristic V − E + F =2, where V is the number of vertices, E is the number of edges, and F is the number of faces. This equation is known as Eulers polyhedron formula, thus the number of faces is 2 more than the excess of the number of edges over the number of vertices. For example, a cube has 12 edges and 8 vertices, in higher-dimensional geometry the faces of a polytope are features of all dimensions. A face of dimension k is called a k-face, for example, the polygonal faces of an ordinary polyhedron are 2-faces. In set theory, the set of faces of a polytope includes the polytope itself, for any n-polytope, −1 ≤ k ≤ n. For example, with meaning, the faces of a cube include the empty set, its vertices, edges and squares. Formally, a face of a polytope P is the intersection of P with any closed halfspace whose boundary is disjoint from the interior of P, from this definition it follows that the set of faces of a polytope includes the polytope itself and the empty set. In other areas of mathematics, such as the theories of abstract polytopes and star polytopes, abstract theory still requires that the set of faces include the polytope itself and the empty set. A cell is an element of a 4-dimensional polytope or 3-dimensional tessellation. Cells are facets for 4-polytopes and 3-honeycombs, examples, In higher-dimensional geometry, the facets of a n-polytope are the -faces of dimension one less than the polytope itself. A polytope is bounded by its facets, for example, The facets of a line segment are its 0-faces or vertices. The facets of a polygon are its 1-faces or edges, the facets of a polyhedron or plane tiling are its 2-faces. The facets of a 4D polytope or 3-honeycomb are its 3-faces, the facets of a 5D polytope or 4-honeycomb are its 4-faces
15.
Vertex-transitive
–
In geometry, a polytope is isogonal or vertex-transitive if, loosely speaking, all its vertices are equivalent. That implies that each vertex is surrounded by the kinds of face in the same or reverse order. Technically, we say that for any two vertices there exists a symmetry of the polytope mapping the first isometrically onto the second. Other ways of saying this are that the group of automorphisms of the polytope is transitive on its vertices, all vertices of a finite n-dimensional isogonal figure exist on an -sphere. The term isogonal has long used for polyhedra. Vertex-transitive is a synonym borrowed from modern ideas such as symmetry groups, all regular polygons, apeirogons and regular star polygons are isogonal. The dual of a polygon is an isotoxal polygon. Some even-sided polygons and apeirogons which alternate two edge lengths, for example a rectangle, are isogonal, all planar isogonal 2n-gons have dihedral symmetry with reflection lines across the mid-edge points. An isogonal polyhedron and 2D tiling has a kind of vertex. An isogonal polyhedron with all faces is also a uniform polyhedron. Geometrically distorted variations of uniform polyhedra and tilings can also be given the vertex configuration, isogonal polyhedra and 2D tilings may be further classified, Regular if it is also isohedral and isotoxal, this implies that every face is the same kind of regular polygon. Quasi-regular if it is also isotoxal but not isohedral, semi-regular if every face is a regular polygon but it is not isohedral or isotoxal. Uniform if every face is a polygon, i. e. it is regular, quasiregular or semi-regular. Noble if it is also isohedral and these definitions can be extended to higher-dimensional polytopes and tessellations. Most generally, all uniform polytopes are isogonal, for example, the dual of an isogonal polytope is called an isotope which is transitive on its facets. A polytope or tiling may be called if its vertices form k transitivity classes. A more restrictive term, k-uniform is defined as a figure constructed only from regular polygons. They can be represented visually with colors by different uniform colorings, edge-transitive Face-transitive Peter R. Cromwell, Polyhedra, Cambridge University Press 1997, ISBN 0-521-55432-2, p.369 Transitivity Grünbaum, Branko, Shephard, G. C
16.
Uniform 9-polytope
–
In nine-dimensional geometry, a nine-dimensional polytope or 9-polytope is a polytope contained by 8-polytope facets. Each 7-polytope ridge being shared by exactly two 8-polytope facets, a uniform 9-polytope is one which is vertex-transitive, and constructed from uniform 8-polytope facets. Regular 9-polytopes can be represented by the Schläfli symbol, with w 8-polytope facets around each peak, There are exactly three such convex regular 9-polytopes, - 9-simplex - 9-cube - 9-orthoplex There are no nonconvex regular 9-polytopes. The topology of any given 9-polytope is defined by its Betti numbers, the value of the Euler characteristic used to characterise polyhedra does not generalize usefully to higher dimensions, whatever their underlying topology. This inadequacy of the Euler characteristic to distinguish between different topologies in higher dimensions led to the discovery of the more sophisticated Betti numbers. Similarly, the notion of orientability of a polyhedron is insufficient to characterise the surface twistings of toroidal polytopes, - 9-orthoplex,611 - The A9 family has symmetry of order 3628800. There are 256+16-1=271 forms based on all permutations of the Coxeter-Dynkin diagrams with one or more rings, bowers-style acronym names are given in parentheses for cross-referencing. There are 511 forms based on all permutations of the Coxeter-Dynkin diagrams with one or more rings, eleven cases are shown below, Nine rectified forms and 2 truncations. Bowers-style acronym names are given in parentheses for cross-referencing, bowers-style acronym names are given in parentheses for cross-referencing. The D9 family has symmetry of order 92,897,280 and this family has 3×128−1=383 Wythoffian uniform polytopes, generated by marking one or more nodes of the D9 Coxeter-Dynkin diagram. Of these,255 are repeated from the B9 family and 128 are unique to this family, bowers-style acronym names are given in parentheses for cross-referencing. However, there are 4 noncompact hyperbolic Coxeter groups of rank 9, T. Gosset, On the Regular and Semi-Regular Figures in Space of n Dimensions, Messenger of Mathematics, Macmillan,1900 A. S. M. Miller, Uniform Polyhedra, Philosophical Transactions of the Royal Society of London, Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, Selected Writings of H. S. M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M. Coxeter, Regular and Semi Regular Polytopes I, H. S. M, Coxeter, Regular and Semi-Regular Polytopes II, H. S. M. Coxeter, Regular and Semi-Regular Polytopes III, N. W, johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D. Dissertation, University of Toronto,1966 Klitzing, Richard, polytope names Polytopes of Various Dimensions, Jonathan Bowers Multi-dimensional Glossary Glossary for hyperspace, George Olshevsky
17.
Peak (geometry)
–
In solid geometry, a face is a flat surface that forms part of the boundary of a solid object, a three-dimensional solid bounded exclusively by flat faces is a polyhedron. In more technical treatments of the geometry of polyhedra and higher-dimensional polytopes, in elementary geometry, a face is a polygon on the boundary of a polyhedron. Other names for a polygonal face include side of a polyhedron, for example, any of the six squares that bound a cube is a face of the cube. Sometimes face is used to refer to the 2-dimensional features of a 4-polytope. With this meaning, the 4-dimensional tesseract has 24 square faces, some other polygons, which are not faces, are also important for polyhedra and tessellations. These include Petrie polygons, vertex figures and facets, any convex polyhedrons surface has Euler characteristic V − E + F =2, where V is the number of vertices, E is the number of edges, and F is the number of faces. This equation is known as Eulers polyhedron formula, thus the number of faces is 2 more than the excess of the number of edges over the number of vertices. For example, a cube has 12 edges and 8 vertices, in higher-dimensional geometry the faces of a polytope are features of all dimensions. A face of dimension k is called a k-face, for example, the polygonal faces of an ordinary polyhedron are 2-faces. In set theory, the set of faces of a polytope includes the polytope itself, for any n-polytope, −1 ≤ k ≤ n. For example, with meaning, the faces of a cube include the empty set, its vertices, edges and squares. Formally, a face of a polytope P is the intersection of P with any closed halfspace whose boundary is disjoint from the interior of P, from this definition it follows that the set of faces of a polytope includes the polytope itself and the empty set. In other areas of mathematics, such as the theories of abstract polytopes and star polytopes, abstract theory still requires that the set of faces include the polytope itself and the empty set. A cell is an element of a 4-dimensional polytope or 3-dimensional tessellation. Cells are facets for 4-polytopes and 3-honeycombs, examples, In higher-dimensional geometry, the facets of a n-polytope are the -faces of dimension one less than the polytope itself. A polytope is bounded by its facets, for example, The facets of a line segment are its 0-faces or vertices. The facets of a polygon are its 1-faces or edges, the facets of a polyhedron or plane tiling are its 2-faces. The facets of a 4D polytope or 3-honeycomb are its 3-faces, the facets of a 5D polytope or 4-honeycomb are its 4-faces
18.
Betti number
–
In algebraic topology, the Betti numbers are used to distinguish topological spaces based on the connectivity of n-dimensional simplicial complexes. For the most reasonable finite-dimensional spaces, the sequence of Betti numbers is 0 from some point onward and these numbers are used today in fields such as simplicial homology, computer science, digital images, etc. The term Betti numbers was coined by Henri Poincaré after Enrico Betti, informally, the kth Betti number refers to the number of k-dimensional holes on a topological surface. Closely related to the Betti numbers of a surface is the Poincaré polynomial of that surface. The Poincaré polynomial of a surface is defined to be the function of its Betti numbers. For example, the Betti numbers of the torus are 1,2, the same definition applies to any topological space which has a finitely generated homology. The two-dimensional Betti numbers are easier to understand because we see the world in 0,1,2, the following Betti numbers are higher-dimensional than apparent physical space. For a non-negative integer k, the kth Betti number bk of the space X is defined as the rank of the abelian group Hk, the kth homology group of X. The kth homology group is H k = ker δ k / I m δ k +1, the δ k s are the maps of the simplicial complex. Equivalently, one can define it as the space dimension of Hk since the homology group in this case is a vector space over Q. The universal coefficient theorem, in a very simple torsion-free case, more generally, given a field F one can define bk, the kth Betti number with coefficients in F, as the vector space dimension of Hk. Let us go through an example of how to compute the Betti numbers for a simplicial complex. Here we have a complex with 0-simplices, a, b, c, and d, 1-simplices, E, F, G, H and I, and the only 2-simplex is J. It is clear there is one connected component in this figure, one hole, which is the unshaded region. This means that the rank of H0 is 1, the rank of H1 is 1, the Betti number sequence for this figure is 1,1,0,0. The Poincaré polynomial is 1 + x In topological graph theory the first Betti number of a graph G with n vertices, m edges and this may be proved straightforwardly by mathematical induction on the number of edges. A new edge either increments the number of 1-cycles or decrements the number of connected components, the first Betti number is also called the cyclomatic number—a term introduced by Gustav Kirchhoff before Bettis paper. See cyclomatic complexity for an application to software engineering, the zero-th Betti number of a graph is simply the number of connected components k
19.
Torsion coefficient (topology)
–
In mathematics, homology is a general way of associating a sequence of algebraic objects such as abelian groups or modules to other mathematical objects such as topological spaces. Homology groups were defined in algebraic topology. Similar constructions are available in a variety of other contexts, such as abstract algebra, groups, Lie algebras, Galois theory. The original motivation for defining homology groups was the observation that two shapes can be distinguished by examining their holes, however, because a hole is not there, it is not immediately obvious how to define a hole or how to distinguish different kinds of holes. Homology was originally a rigorous mathematical method for defining and categorizing holes in a manifold, loosely speaking, a cycle is a closed submanifold, a boundary is the boundary of a submanifold with boundary, and a homology class is an equivalence class of cycles modulo boundaries. There are many different homology theories, a particular type of mathematical object, such as a topological space or a group, may have one or more associated homology theories. When the underlying object has an interpretation like topological spaces do. In general, most homology groups or modules arise as derived functors on appropriate abelian categories and they provide concrete descriptions of the failure of a functor to be exact. From this abstract perspective, homology groups are determined by objects of a derived category, Homology theory can be said to start with the Euler polyhedron formula, or Euler characteristic. This was followed by Riemanns definition of genus and n-fold connectedness numerical invariants in 1857 and these cycles are also sometimes thought of as cuts which can be glued back together, or as zippers which can be fastened and unfastened. For example, a line drawn on a surface represents a 1-cycle, on the ordinary sphere S2, the cycle b in the diagram can be shrunk to the pole and even the equatorial great circle a can be shrunk in the same way. The Jordan curve theorem shows that any arbitrary cycle such as c can be shrunk to a point. All cycles on the sphere can therefore be continuously transformed into each other and they are said to be homologous to zero. Cutting a manifold along a cycle homologous to zero separates the manifold into two or more components, for example, cutting the sphere along a produces two hemispheres. This is not generally true of cycles on other surfaces, the torus T2 has cycles which cannot be continuously deformed into each other, for example in the diagram none of the cycles a, b or c can be. Cycles a and b cannot be shrunk significantly, cycle c can be shrunk to a point, so it is homologous to zero. If the torus surface is cut along both a and b, it can be opened out and flattened into a rectangle or, more conveniently, one opposite pair of sides represents the cut along a, and the other opposite pair represents the cut along b. The edges of the square may then be glued together in different ways
20.
Euler characteristic
–
It is commonly denoted by χ. The Euler characteristic was originally defined for polyhedra and used to prove theorems about them. Leonhard Euler, for whom the concept is named, was responsible for much of early work. In modern mathematics, the Euler characteristic arises from homology and, more abstractly, any convex polyhedrons surface has Euler characteristic V − E + F =2. This equation is known as Eulers polyhedron formula and it corresponds to the Euler characteristic of the sphere, and applies identically to spherical polyhedra. An illustration of the formula on some polyhedra is given below and this version holds both for convex polyhedra and the non-convex Kepler-Poinsot polyhedra. Projective polyhedra all have Euler characteristic 1, like the real plane, while the surfaces of toroidal polyhedra all have Euler characteristic 0. The Euler characteristic can be defined for connected plane graphs by the same V − E + F formula as for polyhedral surfaces, the Euler characteristic of any plane connected graph G is 2. This is easily proved by induction on the number of determined by G. For trees, E = V −1 and F =1, if G has C components, the same argument by induction on F shows that V − E + F − C =1. One of the few graph theory papers of Cauchy also proves this result, via stereographic projection the plane maps to the two-dimensional sphere, such that a connected graph maps to a polygonal decomposition of the sphere, which has Euler characteristic 2. This viewpoint is implicit in Cauchys proof of Eulers formula given below, there are many proofs of Eulers formula. One was given by Cauchy in 1811, as follows and it applies to any convex polyhedron, and more generally to any polyhedron whose boundary is topologically equivalent to a sphere and whose faces are topologically equivalent to disks. Remove one face of the polyhedral surface, after this deformation, the regular faces are generally not regular anymore. The number of vertices and edges has remained the same, therefore, proving Eulers formula for the polyhedron reduces to proving V − E + F =1 for this deformed, planar object. If there is a face more than three sides, draw a diagonal—that is, a curve through the face connecting two vertices that arent connected yet. This adds one edge and one face and does not change the number of vertices, continue adding edges in this manner until all of the faces are triangular. This decreases the number of edges and faces by one each and does not change the number of vertices, remove a triangle with two edges shared by the exterior of the network, as illustrated by the third graph
21.
Coxeter-Dynkin diagram
–
In geometry, a Coxeter–Dynkin diagram is a graph with numerically labeled edges representing the spatial relations between a collection of mirrors. It describes a kaleidoscopic construction, each node represents a mirror. An unlabeled branch implicitly represents order-3, each diagram represents a Coxeter group, and Coxeter groups are classified by their associated diagrams. Dynkin diagrams correspond to and are used to root systems. Branches of a Coxeter–Dynkin diagram are labeled with a number p. When p =2 the angle is 90° and the mirrors have no interaction, if a branch is unlabeled, it is assumed to have p =3, representing an angle of 60°. Two parallel mirrors have a branch marked with ∞, in principle, n mirrors can be represented by a complete graph in which all n /2 branches are drawn. In practice, nearly all interesting configurations of mirrors include a number of right angles, diagrams can be labeled by their graph structure. The first forms studied by Ludwig Schläfli are the orthoschemes which have linear graphs that generate regular polytopes, plagioschemes are simplices represented by branching graphs, and cycloschemes are simplices represented by cyclic graphs. Every Coxeter diagram has a corresponding Schläfli matrix with matrix elements ai, j = aj, as a matrix of cosines, it is also called a Gramian matrix after Jørgen Pedersen Gram. All Coxeter group Schläfli matrices are symmetric because their root vectors are normalized. It is related closely to the Cartan matrix, used in the similar but directed graph Dynkin diagrams in the cases of p =2,3,4, and 6. The determinant of the Schläfli matrix, called the Schläflian, and its sign determines whether the group is finite, affine and this rule is called Schläflis Criterion. The eigenvalues of the Schläfli matrix determines whether a Coxeter group is of type, affine type. The indefinite type is further subdivided, e. g. into hyperbolic. However, there are multiple non-equivalent definitions for hyperbolic Coxeter groups and we use the following definition, A Coxeter group with connected diagram is hyperbolic if it is neither of finite nor affine type, but every proper connected subdiagram is of finite or affine type. A hyperbolic Coxeter group is compact if all subgroups are finite, Finite and affine groups are also called elliptical and parabolic respectively. Hyperbolic groups are also called Lannér, after F. Lannér who enumerated the compact groups in 1950
22.
Coxeter group
–
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections. Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups, however, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced as abstractions of reflection groups, and finite Coxeter groups were classified in 1935, Coxeter groups find applications in many areas of mathematics. Examples of finite Coxeter groups include the groups of regular polytopes. The condition m i j = ∞ means no relation of the form m should be imposed, the pair where W is a Coxeter group with generators S = is called a Coxeter system. Note that in general S is not uniquely determined by W, for example, the Coxeter groups of type B3 and A1 × A3 are isomorphic but the Coxeter systems are not equivalent. A number of conclusions can be drawn immediately from the above definition, the relation m i i =1 means that 1 =2 =1 for all i, as such the generators are involutions. If m i j =2, then the r i and r j commute. This follows by observing that x x = y y =1, in order to avoid redundancy among the relations, it is necessary to assume that m i j = m j i. This follows by observing that y y =1, together with m =1 implies that m = m y y = y m y = y y =1. Alternatively, k and k are elements, as y k y −1 = k y y −1 = k. The Coxeter matrix is the n × n, symmetric matrix with entries m i j, indeed, every symmetric matrix with positive integer and ∞ entries and with 1s on the diagonal such that all nondiagonal entries are greater than 1 serves to define a Coxeter group. The Coxeter matrix can be encoded by a Coxeter diagram. The vertices of the graph are labelled by generator subscripts, vertices i and j are adjacent if and only if m i j ≥3. An edge is labelled with the value of m i j whenever the value is 4 or greater, in particular, two generators commute if and only if they are not connected by an edge. Furthermore, if a Coxeter graph has two or more connected components, the group is the direct product of the groups associated to the individual components. Thus the disjoint union of Coxeter graphs yields a product of Coxeter groups. The Coxeter matrix, M i j, is related to the n × n Schläfli matrix C with entries C i j = −2 cos , but the elements are modified, being proportional to the dot product of the pairwise generators
23.
Simplex
–
In geometry, a simplex is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. Specifically, a k-simplex is a polytope which is the convex hull of its k +1 vertices. More formally, suppose the k +1 points u 0, …, u k ∈ R k are affinely independent, then, the simplex determined by them is the set of points C =. For example, a 2-simplex is a triangle, a 3-simplex is a tetrahedron, a single point may be considered a 0-simplex, and a line segment may be considered a 1-simplex. A simplex may be defined as the smallest convex set containing the given vertices, a regular simplex is a simplex that is also a regular polytope. A regular n-simplex may be constructed from a regular -simplex by connecting a new vertex to all original vertices by the edge length. In topology and combinatorics, it is common to “glue together” simplices to form a simplicial complex, the associated combinatorial structure is called an abstract simplicial complex, in which context the word “simplex” simply means any finite set of vertices. A 1-simplex is a line segment, the convex hull of any nonempty subset of the n+1 points that define an n-simplex is called a face of the simplex. In particular, the hull of a subset of size m+1 is an m-simplex. The 0-faces are called the vertices, the 1-faces are called the edges, the -faces are called the facets, in general, the number of m-faces is equal to the binomial coefficient. Consequently, the number of m-faces of an n-simplex may be found in column of row of Pascals triangle, a simplex A is a coface of a simplex B if B is a face of A. Face and facet can have different meanings when describing types of simplices in a simplicial complex, see simplical complex for more detail. The regular simplex family is the first of three regular polytope families, labeled by Coxeter as αn, the two being the cross-polytope family, labeled as βn, and the hypercubes, labeled as γn. A fourth family, the infinite tessellation of hypercubes, he labeled as δn, an -simplex can be constructed as a join of an n-simplex and a point. An -simplex can be constructed as a join of an m-simplex, the two simplices are oriented to be completely normal from each other, with translation in a direction orthogonal to both of them. A 1-simplex is a joint of two points, ∨ =2, a general 2-simplex is the join of 3 points, ∨∨. An isosceles triangle is the join of a 1-simplex and a point, a general 3-simplex is the join of 4 points, ∨∨∨. A 3-simplex with mirror symmetry can be expressed as the join of an edge and 2 points, a 3-simplex with triangular symmetry can be expressed as the join of an equilateral triangle and 1 point,3. ∨ or ∨
24.
Hypercube
–
In geometry, a hypercube is an n-dimensional analogue of a square and a cube. A unit hypercubes longest diagonal in n-dimensions is equal to n, an n-dimensional hypercube is also called an n-cube or an n-dimensional cube. The term measure polytope is also used, notably in the work of H. S. M. Coxeter, the hypercube is the special case of a hyperrectangle. A unit hypercube is a hypercube whose side has one unit. Often, the hypercube whose corners are the 2n points in Rn with coordinates equal to 0 or 1 is called the unit hypercube, a hypercube can be defined by increasing the numbers of dimensions of a shape,0 – A point is a hypercube of dimension zero. 1 – If one moves this point one unit length, it will sweep out a line segment,2 – If one moves this line segment its length in a perpendicular direction from itself, it sweeps out a 2-dimensional square. 3 – If one moves the square one unit length in the perpendicular to the plane it lies on. 4 – If one moves the cube one unit length into the fourth dimension and this can be generalized to any number of dimensions. The 1-skeleton of a hypercube is a hypercube graph, a unit hypercube of n dimensions is the convex hull of the points given by all sign permutations of the Cartesian coordinates. It has a length of 1 and an n-dimensional volume of 1. An n-dimensional hypercube is also regarded as the convex hull of all sign permutations of the coordinates. This form is chosen due to ease of writing out the coordinates. Its edge length is 2, and its volume is 2n. Every n-cube of n >0 is composed of elements, or n-cubes of a dimension, on the -dimensional surface on the parent hypercube. A side is any element of -dimension of the parent hypercube, a hypercube of dimension n has 2n sides. The number of vertices of a hypercube is 2 n, the number of m-dimensional hypercubes on the boundary of an n-cube is E m, n =2 n − m, where = n. m. and n. denotes the factorial of n. For example, the boundary of a 4-cube contains 8 cubes,24 squares,32 lines and 16 vertices and this identity can be proved by combinatorial arguments, each of the 2 n vertices defines a vertex in a m-dimensional boundary. There are ways of choosing which lines that defines the subspace that the boundary is in, but, each side is counted 2 m times since it has that many vertices, we need to divide with this number
25.
Orthoplex
–
In geometry, a cross-polytope, orthoplex, hyperoctahedron, or cocube is a regular, convex polytope that exists in n-dimensions. A 2-orthoplex is a square, a 3-orthoplex is an octahedron. Its facets are simplexes of the dimension, while the cross-polytopes vertex figure is another cross-polytope from the previous dimension. The vertices of a cross-polytope are all the permutations of, the cross-polytope is the convex hull of its vertices. The n-dimensional cross-polytope can also be defined as the unit ball in the ℓ1-norm on Rn. In 1 dimension the cross-polytope is simply the line segment, in 2 dimensions it is a square with vertices, in 3 dimensions it is an octahedron—one of the five convex regular polyhedra known as the Platonic solids. Higher-dimensional cross-polytopes are generalizations of these, the cross-polytope is the dual polytope of the hypercube. The 1-skeleton of a n-dimensional cross-polytope is a Turán graph T, the 4-dimensional cross-polytope also goes by the name hexadecachoron or 16-cell. It is one of six convex regular 4-polytopes and these 4-polytopes were first described by the Swiss mathematician Ludwig Schläfli in the mid-19th century. The cross polytope family is one of three regular polytope families, labeled by Coxeter as βn, the two being the hypercube family, labeled as γn, and the simplices, labeled as αn. A fourth family, the infinite tessellations of hypercubes, he labeled as δn, the n-dimensional cross-polytope has 2n vertices, and 2n facets all of which are n−1 simplices. The vertex figures are all n −1 cross-polytopes, the Schläfli symbol of the cross-polytope is. The dihedral angle of the n-dimensional cross-polytope is δ n = arccos and this gives, δ2 = arccos = 90°, δ3 = arccos =109. 47°, δ4 = arccos = 120°, δ5 = arccos =126. 87°. The volume of the n-dimensional cross-polytope is 2 n n. Petrie polygon projections map the points into a regular 2n-gon or lower order regular polygons. A second projection takes the 2-gon petrie polygon of the dimension, seen as a bipyramid, projected down the axis. The vertices of a cross polytope are all at equal distance from each other in the Manhattan distance. Kusners conjecture states that this set of 2d points is the largest possible equidistant set for this distance, Regular complex polytopes can be defined in complex Hilbert space called generalized orthoplexes, βpn =22. 2p, or. Real solutions exist with p=2, i. e. β2n = βn =22.22 =, for p>2, they exist in C n
26.
Demihypercube
–
In geometry, demihypercubes are a class of n-polytopes constructed from alternation of an n-hypercube, labeled as hγn for being half of the hypercube family, γn. Half of the vertices are deleted and new facets are formed, the 2n facets become 2n -demicubes, and 2n -simplex facets are formed in place of the deleted vertices. They have been named with a prefix to each hypercube name, demicube, demitesseract. The demicube is identical to the tetrahedron, and the demitesseract is identical to the regular 16-cell. The demipenteract is considered semiregular for having regular facets. Higher forms dont have all regular facets but are all uniform polytopes, the vertices and edges of a demihypercube form two copies of the halved cube graph. Thorold Gosset described the demipenteract in his 1900 publication listing all of the regular and semiregular figures in n-dimensions above 3 and he called it a 5-ic semi-regular. It also exists within the semiregular k21 polytope family, the demihypercubes can be represented by extended Schläfli symbols of the form h as half the vertices of. The vertex figures of demihypercubes are rectified n-simplexes and they are represented by Coxeter-Dynkin diagrams of three constructive forms. Coxeter also labeled the third bifurcating diagrams as 1k1 representing the lengths of the 3 branches, an n-demicube, n greater than 2, has n*/2 edges meeting at each vertex. The graphs below show less edges at each vertex due to overlapping edges in the symmetry projection. Facets, Dn, n-1 = n + 2n The symmetry group of the demihypercube is the Coxeter group D n, has order 2 n −1 n. and is an index 2 subgroup of the hyperoctahedral group. It is generated by permutations of the axes and reflections along pairs of coordinate axes. Constructions as alternated orthotopes have the topology, but can be stretched with different lengths in n-axes of symmetry. The rhombic disphenoid is the example as alternated cuboid. It has three sets of edge lengths, and scalene triangle faces, Coxeter, editied by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, Coxeter, Regular and Semi-Regular Polytopes III, Olshevsky, George. Archived from the original on 4 February 2007
27.
Factorial
–
In mathematics, the factorial of a non-negative integer n, denoted by n. is the product of all positive integers less than or equal to n. =5 ×4 ×3 ×2 ×1 =120, the value of 0. is 1, according to the convention for an empty product. The factorial operation is encountered in areas of mathematics, notably in combinatorics, algebra. Its most basic occurrence is the fact there are n. ways to arrange n distinct objects into a sequence. This fact was known at least as early as the 12th century, fabian Stedman, in 1677, described factorials as applied to change ringing. After describing a recursive approach, Stedman gives a statement of a factorial, Now the nature of these methods is such, the factorial function is formally defined by the product n. = ∏ k =1 n k, or by the relation n. = {1 if n =0. The factorial function can also be defined by using the rule as n. All of the above definitions incorporate the instance 0, =1, in the first case by the convention that the product of no numbers at all is 1. This is convenient because, There is exactly one permutation of zero objects, = n. ×, valid for n >0, extends to n =0. It allows for the expression of many formulae, such as the function, as a power series. It makes many identities in combinatorics valid for all applicable sizes, the number of ways to choose 0 elements from the empty set is =0. More generally, the number of ways to choose n elements among a set of n is = n. n, the factorial function can also be defined for non-integer values using more advanced mathematics, detailed in the section below. This more generalized definition is used by advanced calculators and mathematical software such as Maple or Mathematica, although the factorial function has its roots in combinatorics, formulas involving factorials occur in many areas of mathematics. There are n. different ways of arranging n distinct objects into a sequence, often factorials appear in the denominator of a formula to account for the fact that ordering is to be ignored. A classical example is counting k-combinations from a set with n elements, one can obtain such a combination by choosing a k-permutation, successively selecting and removing an element of the set, k times, for a total of n k _ = n ⋯ possibilities. This however produces the k-combinations in an order that one wishes to ignore, since each k-combination is obtained in k. different ways. This number is known as the coefficient, because it is also the coefficient of Xk in n
28.
Birectified 10-simplex
–
In ten-dimensional geometry, a rectified 10-simplex is a convex uniform 10-polytope, being a rectification of the regular 10-simplex. These polytopes are part of a family of 527 uniform 10-polytopes with A10 symmetry, there are unique 5 degrees of rectifications including the zeroth, the 10-simplex itself. Vertices of the rectified 10-simplex are located at the edge-centers of the 10-simplex, vertices of the birectified 10-simplex are located in the triangular face centers of the 10-simplex. Vertices of the trirectified 10-simplex are located in the cell centers of the 10-simplex. Vertices of the quadrirectified 10-simplex are located in the 5-cell centers of the 10-simplex, the rectified 10-simplex is the vertex figure of the 11-demicube. Rectified hendecaxennon The Cartesian coordinates of the vertices of the rectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the rectified 11-orthoplex. Birectified hendecaxennon The Cartesian coordinates of the vertices of the birectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the birectified 11-orthoplex. Trirectified hendecaxennon The Cartesian coordinates of the vertices of the trirectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the triirectified 11-orthoplex. Quadrirectified hendecaxennon The Cartesian coordinates of the vertices of the quadrirectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the quadrirectified 11-orthoplex. Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, coxeter, Regular and Semi Regular Polytopes I, H. S. M. Coxeter, Regular and Semi-Regular Polytopes II, H. S. M, coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Manuscript N. W. Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D, x3o3o3o3o3o3o3o3o3o - ux, o3x3o3o3o3o3o3o3o3o - ru, o3o3x3o3o3o3o3o3o3o - bru, o3o3o3x3o3o3o3o3o3o - tru, o3o3o3o3x3o3o3o3o3o - teru Olshevsky, George. Archived from the original on 4 February 2007, Polytopes of Various Dimensions Multi-dimensional Glossary
29.
Trirectified 10-simplex
–
In ten-dimensional geometry, a rectified 10-simplex is a convex uniform 10-polytope, being a rectification of the regular 10-simplex. These polytopes are part of a family of 527 uniform 10-polytopes with A10 symmetry, there are unique 5 degrees of rectifications including the zeroth, the 10-simplex itself. Vertices of the rectified 10-simplex are located at the edge-centers of the 10-simplex, vertices of the birectified 10-simplex are located in the triangular face centers of the 10-simplex. Vertices of the trirectified 10-simplex are located in the cell centers of the 10-simplex. Vertices of the quadrirectified 10-simplex are located in the 5-cell centers of the 10-simplex, the rectified 10-simplex is the vertex figure of the 11-demicube. Rectified hendecaxennon The Cartesian coordinates of the vertices of the rectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the rectified 11-orthoplex. Birectified hendecaxennon The Cartesian coordinates of the vertices of the birectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the birectified 11-orthoplex. Trirectified hendecaxennon The Cartesian coordinates of the vertices of the trirectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the triirectified 11-orthoplex. Quadrirectified hendecaxennon The Cartesian coordinates of the vertices of the quadrirectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the quadrirectified 11-orthoplex. Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, coxeter, Regular and Semi Regular Polytopes I, H. S. M. Coxeter, Regular and Semi-Regular Polytopes II, H. S. M, coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Manuscript N. W. Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D, x3o3o3o3o3o3o3o3o3o - ux, o3x3o3o3o3o3o3o3o3o - ru, o3o3x3o3o3o3o3o3o3o - bru, o3o3o3x3o3o3o3o3o3o - tru, o3o3o3o3x3o3o3o3o3o - teru Olshevsky, George. Archived from the original on 4 February 2007, Polytopes of Various Dimensions Multi-dimensional Glossary
30.
Quadrirectified 10-simplex
–
In ten-dimensional geometry, a rectified 10-simplex is a convex uniform 10-polytope, being a rectification of the regular 10-simplex. These polytopes are part of a family of 527 uniform 10-polytopes with A10 symmetry, there are unique 5 degrees of rectifications including the zeroth, the 10-simplex itself. Vertices of the rectified 10-simplex are located at the edge-centers of the 10-simplex, vertices of the birectified 10-simplex are located in the triangular face centers of the 10-simplex. Vertices of the trirectified 10-simplex are located in the cell centers of the 10-simplex. Vertices of the quadrirectified 10-simplex are located in the 5-cell centers of the 10-simplex, the rectified 10-simplex is the vertex figure of the 11-demicube. Rectified hendecaxennon The Cartesian coordinates of the vertices of the rectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the rectified 11-orthoplex. Birectified hendecaxennon The Cartesian coordinates of the vertices of the birectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the birectified 11-orthoplex. Trirectified hendecaxennon The Cartesian coordinates of the vertices of the trirectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the triirectified 11-orthoplex. Quadrirectified hendecaxennon The Cartesian coordinates of the vertices of the quadrirectified 10-simplex can be most simply positioned in 11-space as permutations of and this construction is based on facets of the quadrirectified 11-orthoplex. Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, coxeter, Regular and Semi Regular Polytopes I, H. S. M. Coxeter, Regular and Semi-Regular Polytopes II, H. S. M, coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Manuscript N. W. Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D, x3o3o3o3o3o3o3o3o3o - ux, o3x3o3o3o3o3o3o3o3o - ru, o3o3x3o3o3o3o3o3o3o - bru, o3o3o3x3o3o3o3o3o3o - tru, o3o3o3o3x3o3o3o3o3o - teru Olshevsky, George. Archived from the original on 4 February 2007, Polytopes of Various Dimensions Multi-dimensional Glossary
31.
Rectification (geometry)
–
In Euclidean geometry, rectification or complete-truncation is the process of truncating a polytope by marking the midpoints of all its edges, and cutting off its vertices at those points. The resulting polytope will be bounded by vertex figure facets and the facets of the original polytope. A rectification operator is denoted by the symbol r, for example, r is the rectified cube. Conway polyhedron notation uses ambo for this operator, in graph theory this operation creates a medial graph. Rectification is the point of a truncation process. The highest degree of rectification creates the dual polytope, a rectification truncates edges to points. A birectification truncates faces to points, a trirectification truncates cells to points, and so on. New vertices are placed at the center of the edges of the original polygon, each platonic solid and its dual have the same rectified polyhedron. The rectified polyhedron turns out to be expressible as the intersection of the original platonic solid with an appropriated scaled concentric version of its dual, the rectified octahedron, whose dual is the cube, is the cuboctahedron. The rectified icosahedron, whose dual is the dodecahedron, is the icosidodecahedron, a rectified square tiling is a square tiling. A rectified triangular tiling or hexagonal tiling is a trihexagonal tiling, examples If a polyhedron is not regular, the edge midpoints surrounding a vertex may not be coplanar. The resulting medial graph remains polyhedral, so by Steinitzs theorem it can be represented as a polyhedron, the Conway polyhedron notation equivalent to rectification is ambo, represented by a. Applying twice aa, is Conways expand operation, e, which is the same as Johnsons cantellation operation, t0,2 generated from regular polyhedral, each Convex regular 4-polytope has a rectified form as a uniform 4-polytope. Its rectification will have two types, a rectified polyhedron left from the original cells and polyhedron as new cells formed by each truncated vertex. A rectified is not the same as a rectified, however, a further truncation, called bitruncation, is symmetric between a 4-polytope and its dual. Examples A first rectification truncates edges down to points, If a polytope is regular, this form is represented by an extended Schläfli symbol notation t1 or r. A second rectification, or birectification, truncates faces down to points, If regular it has notation t2 or 2r. For polyhedra, a birectification creates a dual polyhedron, higher degree rectifications can be constructed for higher dimensional polytopes
32.
Birectified 10-cube
–
In ten-dimensional geometry, a rectified 10-cube is a convex uniform 10-polytope, being a rectification of the regular 10-cube. There are 10 rectifications of the 10-cube, with the zeroth being the 10-cube itself, vertices of the rectified 10-cube are located at the edge-centers of the 10-cube. Vertices of the birectified 10-cube are located in the face centers of the 10-cube. Vertices of the trirectified 10-cube are located in the cell centers of the 10-cube. The others are simply constructed relative to the 10-cube dual polytpoe. These polytopes are part of a family 1023 uniform 10-polytopes with BC10 symmetry. S. M, coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, Selected Writings of H. S. M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M. Coxeter, Regular and Semi Regular Polytopes I, H. S. M, coxeter, Regular and Semi-Regular Polytopes II, H. S. M. Coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D. Archived from the original on 4 February 2007, Polytopes of Various Dimensions Multi-dimensional Glossary
33.
Trirectified 10-cube
–
In ten-dimensional geometry, a rectified 10-cube is a convex uniform 10-polytope, being a rectification of the regular 10-cube. There are 10 rectifications of the 10-cube, with the zeroth being the 10-cube itself, vertices of the rectified 10-cube are located at the edge-centers of the 10-cube. Vertices of the birectified 10-cube are located in the face centers of the 10-cube. Vertices of the trirectified 10-cube are located in the cell centers of the 10-cube. The others are simply constructed relative to the 10-cube dual polytpoe. These polytopes are part of a family 1023 uniform 10-polytopes with BC10 symmetry. S. M, coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, Selected Writings of H. S. M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M. Coxeter, Regular and Semi Regular Polytopes I, H. S. M, coxeter, Regular and Semi-Regular Polytopes II, H. S. M. Coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D. Archived from the original on 4 February 2007, Polytopes of Various Dimensions Multi-dimensional Glossary
34.
Quadrirectified 10-cube
–
In ten-dimensional geometry, a rectified 10-cube is a convex uniform 10-polytope, being a rectification of the regular 10-cube. There are 10 rectifications of the 10-cube, with the zeroth being the 10-cube itself, vertices of the rectified 10-cube are located at the edge-centers of the 10-cube. Vertices of the birectified 10-cube are located in the face centers of the 10-cube. Vertices of the trirectified 10-cube are located in the cell centers of the 10-cube. The others are simply constructed relative to the 10-cube dual polytpoe. These polytopes are part of a family 1023 uniform 10-polytopes with BC10 symmetry. S. M, coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, Selected Writings of H. S. M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M. Coxeter, Regular and Semi Regular Polytopes I, H. S. M, coxeter, Regular and Semi-Regular Polytopes II, H. S. M. Coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D. Archived from the original on 4 February 2007, Polytopes of Various Dimensions Multi-dimensional Glossary
35.
Quadrirectified 10-orthoplex
–
In ten-dimensional geometry, a rectified 10-orthoplex is a convex uniform 10-polytope, being a rectification of the regular 10-orthoplex. There are 10 rectifications of the 10-orthoplex, vertices of the rectified 10-orthoplex are located at the edge-centers of the 9-orthoplex. Vertices of the birectified 10-orthoplex are located in the face centers of the 10-orthoplex. Vertices of the trirectified 10-orthoplex are located in the cell centers of the 10-orthoplex. These polytopes are part of a family 1023 uniform 10-polytopes with BC10 symmetry, in ten-dimensional geometry, a rectified 10-orthoplex is a 10-polytope, being a rectification of the regular 10-orthoplex. The rectified 10-orthoplex is the figure for the demidekeractic honeycomb. The vertices can be seen in 3 hyperplanes, with the 45 vertices rectified 9-simplices facets on opposite sides, when combined with the 20 vertices of the 9-orthoplex, these vertices represent the 200 root vectors of the simple Lie group B10. S. M. Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, coxeter, Regular and Semi Regular Polytopes I, H. S. M. Coxeter, Regular and Semi-Regular Polytopes II, H. S. M, coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Manuscript N. W. Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D, archived from the original on 4 February 2007. Polytopes of Various Dimensions Multi-dimensional Glossary
36.
Trirectified 10-orthoplex
–
In ten-dimensional geometry, a rectified 10-orthoplex is a convex uniform 10-polytope, being a rectification of the regular 10-orthoplex. There are 10 rectifications of the 10-orthoplex, vertices of the rectified 10-orthoplex are located at the edge-centers of the 9-orthoplex. Vertices of the birectified 10-orthoplex are located in the face centers of the 10-orthoplex. Vertices of the trirectified 10-orthoplex are located in the cell centers of the 10-orthoplex. These polytopes are part of a family 1023 uniform 10-polytopes with BC10 symmetry, in ten-dimensional geometry, a rectified 10-orthoplex is a 10-polytope, being a rectification of the regular 10-orthoplex. The rectified 10-orthoplex is the figure for the demidekeractic honeycomb. The vertices can be seen in 3 hyperplanes, with the 45 vertices rectified 9-simplices facets on opposite sides, when combined with the 20 vertices of the 9-orthoplex, these vertices represent the 200 root vectors of the simple Lie group B10. S. M. Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, coxeter, Regular and Semi Regular Polytopes I, H. S. M. Coxeter, Regular and Semi-Regular Polytopes II, H. S. M, coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Manuscript N. W. Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D, archived from the original on 4 February 2007. Polytopes of Various Dimensions Multi-dimensional Glossary
37.
Birectified 10-orthoplex
–
In ten-dimensional geometry, a rectified 10-orthoplex is a convex uniform 10-polytope, being a rectification of the regular 10-orthoplex. There are 10 rectifications of the 10-orthoplex, vertices of the rectified 10-orthoplex are located at the edge-centers of the 9-orthoplex. Vertices of the birectified 10-orthoplex are located in the face centers of the 10-orthoplex. Vertices of the trirectified 10-orthoplex are located in the cell centers of the 10-orthoplex. These polytopes are part of a family 1023 uniform 10-polytopes with BC10 symmetry, in ten-dimensional geometry, a rectified 10-orthoplex is a 10-polytope, being a rectification of the regular 10-orthoplex. The rectified 10-orthoplex is the figure for the demidekeractic honeycomb. The vertices can be seen in 3 hyperplanes, with the 45 vertices rectified 9-simplices facets on opposite sides, when combined with the 20 vertices of the 9-orthoplex, these vertices represent the 200 root vectors of the simple Lie group B10. S. M. Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, coxeter, Regular and Semi Regular Polytopes I, H. S. M. Coxeter, Regular and Semi-Regular Polytopes II, H. S. M, coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Manuscript N. W. Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D, archived from the original on 4 February 2007. Polytopes of Various Dimensions Multi-dimensional Glossary
38.
Coxeter groups
–
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections. Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups, however, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced as abstractions of reflection groups, and finite Coxeter groups were classified in 1935, Coxeter groups find applications in many areas of mathematics. Examples of finite Coxeter groups include the groups of regular polytopes. The condition m i j = ∞ means no relation of the form m should be imposed, the pair where W is a Coxeter group with generators S = is called a Coxeter system. Note that in general S is not uniquely determined by W, for example, the Coxeter groups of type B3 and A1 × A3 are isomorphic but the Coxeter systems are not equivalent. A number of conclusions can be drawn immediately from the above definition, the relation m i i =1 means that 1 =2 =1 for all i, as such the generators are involutions. If m i j =2, then the r i and r j commute. This follows by observing that x x = y y =1, in order to avoid redundancy among the relations, it is necessary to assume that m i j = m j i. This follows by observing that y y =1, together with m =1 implies that m = m y y = y m y = y y =1. Alternatively, k and k are elements, as y k y −1 = k y y −1 = k. The Coxeter matrix is the n × n, symmetric matrix with entries m i j, indeed, every symmetric matrix with positive integer and ∞ entries and with 1s on the diagonal such that all nondiagonal entries are greater than 1 serves to define a Coxeter group. The Coxeter matrix can be encoded by a Coxeter diagram. The vertices of the graph are labelled by generator subscripts, vertices i and j are adjacent if and only if m i j ≥3. An edge is labelled with the value of m i j whenever the value is 4 or greater, in particular, two generators commute if and only if they are not connected by an edge. Furthermore, if a Coxeter graph has two or more connected components, the group is the direct product of the groups associated to the individual components. Thus the disjoint union of Coxeter graphs yields a product of Coxeter groups. The Coxeter matrix, M i j, is related to the n × n Schläfli matrix C with entries C i j = −2 cos , but the elements are modified, being proportional to the dot product of the pairwise generators
39.
Hypercubic honeycomb
–
In geometry, a hypercubic honeycomb is a family of regular honeycombs in n-dimensions with the Schläfli symbols and containing the symmetry of Coxeter group Rn for n>=3. The tessellation is constructed from 4 n-hypercubes per ridge, the vertex figure is a cross-polytope. Coxeter named this family as δn+1 for an n-dimensional honeycomb, there are two general forms of the hypercube honeycombs, the regular form with identical hypercubic facets and one semiregular, with alternating hypercube facets, like a checkerboard. A third form is generated by an operation applied to the regular form. The orthotopic honeycombs are a family topologically equivalent to the cubic honeycombs but with lower symmetry, the facets are hyperrectangles, also called orthotopes, in 2 and 3 dimensions the orthotopes are rectangles and cuboids respectively. Alternated hypercubic honeycomb Quarter hypercubic honeycomb Simplectic honeycomb Truncated simplectic honeycomb Omnitruncated simplectic honeycomb Coxeter, Regular Polytopes, Dover edition, ISBN 0-486-61480-8 pp. 122–123,1973. Pp. 154–156, Partial truncation or alternation, represented by h prefix, h=, h=, h= p.296, Table II, Regular honeycombs, δn+1
40.
Alternated hypercubic honeycomb
–
In geometry, the alternated hypercube honeycomb is a dimensional infinite series of honeycombs, based on the hypercube honeycomb with an alternation operation. It is given a Schläfli symbol h representing the form with half the vertices removed. A lower symmetry form D ~ n −1 can be created by removing another mirror on an order-4 peak, the alternated hypercube facets become demihypercubes, and the deleted vertices create new orthoplex facets. The vertex figure for honeycombs of this family are rectified orthoplexes and these are also named as hδn for an -dimensional honeycomb. Regular Polytopes, Dover edition, ISBN 0-486-61480-8 pp. 122–123,1973, thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M. Coxeter, Regular and Semi-Regular Polytopes III
41.
Vertex figure
–
In geometry, a vertex figure, broadly speaking, is the figure exposed when a corner of a polyhedron or polytope is sliced off. Take some vertex of a polyhedron, mark a point somewhere along each connected edge. Draw lines across the faces, joining adjacent points. When done, these form a complete circuit, i. e. a polygon. This polygon is the vertex figure, more precise formal definitions can vary quite widely, according to circumstance. For example Coxeter varies his definition as convenient for the current area of discussion, most of the following definitions of a vertex figure apply equally well to infinite tilings, or space-filling tessellation with polytope cells. Make a slice through the corner of the polyhedron, cutting all the edges connected to the vertex. The cut surface is the vertex figure and this is perhaps the most common approach, and the most easily understood. Different authors make the slice in different places, Wenninger cuts each edge a unit distance from the vertex, as does Coxeter. For uniform polyhedra the Dorman Luke construction cuts each connected edge at its midpoint, other authors make the cut through the vertex at the other end of each edge. For irregular polyhedra, these approaches may produce a figure that does not lie in a plane. A more general approach, valid for convex polyhedra, is to make the cut along any plane which separates the given vertex from all the other vertices. Cromwell makes a cut or scoop, centered on the vertex. The cut surface or vertex figure is thus a spherical polygon marked on this sphere, many combinatorial and computational approaches treat a vertex figure as the ordered set of points of all the neighboring vertices to the given vertex. In the theory of polytopes, the vertex figure at a given vertex V comprises all the elements which are incident on the vertex, edges, faces. More formally it is the -section Fn/V, where Fn is the greatest face and this set of elements is elsewhere known as a vertex star. A vertex figure for an n-polytope is an -polytope, for example, a vertex figure for a polyhedron is a polygon figure, and the vertex figure for a 4-polytope is a polyhedron. Each edge of the vertex figure exists on or inside of a face of the original polytope connecting two vertices from an original face
42.
6 21 honeycomb
–
In geometry, an E9 honeycomb is a tessellation of uniform polytopes in hyperbolic 9-dimensional space. T ¯9, also is a hyperbolic group, so either facets or vertex figures will not be bounded. E10 is last of the series of Coxeter groups with a bifurcated Coxeter-Dynkin diagram of lengths 6,2,1, there are 1023 unique E10 honeycombs by all combinations of its Coxeter-Dynkin diagram. There are no regular honeycombs in the family since its Coxeter diagram is a nonlinear graph, the 621 honeycomb is constructed from alternating 9-simplex and 9-orthoplex facets within the symmetry of the E10 Coxeter group. This honeycomb is highly regular in the sense that its symmetry group acts transitively on the k-faces for k ≤7, all of the k-faces for k ≤8 are simplices. It is created by a Wythoff construction upon a set of 10 hyperplane mirrors in 9-dimensional hyperbolic space, the facet information can be extracted from its Coxeter-Dynkin diagram. Removing the node on the end of the 2-length branch leaves the 9-orthoplex,711, removing the node on the end of the 1-length branch leaves the 9-simplex. The vertex figure is determined by removing the ringed node and ringing the neighboring node, the edge figure is determined from the vertex figure by removing the ringed node and ringing the neighboring node. The face figure is determined from the figure by removing the ringed node. The cell figure is determined from the figure by removing the ringed node. The 621 is last in a series of semiregular polytopes and honeycombs. Each member of the sequence has the previous member as its vertex figure, all facets of these polytopes are regular polytopes, namely simplexes and orthoplexes. The 261 honeycomb is composed of 251 9-honeycomb and 9-simplex facets and it is the final figure in the 2k1 family. It is created by a Wythoff construction upon a set of 10 hyperplane mirrors in 9-dimensional hyperbolic space, the facet information can be extracted from its Coxeter-Dynkin diagram. Removing the node on the branch leaves the 9-simplex. Removing the node on the end of the 6-length branch leaves the 251 honeycomb and this is an infinite facet because E10 is a paracompact hyperbolic group. The vertex figure is determined by removing the ringed node and ringing the neighboring node, the edge figure is the vertex figure of the edge figure. This makes the rectified 8-simplex,051, the face figure is determined from the edge figure by removing the ringed node and ringing the neighboring node
43.
2 61 honeycomb
–
In geometry, an E9 honeycomb is a tessellation of uniform polytopes in hyperbolic 9-dimensional space. T ¯9, also is a hyperbolic group, so either facets or vertex figures will not be bounded. E10 is last of the series of Coxeter groups with a bifurcated Coxeter-Dynkin diagram of lengths 6,2,1, there are 1023 unique E10 honeycombs by all combinations of its Coxeter-Dynkin diagram. There are no regular honeycombs in the family since its Coxeter diagram is a nonlinear graph, the 621 honeycomb is constructed from alternating 9-simplex and 9-orthoplex facets within the symmetry of the E10 Coxeter group. This honeycomb is highly regular in the sense that its symmetry group acts transitively on the k-faces for k ≤7, all of the k-faces for k ≤8 are simplices. It is created by a Wythoff construction upon a set of 10 hyperplane mirrors in 9-dimensional hyperbolic space, the facet information can be extracted from its Coxeter-Dynkin diagram. Removing the node on the end of the 2-length branch leaves the 9-orthoplex,711, removing the node on the end of the 1-length branch leaves the 9-simplex. The vertex figure is determined by removing the ringed node and ringing the neighboring node, the edge figure is determined from the vertex figure by removing the ringed node and ringing the neighboring node. The face figure is determined from the figure by removing the ringed node. The cell figure is determined from the figure by removing the ringed node. The 621 is last in a series of semiregular polytopes and honeycombs. Each member of the sequence has the previous member as its vertex figure, all facets of these polytopes are regular polytopes, namely simplexes and orthoplexes. The 261 honeycomb is composed of 251 9-honeycomb and 9-simplex facets and it is the final figure in the 2k1 family. It is created by a Wythoff construction upon a set of 10 hyperplane mirrors in 9-dimensional hyperbolic space, the facet information can be extracted from its Coxeter-Dynkin diagram. Removing the node on the branch leaves the 9-simplex. Removing the node on the end of the 6-length branch leaves the 251 honeycomb and this is an infinite facet because E10 is a paracompact hyperbolic group. The vertex figure is determined by removing the ringed node and ringing the neighboring node, the edge figure is the vertex figure of the edge figure. This makes the rectified 8-simplex,051, the face figure is determined from the edge figure by removing the ringed node and ringing the neighboring node
44.
1 62 honeycomb
–
In geometry, an E9 honeycomb is a tessellation of uniform polytopes in hyperbolic 9-dimensional space. T ¯9, also is a hyperbolic group, so either facets or vertex figures will not be bounded. E10 is last of the series of Coxeter groups with a bifurcated Coxeter-Dynkin diagram of lengths 6,2,1, there are 1023 unique E10 honeycombs by all combinations of its Coxeter-Dynkin diagram. There are no regular honeycombs in the family since its Coxeter diagram is a nonlinear graph, the 621 honeycomb is constructed from alternating 9-simplex and 9-orthoplex facets within the symmetry of the E10 Coxeter group. This honeycomb is highly regular in the sense that its symmetry group acts transitively on the k-faces for k ≤7, all of the k-faces for k ≤8 are simplices. It is created by a Wythoff construction upon a set of 10 hyperplane mirrors in 9-dimensional hyperbolic space, the facet information can be extracted from its Coxeter-Dynkin diagram. Removing the node on the end of the 2-length branch leaves the 9-orthoplex,711, removing the node on the end of the 1-length branch leaves the 9-simplex. The vertex figure is determined by removing the ringed node and ringing the neighboring node, the edge figure is determined from the vertex figure by removing the ringed node and ringing the neighboring node. The face figure is determined from the figure by removing the ringed node. The cell figure is determined from the figure by removing the ringed node. The 621 is last in a series of semiregular polytopes and honeycombs. Each member of the sequence has the previous member as its vertex figure, all facets of these polytopes are regular polytopes, namely simplexes and orthoplexes. The 261 honeycomb is composed of 251 9-honeycomb and 9-simplex facets and it is the final figure in the 2k1 family. It is created by a Wythoff construction upon a set of 10 hyperplane mirrors in 9-dimensional hyperbolic space, the facet information can be extracted from its Coxeter-Dynkin diagram. Removing the node on the branch leaves the 9-simplex. Removing the node on the end of the 6-length branch leaves the 251 honeycomb and this is an infinite facet because E10 is a paracompact hyperbolic group. The vertex figure is determined by removing the ringed node and ringing the neighboring node, the edge figure is the vertex figure of the edge figure. This makes the rectified 8-simplex,051, the face figure is determined from the edge figure by removing the ringed node and ringing the neighboring node
45.
Alicia Boole Stott
–
Alicia Boole Stott was an Irish-English mathematician. Despite never holding a position, she made a number of valuable contributions to the field. She is best known for coining the term polytope for a solid in four dimensions. Alicia Boole was born in Cork, Ireland, the daughter of mathematician and logician George Boole and Mary Everest Boole. Many of her sisters were notable in their own right, lucy Everest Boole was a chemist and pharmacist and Ethel Lilian Voynich was a novelist. After her fathers death in 1864, the family moved to London. She attended the school attached to Queens College with her sister and she was first exposed to geometric models by her brother-in-law Charles Howard Hinton when she was just 18, and developed the ability to visualise in a fourth dimension. She found that there were exactly six regular polytopes in four dimensions and she made cardboard models of all these sections. She coined the term polytopes to describe them, after taking up secretarial work near Liverpool in 1889 she met and married Walter Stott, an actuary, in 1890. They had two children together, Mary and Leonard, Stott learned of Pieter Schoutes work on central sections of the regular polytopes in 1895. Schoute came to England and worked with Alicia Stott, persuading her to publish her results which she did in two published in Amsterdam in 1900 and 1910. The University of Groningen honoured her by inviting her to attend the celebrations of the university. After Schoutes death in 1923 Alicia took a hiatus from mathematical work, in 1930 she was introduced by her nephew Geoffrey Ingram Taylor to H. S. M. Coxeter and they worked together on various problems, Alicia made two further important discoveries relating to constructions for polyhedra related to the golden section. She presented a joint paper with Coxeter at Cambridge University, Coxeter later wrote, The strength and simplicity of her character combined with the diversity of her interests to make her an inspiring friend. Alicia died in Middlesex in 1940, in Spring 2001 a paper roll of coloured drawings of polyhedra was found at Groningen University. Though unsigned, it was recognised as Alicias work. It led to research by Irene Polo-Blanco, Polo-Blanco dedicated a chapter to Alicias work in her book Theory and History of Mathematical Models
46.
Harold Scott MacDonald Coxeter
–
Harold Scott MacDonald Donald Coxeter, FRS, FRSC, CC was a British-born Canadian geometer. Coxeter is regarded as one of the greatest geometers of the 20th century and he was born in London but spent most of his adult life in Canada. He was always called Donald, from his third name MacDonald, in his youth, Coxeter composed music and was an accomplished pianist at the age of 10. He felt that mathematics and music were intimately related, outlining his ideas in a 1962 article on Mathematics and he worked for 60 years at the University of Toronto and published twelve books. He was most noted for his work on regular polytopes and higher-dimensional geometries and he was a champion of the classical approach to geometry, in a period when the tendency was to approach geometry more and more via algebra. Coxeter went up to Trinity College, Cambridge in 1926 to read mathematics, there he earned his BA in 1928, and his doctorate in 1931. In 1932 he went to Princeton University for a year as a Rockefeller Fellow, where he worked with Hermann Weyl, Oswald Veblen, returning to Trinity for a year, he attended Ludwig Wittgensteins seminars on the philosophy of mathematics. In 1934 he spent a year at Princeton as a Procter Fellow. In 1936 Coxeter moved to the University of Toronto, flather, and John Flinders Petrie published The Fifty-Nine Icosahedra with University of Toronto Press. In 1940 Coxeter edited the eleventh edition of Mathematical Recreations and Essays and he was elevated to professor in 1948. Coxeter was elected a Fellow of the Royal Society of Canada in 1948 and he also inspired some of the innovations of Buckminster Fuller. Coxeter, M. S. Longuet-Higgins and J. C. P. Miller were the first to publish the full list of uniform polyhedra, since 1978, the Canadian Mathematical Society have awarded the Coxeter–James Prize in his honor. He was made a Fellow of the Royal Society in 1950, in 1990, he became a Foreign Member of the American Academy of Arts and Sciences and in 1997 was made a Companion of the Order of Canada. In 1973 he got the Jeffery–Williams Prize,1940, Regular and Semi-Regular Polytopes I, Mathematische Zeitschrift 46, 380-407, MR2,10 doi,10. 1007/BF011814491942, Non-Euclidean Geometry, University of Toronto Press, MAA. 1954, Uniform Polyhedra, Philosophical Transactions of the Royal Society A246, arthur Sherk, Peter McMullen, Anthony C. Thompson and Asia Ivić Weiss, editors, Kaleidoscopes — Selected Writings of H. S. M. John Wiley and Sons ISBN 0-471-01003-01999, The Beauty of Geometry, Twelve Essays, Dover Publications, LCCN 99-35678, ISBN 0-486-40919-8 Davis, Chandler, Ellers, Erich W, the Coxeter Legacy, Reflections and Projections. King of Infinite Space, Donald Coxeter, the Man Who Saved Geometry, www. donaldcoxeter. com www. math. yorku. ca/dcoxeter webpages dedicated to him Jarons World, Shapes in Other Dimensions, Discover mag. Apr 2007 The Mathematics in the Art of M. C, escher video of a lecture by H. S. M