1.
Perspective (graphical)
–
Perspective in the graphic arts is an approximate representation, on a flat surface, of an image as it is seen by the eye. If viewed from the spot as the windowpane was painted. Each painted object in the scene is thus a flat, scaled down version of the object on the side of the window. All perspective drawings assume the viewer is a distance away from the drawing. Objects are scaled relative to that viewer, an object is often not scaled evenly, a circle often appears as an ellipse and a square can appear as a trapezoid. This distortion is referred to as foreshortening, Perspective drawings have a horizon line, which is often implied. This line, directly opposite the viewers eye, represents objects infinitely far away and they have shrunk, in the distance, to the infinitesimal thickness of a line. It is analogous to the Earths horizon, any perspective representation of a scene that includes parallel lines has one or more vanishing points in a perspective drawing. A one-point perspective drawing means that the drawing has a vanishing point, usually directly opposite the viewers eye. All lines parallel with the line of sight recede to the horizon towards this vanishing point. This is the standard receding railroad tracks phenomenon, a two-point drawing would have lines parallel to two different angles. Any number of vanishing points are possible in a drawing, one for each set of lines that are at an angle relative to the plane of the drawing. Perspectives consisting of parallel lines are observed most often when drawing architecture. In contrast, natural scenes often do not have any sets of parallel lines, the only method to indicate the relative position of elements in the composition was by overlapping, of which much use is made in works like the Parthenon Marbles. Chinese artists made use of perspective from the first or second century until the 18th century. It is not certain how they came to use the technique, some authorities suggest that the Chinese acquired the technique from India, oblique projection is also seen in Japanese art, such as in the Ukiyo-e paintings of Torii Kiyonaga. This was detailed within Aristotles Poetics as skenographia, using flat panels on a stage to give the illusion of depth, the philosophers Anaxagoras and Democritus worked out geometric theories of perspective for use with skenographia. Alcibiades had paintings in his house designed using skenographia, so this art was not confined merely to the stage, Euclids Optics introduced a mathematical theory of perspective, but there is some debate over the extent to which Euclids perspective coincides with the modern mathematical definition
2.
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
3.
16-cell
–
In four-dimensional geometry, a 16-cell is a regular convex 4-polytope. It is one of the six regular convex 4-polytopes first described by the Swiss mathematician Ludwig Schläfli in the mid-19th century and it is also called C16, hexadecachoron, or hexdecahedroid. It is a part of an family of polytopes, called cross-polytopes or orthoplexes. The dual polytope is the tesseract, conways name for a cross-polytope is orthoplex, for orthant complex. The 16-cell has 16 cells as the tesseract has 16 vertices and it is bounded by 16 cells, all of which are regular tetrahedra. It has 32 triangular faces,24 edges, and 8 vertices, the 24 edges bound 6 squares lying in the 6 coordinate planes. The eight vertices of the 16-cell are, all vertices are connected by edges except opposite pairs. The Schläfli symbol of the 16-cell is and its vertex figure is a regular octahedron. There are 8 tetrahedra,12 triangles, and 6 edges meeting at every vertex and its edge figure is a square. There are 4 tetrahedra and 4 triangles meeting at every edge, the 16-cell can be decomposed into two similar disjoint circular chains of eight tetrahedrons each, four edges long. Each chain, when stretched out straight, forms a Boerdijk–Coxeter helix and this decomposition can be seen in a 4-4 duoantiprism construction of the 16-cell, or, Schläfli symbol ⨂ or ss, symmetry, order 64. The 16-cell can be dissected into two octahedral pyramids, which share a new octahedron base through the 16-cell center, one can tessellate 4-dimensional Euclidean space by regular 16-cells. This is called the 16-cell honeycomb and has Schläfli symbol, hence, the 16-cell has a dihedral angle of 120°. The dual tessellation, 24-cell honeycomb, is made of by regular 24-cells, together with the tesseractic honeycomb, these are the only three regular tessellations of R4. Each 16-cell has 16 neighbors with which it shares a tetrahedron,24 neighbors with which it only an edge. Twenty-four 16-cells meet at any vertex in this tessellation. A 16-cell can constructed from two Boerdijk–Coxeter helixes of eight chained tetrahedra, each folded into a 4-dimensional ring, the 16 triangle faces can be seen in a 2D net within a triangular tiling, with 6 triangles around every vertex. The purple edges represent the Petrie polygon of the 16-cell, the cell-first parallel projection of the 16-cell into 3-space has a cubical envelope
4.
Tetrahedron
–
In geometry, a tetrahedron, also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertex corners. The tetrahedron is the simplest of all the ordinary convex polyhedra, the tetrahedron is the three-dimensional case of the more general concept of a Euclidean simplex. The tetrahedron is one kind of pyramid, which is a polyhedron with a polygon base. In the case of a tetrahedron the base is a triangle, like all convex polyhedra, a tetrahedron can be folded from a single sheet of paper. For any tetrahedron there exists a sphere on which all four vertices lie, a regular tetrahedron is one in which all four faces are equilateral triangles. It is one of the five regular Platonic solids, which have known since antiquity. In a regular tetrahedron, not only are all its faces the same size and shape, regular tetrahedra alone do not tessellate, but if alternated with regular octahedra they form the alternated cubic honeycomb, which is a tessellation. The regular tetrahedron is self-dual, which means that its dual is another regular tetrahedron, the compound figure comprising two such dual tetrahedra form a stellated octahedron or stella octangula. This form has Coxeter diagram and Schläfli symbol h, the tetrahedron in this case has edge length 2√2. Inverting these coordinates generates the dual tetrahedron, and the together form the stellated octahedron. In other words, if C is the centroid of the base and this follows from the fact that the medians of a triangle intersect at its centroid, and this point divides each of them in two segments, one of which is twice as long as the other. The vertices of a cube can be grouped into two groups of four, each forming a regular tetrahedron, the symmetries of a regular tetrahedron correspond to half of those of a cube, those that map the tetrahedra to themselves, and not to each other. The tetrahedron is the only Platonic solid that is not mapped to itself by point inversion, the regular tetrahedron has 24 isometries, forming the symmetry group Td, isomorphic to the symmetric group, S4. The first corresponds to the A2 Coxeter plane, the two skew perpendicular opposite edges of a regular tetrahedron define a set of parallel planes. When one of these intersects the tetrahedron the resulting cross section is a rectangle. When the intersecting plane is one of the edges the rectangle is long. When halfway between the two edges the intersection is a square, the aspect ratio of the rectangle reverses as you pass this halfway point. For the midpoint square intersection the resulting boundary line traverses every face of the tetrahedron similarly, if the tetrahedron is bisected on this plane, both halves become wedges
5.
Triangle
–
A triangle is a polygon with three edges and three vertices. It is one of the shapes in geometry. A triangle with vertices A, B, and C is denoted △ A B C, in Euclidean geometry any three points, when non-collinear, determine a unique triangle and a unique plane. This article is about triangles in Euclidean geometry except where otherwise noted, triangles can be classified according to the lengths of their sides, An equilateral triangle has all sides the same length. An equilateral triangle is also a polygon with all angles measuring 60°. An isosceles triangle has two sides of equal length, some mathematicians define an isosceles triangle to have exactly two equal sides, whereas others define an isosceles triangle as one with at least two equal sides. The latter definition would make all equilateral triangles isosceles triangles, the 45–45–90 right triangle, which appears in the tetrakis square tiling, is isosceles. A scalene triangle has all its sides of different lengths, equivalently, it has all angles of different measure. Hatch marks, also called tick marks, are used in diagrams of triangles, a side can be marked with a pattern of ticks, short line segments in the form of tally marks, two sides have equal lengths if they are both marked with the same pattern. In a triangle, the pattern is no more than 3 ticks. Similarly, patterns of 1,2, or 3 concentric arcs inside the angles are used to indicate equal angles, triangles can also be classified according to their internal angles, measured here in degrees. A right triangle has one of its interior angles measuring 90°, the side opposite to the right angle is the hypotenuse, the longest side of the triangle. The other two sides are called the legs or catheti of the triangle, special right triangles are right triangles with additional properties that make calculations involving them easier. One of the two most famous is the 3–4–5 right triangle, where 32 +42 =52, in this situation,3,4, and 5 are a Pythagorean triple. The other one is a triangle that has 2 angles that each measure 45 degrees. Triangles that do not have an angle measuring 90° are called oblique triangles, a triangle with all interior angles measuring less than 90° is an acute triangle or acute-angled triangle. If c is the length of the longest side, then a2 + b2 > c2, a triangle with one interior angle measuring more than 90° is an obtuse triangle or obtuse-angled triangle. If c is the length of the longest side, then a2 + b2 < c2, a triangle with an interior angle of 180° is degenerate
6.
Edge 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
7.
Cube
–
In geometry, a cube is a three-dimensional solid object bounded by six square faces, facets or sides, with three meeting at each vertex. The cube is the only regular hexahedron and is one of the five Platonic solids and it has 6 faces,12 edges, and 8 vertices. The cube is also a square parallelepiped, an equilateral cuboid and it is a regular square prism in three orientations, and a trigonal trapezohedron in four orientations. The cube is dual to the octahedron and it has cubical or octahedral symmetry. The cube has four special orthogonal projections, centered, on a vertex, edges, face, the first and third correspond to the A2 and B2 Coxeter planes. The cube can also be represented as a tiling. This projection is conformal, preserving angles but not areas or lengths, straight lines on the sphere are projected as circular arcs on the plane. In analytic geometry, a surface with center and edge length of 2a is the locus of all points such that max = a. For a cube of length a, As the volume of a cube is the third power of its sides a × a × a, third powers are called cubes, by analogy with squares. A cube has the largest volume among cuboids with a surface area. Also, a cube has the largest volume among cuboids with the same linear size. They were unable to solve this problem, and in 1837 Pierre Wantzel proved it to be impossible because the root of 2 is not a constructible number. The cube has three uniform colorings, named by the colors of the faces around each vertex,111,112,123. The cube has three classes of symmetry, which can be represented by coloring the faces. The highest octahedral symmetry Oh has all the faces the same color, the dihedral symmetry D4h comes from the cube being a prism, with all four sides being the same color. The lowest symmetry D2h is also a symmetry, with sides alternating colors. Each symmetry form has a different Wythoff symbol, a cube has eleven nets, that is, there are eleven ways to flatten a hollow cube by cutting seven edges. To color the cube so that no two adjacent faces have the color, one would need at least three colors
8.
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
9.
24-cell
–
In geometry, the 24-cell is the convex regular 4-polytope with Schläfli symbol. It is also called C24, icositetrachoron, octaplex, icosatetrahedroid, octacube, hyper-diamond or polyoctahedron, the boundary of the 24-cell is composed of 24 octahedral cells with six meeting at each vertex, and three at each edge. Together they have 96 triangular faces,96 edges, and 24 vertices, the vertex figure is a cube. In fact, the 24-cell is the unique convex self-dual regular Euclidean polytope which is neither a polygon nor a simplex, due to this singular property, it does not have a good analogue in 3 dimensions. A 24-cell is given as the hull of its vertices. The vertices of a 24-cell centered at the origin of 4-space, with edges of length 1, the first 8 vertices are the vertices of a regular 16-cell and the other 16 are the vertices of the dual tesseract. This gives an equivalent to cutting a tesseract into 8 cubical pyramids. This is equivalent to the dual of a rectified 16-cell, the analogous construction in 3-space gives the rhombic dodecahedron which, however, is not regular. We can further divide the last 16 vertices into two groups, those with an number of minus signs and those with an odd number. Each of groups of 8 vertices also define a regular 16-cell, the vertices of the 24-cell can then be grouped into three sets of eight with each set defining a regular 16-cell, and with the complement defining the dual tesseract. The vertices of the dual 24-cell are given by all permutations of, the dual 24-cell has edges of length √2 and is inscribed in a 3-sphere of radius √2. Another method of constructing the 24-cell is by the rectification of the 16-cell, the vertex figure of the 16-cell is the octahedron, thus, cutting the vertices of the 16-cell at the midpoint of its incident edges produce 8 octahedral cells. This process also rectifies the tetrahedral cells of the 16-cell which also become octahedra, a regular tessellation of 4-dimensional Euclidean space exists with 24-cells, called an icositetrachoric honeycomb, with Schläfli symbol. Hence, the angle of a 24-cell is 120°. The regular dual tessellation, has 16-cells, the 24 vertices of the 24-cell represent the root vectors of the simple Lie group D4. The vertices can be seen in 3 hyperplanes, with the 6 vertices of a cell on each of the outer hyperplanes and 12 vertices of a cuboctahedron on a central hyperplane. These vertices, combined with the 8 vertices of the 16-cell, represent the 32 root vectors of the B4, the 48 vertices of the union of the 24-cell and its dual form the root system of type F4. The 24 vertices of the original 24-cell form a system of type D4
10.
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
11.
24-cell honeycomb
–
In four-dimensional Euclidean geometry, the 24-cell honeycomb, or icositetrachoric honeycomb is a regular space-filling tessellation of 4-dimensional Euclidean space by regular 24-cells. It can be represented by Schläfli symbol, the dual tessellation by regular 16-cell honeycomb has Schläfli symbol. Together with the tesseractic honeycomb these are the regular tessellations of Euclidean 4-space. If a 3-sphere is inscribed in each hypercell of this tessellation, the packing density of this arrangement is π216 ≅0.61685. The 24-cell honeycomb can be constructed as the Voronoi tessellation of the D4 or F4 root lattice, each 24-cell is then centered at a D4 lattice point, i. e. one of. These points can also be described as Hurwitz quaternions with even square norm, the vertices of the honeycomb lie at the deep holes of the D4 lattice. These are the Hurwitz quaternions with odd square norm and it can be constructed as a birectified tesseractic honeycomb, by taking a tesseractic honeycomb and placing vertices at the centers of all the square faces. The 24-cell facets exist between these vertices as rectified 16-cells, if the coordinates of the tesseractic honeycomb are integers, the birectified tesseractic honeycomb vertices can be placed at all permutations of half-unit shifts in two of the four dimensions, thus. Each 24-cell in the 24-cell honeycomb has 24 neighboring 24-cells, with each neighbor it shares exactly one octahedral cell. It has 24 more neighbors such that each of these it shares a single vertex. It has no neighbors with which it only an edge or only a face. The vertex figure of the 24-cell honeycomb is a tesseract, so there are 16 edges,32 triangles,24 octahedra, and 8 24-cells meeting at every vertex. The edge figure is a tetrahedron, so there are 4 triangles,6 octahedra, finally, the face figure is a triangle, so there are 3 octahedra and 3 24-cells meeting at every face. One way to visualize a 4-dimensional figure is to consider various 3-dimensional cross-sections and that is, the intersection of various hyperplanes with the figure in question. Applying this technique to the 24-cell honeycomb gives rise to various 3-dimensional honeycombs with varying degrees of regularity, a vertex-first cross-section uses some hyperplane orthogonal to a line joining opposite vertices of one of the 24-cells. For instance, one could take any of the hyperplanes in the coordinate system given above. The cross-section of by one of these gives a rhombic dodecahedral honeycomb. Each of the rhombic dodecahedra corresponds to a maximal cross-section of one of the 24-cells intersecting the hyperplane, accordingly, the rhombic dodecahedral honeycomb is the Voronoi tessellation of the D3 root lattice
12.
Isogonal figure
–
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
13.
Isotoxal figure
–
In geometry, a polytope, or a tiling, is isotoxal or edge-transitive if its symmetries act transitively on its edges. The term isotoxal is derived from the Greek τοξον meaning arc, an isotoxal polygon is an equilateral polygon, but not all equilateral polygons are isotoxal. The duals of isotoxal polygons are isogonal polygons, in general, an isotoxal 2n-gon will have Dn dihedral symmetry. A rhombus is a polygon with D2 symmetry. All regular polygons are isotoxal, having double the symmetry order. A regular 2n-gon is a polygon and can be marked with alternately colored vertices. An isotoxal polyhedron or tiling must be either isogonal or isohedral or both, regular polyhedra are isohedral, isogonal and isotoxal. Quasiregular polyhedra are isogonal and isotoxal, but not isohedral, their duals are isohedral and isotoxal, not every polyhedron or 2-dimensional tessellation constructed from regular polygons is isotoxal. An isotoxal polyhedron has the dihedral angle for all edges. There are nine convex isotoxal polyhedra formed from the Platonic solids,8 formed by the Kepler–Poinsot polyhedra, cS1 maint, Multiple names, authors list Coxeter, Harold Scott MacDonald, Longuet-Higgins, M. S. Miller, J. C. P. Uniform polyhedra, Philosophical Transactions of the Royal Society of London, mathematical and Physical Sciences,246, 401–450, doi,10. 1098/rsta.1954.0003, ISSN 0080-4614, JSTOR91532, MR0062446
14.
Isohedral figure
–
In geometry, a polytope of dimension 3 or higher is isohedral or face-transitive when all its faces are the same. More specifically, all faces must be not merely congruent but must be transitive, in other words, for any faces A and B, there must be a symmetry of the entire solid by rotations and reflections that maps A onto B. For this reason, convex polyhedra are the shapes that will make fair dice. They can be described by their face configuration, a polyhedron which is isohedral has a dual polyhedron that is vertex-transitive. The Catalan solids, the bipyramids and the trapezohedra are all isohedral and they are the duals of the isogonal Archimedean solids, prisms and antiprisms, respectively. The Platonic solids, which are either self-dual or dual with another Platonic solid, are vertex, edge, a polyhedron which is isohedral and isogonal is said to be noble. A polyhedron is if it contains k faces within its symmetry fundamental domain. Similarly a k-isohedral tiling has k separate symmetry orbits, a monohedral polyhedron or monohedral tiling has congruent faces, as either direct or reflectively, which occur in one or more symmetry positions. An r-hedral polyhedra or tiling has r types of faces, a facet-transitive or isotopic figure is a n-dimensional polytopes or honeycomb, with its facets congruent and transitive. The dual of an isotope is an isogonal polytope, by definition, this isotopic property is common to the duals of the uniform polytopes. An isotopic 2-dimensional figure is isotoxal, an isotopic 3-dimensional figure is isohedral. An isotopic 4-dimensional figure is isochoric, edge-transitive Anisohedral tiling Peter R. Cromwell, Polyhedra, Cambridge University Press 1997, ISBN 0-521-55432-2, p.367 Transitivity Olshevsky, George. Archived from the original on 4 February 2007
15.
Four-dimensional space
–
For example, the volume of a rectangular box is found by measuring its length, width, and depth. More than two millennia ago Greek philosophers explored in detail the implications of this uniformity, culminating in Euclids Elements. However, it was not until recent times that a handful of insightful mathematical innovators generalized the concept of dimensions to more than three. The idea of adding a fourth dimension began with Joseph-Louis Lagrange in the mid 1700s, in 1880 Charles Howard Hinton popularized these insights in an essay titled What is the Fourth Dimension. Which was notable for explaining the concept of a cube by going through a step-by-step generalization of the properties of lines, squares. The simplest form of Hintons method is to draw two ordinary cubes separated by a distance, and then draw lines between their equivalent vertices. This form can be seen in the accompanying animation whenever it shows a smaller inner cube inside a larger outer cube, the eight lines connecting the vertices of the two cubes in that case represent a single direction in the unseen fourth dimension. Higher dimensional spaces have become one of the foundations for formally expressing modern mathematics and physics. Large parts of these topics could not exist in their current forms without the use of such spaces, calendar entries for example are usually 4D locations, such as a meeting at time t at the intersection of two streets on some building floor. In list form such a meeting place at the 4D location. Einsteins concept of spacetime uses such a 4D space, though it has a Minkowski structure that is a bit more complicated than Euclidean 4D space, when dimensional locations are given as ordered lists of numbers such as they are called vectors or n-tuples. It is only when such locations are linked together into more complicated shapes that the richness and geometric complexity of 4D. A hint of that complexity can be seen in the animation of one of simplest possible 4D objects. Lagrange wrote in his Mécanique analytique that mechanics can be viewed as operating in a four-dimensional space — three dimensions of space, and one of time, the possibility of geometry in higher dimensions, including four dimensions in particular, was thus established. An arithmetic of four dimensions called quaternions was defined by William Rowan Hamilton in 1843 and this associative algebra was the source of the science of vector analysis in three dimensions as recounted in A History of Vector Analysis. Soon after tessarines and coquaternions were introduced as other four-dimensional algebras over R, one of the first major expositors of the fourth dimension was Charles Howard Hinton, starting in 1880 with his essay What is the Fourth Dimension. Published in the Dublin University magazine and he coined the terms tesseract, ana and kata in his book A New Era of Thought, and introduced a method for visualising the fourth dimension using cubes in the book Fourth Dimension. Hintons ideas inspired a fantasy about a Church of the Fourth Dimension featured by Martin Gardner in his January 1962 Mathematical Games column in Scientific American, in 1886 Victor Schlegel described his method of visualizing four-dimensional objects with Schlegel diagrams
16.
Euclidean geometry
–
Euclidean geometry is a mathematical system attributed to the Alexandrian Greek mathematician Euclid, which he described in his textbook on geometry, the Elements. Euclids method consists in assuming a set of intuitively appealing axioms. Although many of Euclids results had been stated by earlier mathematicians, Euclid was the first to show how these propositions could fit into a comprehensive deductive and logical system. The Elements begins with plane geometry, still taught in school as the first axiomatic system. It goes on to the geometry of three dimensions. Much of the Elements states results of what are now called algebra and number theory, for more than two thousand years, the adjective Euclidean was unnecessary because no other sort of geometry had been conceived. Euclids axioms seemed so obvious that any theorem proved from them was deemed true in an absolute, often metaphysical. Today, however, many other self-consistent non-Euclidean geometries are known, Euclidean geometry is an example of synthetic geometry, in that it proceeds logically from axioms to propositions without the use of coordinates. This is in contrast to analytic geometry, which uses coordinates, the Elements is mainly a systematization of earlier knowledge of geometry. Its improvement over earlier treatments was recognized, with the result that there was little interest in preserving the earlier ones. There are 13 total books in the Elements, Books I–IV, Books V and VII–X deal with number theory, with numbers treated geometrically via their representation as line segments with various lengths. Notions such as numbers and rational and irrational numbers are introduced. The infinitude of prime numbers is proved, a typical result is the 1,3 ratio between the volume of a cone and a cylinder with the same height and base. Euclidean geometry is a system, in which all theorems are derived from a small number of axioms. To produce a straight line continuously in a straight line. To describe a circle with any centre and distance and that all right angles are equal to one another. Although Euclids statement of the only explicitly asserts the existence of the constructions. The Elements also include the five common notions, Things that are equal to the same thing are also equal to one another
17.
Tessellations
–
A tessellation of a flat surface is the tiling of a plane using one or more geometric shapes, called tiles, with no overlaps and no gaps. In mathematics, tessellations can be generalized to higher dimensions and a variety of geometries, a periodic tiling has a repeating pattern. The patterns formed by periodic tilings can be categorized into 17 wallpaper groups, a tiling that lacks a repeating pattern is called non-periodic. An aperiodic tiling uses a set of tile shapes that cannot form a repeating pattern. In the geometry of higher dimensions, a space-filling or honeycomb is called a tessellation of space. A real physical tessellation is a made of materials such as cemented ceramic squares or hexagons. Such tilings may be decorative patterns, or may have such as providing durable and water-resistant pavement. Historically, tessellations were used in Ancient Rome and in Islamic art such as in the decorative geometric tiling of the Alhambra palace, in the twentieth century, the work of M. C. Escher often made use of tessellations, both in ordinary Euclidean geometry and in geometry, for artistic effect. Tessellations are sometimes employed for decorative effect in quilting, Tessellations form a class of patterns in nature, for example in the arrays of hexagonal cells found in honeycombs. Tessellations were used by the Sumerians in building wall decorations formed by patterns of clay tiles, decorative mosaic tilings made of small squared blocks called tesserae were widely employed in classical antiquity, sometimes displaying geometric patterns. In 1619 Johannes Kepler made a documented study of tessellations. He wrote about regular and semiregular tessellations in his Harmonices Mundi, he was possibly the first to explore and to explain the structures of honeycomb. Some two hundred years later in 1891, the Russian crystallographer Yevgraf Fyodorov proved that every periodic tiling of the features one of seventeen different groups of isometries. Fyodorovs work marked the beginning of the mathematical study of tessellations. Other prominent contributors include Shubnikov and Belov, and Heinrich Heesch, in Latin, tessella is a small cubical piece of clay, stone or glass used to make mosaics. The word tessella means small square and it corresponds to the everyday term tiling, which refers to applications of tessellations, often made of glazed clay. Tessellation or tiling in two dimensions is a topic in geometry that studies how shapes, known as tiles, can be arranged to fill a plane without any gaps, according to a given set of rules
18.
Honeycomb (geometry)
–
In geometry, a honeycomb is a space filling or close packing of polyhedral or higher-dimensional cells, so that there are no gaps. It is an example of the general mathematical tiling or tessellation in any number of dimensions. Its dimension can be clarified as n-honeycomb for a honeycomb of n-dimensional space, honeycombs are usually constructed in ordinary Euclidean space. They may also be constructed in non-Euclidean spaces, such as hyperbolic honeycombs, any finite uniform polytope can be projected to its circumsphere to form a uniform honeycomb in spherical space. There are infinitely many honeycombs, which have only been partially classified, the more regular ones have attracted the most interest, while a rich and varied assortment of others continue to be discovered. The simplest honeycombs to build are formed from stacked layers or slabs of prisms based on some tessellations of the plane, in particular, for every parallelepiped, copies can fill space, with the cubic honeycomb being special because it is the only regular honeycomb in ordinary space. Another interesting family is the Hill tetrahedra and their generalizations, which can tile the space. A 3-dimensional uniform honeycomb is a honeycomb in 3-space composed of polyhedral cells. There are 28 convex examples in Euclidean 3-space, also called the Archimedean honeycombs, a honeycomb is called regular if the group of isometries preserving the tiling acts transitively on flags, where a flag is a vertex lying on an edge lying on a face lying on a cell. Every regular honeycomb is automatically uniform, however, there is just one regular honeycomb in Euclidean 3-space, the cubic honeycomb. An infinite number of unique honeycombs can be created by order of patterns of repeating these slab layers. A honeycomb having all cells identical within its symmetries is said to be cell-transitive or isochoric, in the 3-dimensional euclidean space, a cell of such a honeycomb is said to be a space-filling polyhedron. A necessary condition for a polyhedron to be a space-filling polyhedron is that its Dehn invariant must be zero, five space-filling polyhedra can tessellate 3-dimensional euclidean space using translations only. They are called parallelohedra, Cubic honeycomb Hexagonal prismatic honeycomb Rhombic dodecahedral honeycomb Elongated dodecahedral honeycomb, bitruncated cubic honeycomb Other known examples of space-filling polyhedra include, The Triangular prismatic honeycomb. The gyrated triangular prismatic honeycomb The triakis truncated tetrahedral honeycomb, the Voronoi cells of the carbon atoms in diamond are this shape. The trapezo-rhombic dodecahedral honeycomb Isohedral tilings, sometimes, two or more different polyhedra may be combined to fill space. Two classes can be distinguished, Non-convex cells which pack without overlapping and these include a packing of the small stellated rhombic dodecahedron, as in the Yoshimoto Cube. Overlapping of cells whose positive and negative densities cancel out to form a uniformly dense continuum, in 3-dimensional hyperbolic space, the dihedral angle of a polyhedron depends on its size
19.
Tesseractic honeycomb
–
Its vertex figure is a 16-cell. Two tesseracts meet at each cell, four meet at each square face, eight meet on each edge. It is an analog of the tiling, of the plane. These are all part of the hypercubic honeycomb family of tessellations of the form, tessellations in this family are Self-dual. Vertices of this honeycomb can be positioned in 4-space in all integer coordinates, there are many different Wythoff constructions of this honeycomb. The most symmetric form is regular, with Schläfli symbol, another form has two alternating tesseract facets with Schläfli symbol. The lowest symmetry Wythoff construction has 16 types of facets around each vertex, one can be made by stericating another. The, Coxeter group generates 31 permutations of uniform tessellations,21 with distinct symmetry and 20 with distinct geometry, the expanded tesseractic honeycomb is geometrically identical to the tesseractic honeycomb. Three of the symmetric honeycombs are shared in the family, two alternations and, and the quarter tesseractic are repeated in other families. The, Coxeter group generates 31 permutations of uniform tessellations,23 with distinct symmetry and 4 with distinct geometry, there are two alternated forms, the alternations and have the same geometry as the 16-cell honeycomb and snub 24-cell honeycomb respectively. The 24-cell honeycomb is similar, but as a body centered cubic, it has vertices positioned at integers, the tesseract can make a regular tessellation of the 4-sphere, with three tesseracts per face, with Schläfli symbol, called an order-3 tesseractic honeycomb. It is topologically equivalent to the regular polytope penteract in 5-space, the tesseract can make a regular tessellation of 4-dimensional hyperbolic space, with 5 tesseracts around each face, with Schläfli symbol, called an order-5 tesseractic honeycomb. A birectified tesseractic honeycomb, contains all rectified 16-cell facets and is the Voronoi tessellation of the D4* lattice. Facets can be colored from a doubled C ~4 ×2, symmetry, alternately colored from C ~4, symmetry, three colors from B ~4, symmetry, and 4 colors from D ~4. Regular and uniform honeycombs in 4-space, 16-cell honeycomb 24-cell honeycomb 5-cell honeycomb Truncated 5-cell honeycomb Omnitruncated 5-cell honeycomb Coxeter, Regular Polytopes, Dover edition, ISBN 0-486-61480-8 p.296, Table II, Regular honeycombs 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 III, George Olshevsky, Uniform Panoploid Tetracombs, Manuscript - Model 1 Klitzing, Richard
20.
Vertex arrangement
–
In geometry, a vertex arrangement is a set of points in space described by their relative positions. They can be described by their use in polytopes, for example, a square vertex arrangement is understood to mean four points in a plane, equal distance and angles from a center point. Two polytopes share the same vertex arrangement if they share the same 0-skeleton, the same set of vertices can be connected by edges in different ways. For example, the pentagon and pentagram have the same vertex arrangement, a vertex arrangement is often described by the convex hull polytope which contains it. For example, the regular pentagram can be said to have a vertex arrangement. Infinite tilings can also share common vertex arrangements, for example, this triangular lattice of points can be connected to form either isosceles triangles or rhombic faces. Polyhedra can also share an edge arrangement while differing in their faces, for example, of the ten nonconvex regular Schläfli-Hess polychora, there are only 7 unique face arrangements. Synonyms for special cases include company for a 2-regiment and army for a 0-regiment, n-skeleton - a set of elements of dimension n and lower in a higher polytope. Vertex figure - A local arrangement of faces in a polyhedron around a single vertex, archived from the original on 4 February 2007. Archived from the original on 4 February 2007, archived from the original on 4 February 2007
21.
F4 (mathematics)
–
In mathematics, F4 is the name of a Lie group and also its Lie algebra f4. It is one of the five exceptional simple Lie groups, F4 has rank 4 and dimension 52. The compact form is connected and its outer automorphism group is the trivial group. The compact real form of F4 is the group of a 16-dimensional Riemannian manifold known as the octonionic projective plane OP2. This can be seen using a construction known as the magic square, due to Hans Freudenthal. There are 3 real forms, a one, a split one. They are the groups of the three real Albert algebras. The F4 Lie algebra may be constructed by adding 16 generators transforming as a spinor to the 36-dimensional Lie algebra so, in older books and papers, F4 is sometimes denoted by E4. The Dynkin diagram for F4 is and its Weyl/Coxeter group G = W is the symmetry group of the 24-cell, it is a solvable group of order 1152. It has minimal faithful degree μ =24 which is realized by the action on the 24-cell, the F4 lattice is a four-dimensional body-centered cubic lattice. They form a ring called the Hurwitz quaternion ring, the 24 Hurwitz quaternions of norm 1 form the vertices of a 24-cell centered at the origin. One choice of roots for F4, is given by the rows of the following matrix. Invariant, F4 is the group of automorphisms of the set of 3 polynomials in 27 variables. Another way of writing these invariants is as Tr, Tr and Tr of the hermitian octonion matrix, the characters of finite dimensional representations of the real and complex Lie algebras and Lie groups are all given by the Weyl character formula. There are two non-isomorphic irreducible representations of dimensions 1053,160056,4313088, etc, the fundamental representations are those with dimensions 52,1274,273,26. The Exceptional Simple Lie Algebras F and E. Proc
22.
Alternation (geometry)
–
In geometry, an alternation or partial truncation, is an operation on a polygon, polyhedron, tiling, or higher dimensional polytope that removes alternate vertices. Coxeter labels an alternation by a prefixed by an h, standing for hemi or half, because alternation reduce all polygon faces to half as many sides, it can only be applied for polytopes with all even-sided faces. An alternated square face becomes a digon, and being degenerate, is reduced to a single edge. More generally any vertex-uniform polyhedron or tiling with a configuration consisting of all even-numbered elements can be alternated. For example, the alternation a vertex figure with 2a. 2b. 2c is a.3. b.3. c.3 where the three is the number of elements in this vertex figure. A special case is square faces whose order divide in half into degenerate digons, a snub can be seen as an alternation of a truncated regular or truncated quasiregular polyhedron. In general a polyhedron can be snubbed if its truncation has only even-sided faces, all truncated rectified polyhedra can be snubbed, not just from regular polyhedra. The snub square antiprism is an example of a general snub and this alternation operation applies to higher-dimensional polytopes and honeycombs as well, but in general most of the results of this operation will not be uniform. The voids created by the vertices will not in general create uniform facets. Examples, Honeycombs An alternated cubic honeycomb is the tetrahedral-octahedral honeycomb, an alternated hexagonal prismatic honeycomb is the gyrated alternated cubic honeycomb. 4-polytope An alternated truncated 24-cell is the snub 24-cell, 4-honeycombs, An alternated truncated 24-cell honeycomb is the snub 24-cell honeycomb. A hypercube can always be alternated into a uniform demihypercube, cube → Tetrahedron → Tesseract → 16-cell → Penteract → demipenteract Hexeract → demihexeract. Coxeter also used the operator a, which contains both halves, so retains the original symmetry, for even-sided regular polyhedra, a represents a compound polyhedron with two opposite copies of h. For odd-sided, greater than 3, regular polyhedra a, becomes a star polyhedron, Norman Johnson extended the use of the altered operator a, b for blended, and c for converted, as, and respectively. The compound polyhedron, stellated octahedron can be represented by a, the star-polyhedron, small ditrigonal icosidodecahedron, can be represented by a, and. Here all the pentagons have been alternated into pentagrams, and triangles have been inserted to take up the free edges. A similar operation can truncate alternate vertices, rather than just removing them, below is a set of polyhedra that can be generated from the Catalan solids. These have two types of vertices which can be alternately truncated, truncating the higher order vertices and both vertex types produce these forms, Conway polyhedral notation Wythoff construction Coxeter, H. S. M
23.
Tetrahedral-octahedral honeycomb
–
The tetrahedral-octahedral honeycomb, alternated cubic honeycomb is a quasiregular space-filling tessellation in Euclidean 3-space. It is composed of alternating octahedra and tetrahedra in a ratio of 1,2, other names include half cubic honeycomb, half cubic cellulation, or tetragonal disphenoidal cellulation. John Horton Conway calls this honeycomb a tetroctahedrille, and its dual dodecahedrille and it is vertex-transitive with 8 tetrahedra and 6 octahedra around each vertex. It is edge-transitive with 2 tetrahedra and 2 octahedra alternating on each edge, a geometric honeycomb is a space-filling of polyhedral or higher-dimensional cells, so that there are no gaps. It is an example of the general mathematical tiling or tessellation in any number of dimensions. Honeycombs are usually constructed in ordinary Euclidean space, like the uniform honeycombs. They may also be constructed in non-Euclidean spaces, such as hyperbolic uniform honeycombs, any finite uniform polytope can be projected to its circumsphere to form a uniform honeycomb in spherical space. It is also part of another family of uniform honeycombs called simplectic honeycombs. In this case of 3-space, the honeycomb is alternated, reducing the cubic cells to tetrahedra. As such it can be represented by an extended Schläfli symbol h as containing half the vertices of the cubic honeycomb, theres a similar honeycomb called gyrated tetrahedral-octahedral honeycomb which has layers rotated 60 degrees so half the edges have neighboring rather than alternating tetrahedra and octahedra. Each slice will contain up and downward facing square pyramids and tetrahedra sitting on their edges, a second slice direction needs no new faces and includes alternating tetrahedral and octahedral. This slab honeycomb is a scaliform honeycomb rather than uniform because it has nonuniform cells, the alternated cubic honeycomb can be orthogonally projected into the planar square tiling by a geometric folding operation that maps one pairs of mirrors into each other. The projection of the cubic honeycomb creates two offset copies of the square tiling vertex arrangement of the plane, Its vertex arrangement represents an A3 lattice or D3 lattice. It is the 3-dimensional case of a simplectic honeycomb and its Voronoi cell is a rhombic dodecahedron, the dual of the cuboctahedron vertex figure for the tet-oct honeycomb. The D+3 packing can be constructed by the union of two D3 lattices, the D+ n packing is only a lattice for even dimensions. The kissing number of the D*3 lattice is 8 and its Voronoi tessellation is a cubic honeycomb. The, Coxeter group generates 15 permutations of uniform honeycombs,9 with distinct geometry including the cubic honeycomb. The expanded cubic honeycomb is geometrically identical to the cubic honeycomb, the, Coxeter group generates 9 permutations of uniform honeycombs,4 with distinct geometry including the alternated cubic honeycomb
24.
D4 lattice
–
In four-dimensional Euclidean geometry, the 16-cell honeycomb is one of the three regular space-filling tessellations in Euclidean 4-space. The other two are its dual the 24-cell honeycomb, and the tesseractic honeycomb and this honeycomb is constructed from 16-cell facets, three around every face. It has a 24-cell vertex figure and this vertex arrangement or lattice is called the B4, D4, or F4 lattice. Vertices can be placed at all integer coordinates, such that the sum of the coordinates is even, the vertex arrangement of the 16-cell honeycomb is called the D4 lattice or F4 lattice. The D+4 lattice can be constructed by the union of two D4 lattices, and is identical to the honeycomb, ∪ = = This packing is only a lattice for even dimensions. The kissing number is 23 =8, the kissing number of the D*4 lattice is 24 and its Voronoi tessellation is a 24-cell honeycomb, containing all rectified 16-cells Voronoi cells, or. There are three different symmetry constructions of this tessellation, each symmetry can be represented by different arrangements of colored 16-cell facets. It is related to the regular hyperbolic 5-space 5-orthoplex honeycomb, with 5-orthoplex facets, the regular 4-polytope 24-cell, with octahedral cell, and cube, with square faces. S. M. Regular Polytopes, Dover edition, ISBN 0-486-61480-8 pp. 154–156, Partial truncation or alternation, represented by h prefix, 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 III, George Olshevsky, Uniform Panoploid Tetracombs, Manuscript Klitzing, Richard. X3o3o4o3o - hext - O104 Conway JH, Sloane NJH
25.
3-sphere
–
In mathematics, a 3-sphere is a higher-dimensional analogue of a sphere. It consists of the set of points equidistant from a central point in 4-dimensional Euclidean space. A 3-sphere is an example of a 3-manifold, in coordinates, a 3-sphere with center and radius r is the set of all points in real, 4-dimensional space such that ∑ i =032 =2 +2 +2 +2 = r 2. The 3-sphere centered at the origin with radius 1 is called the unit 3-sphere and is usually denoted S3 and it is often convenient to regard R4 as the space with 2 complex dimensions or the quaternions. The unit 3-sphere is then given by S3 = or S3 = and this description as the quaternions of norm one, identifies the 3-sphere with the versors in the quaternion division ring. Just as the circle is important for planar polar coordinates. See polar decomposition of a quaternion for details of development of the three-sphere. This view of the 3-sphere is the basis for the study of space as developed by Georges Lemaître. The 3-dimensional cubic hyperarea of a 3-sphere of radius r is 2 π2 r 3 while the 4-dimensional quartic hypervolume is 12 π2 r 4, every non-empty intersection of a 3-sphere with a three-dimensional hyperplane is a 2-sphere. Then the 2-sphere shrinks again down to a point as the 3-sphere leaves the hyperplane. A 3-sphere is a compact, connected, 3-dimensional manifold without boundary, what this means, in the broad sense, is that any loop, or circular path, on the 3-sphere can be continuously shrunk to a point without leaving the 3-sphere. The Poincaré conjecture, proved in 2003 by Grigori Perelman, provides that the 3-sphere is the only three-dimensional manifold with these properties, the 3-sphere is homeomorphic to the one-point compactification of R3. In general, any space that is homeomorphic to the 3-sphere is called a topological 3-sphere. The homology groups of the 3-sphere are as follows, H0, any topological space with these homology groups is known as a homology 3-sphere. Initially Poincaré conjectured that all homology 3-spheres are homeomorphic to S3, infinitely many homology spheres are now known to exist. For example, a Dehn filling with slope 1/n on any knot in the 3-sphere gives a homology sphere, as to the homotopy groups, we have π1 = π2 = and π3 is infinite cyclic. The higher-homotopy groups are all finite abelian but otherwise follow no discernible pattern, for more discussion see homotopy groups of spheres. The 3-sphere is naturally a smooth manifold, in fact, an embedded submanifold of R4
26.
Sphere packing
–
In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical size, and the space is usually three-dimensional Euclidean space, however, sphere packing problems can be generalised to consider unequal spheres, n-dimensional Euclidean space or to non-Euclidean spaces such as hyperbolic space. A typical sphere packing problem is to find an arrangement in which the fill as large a proportion of the space as possible. The proportion of space filled by the spheres is called the density of the arrangement, for equal spheres in three dimensions the densest packing uses approximately 74% of the volume. A random packing of equal spheres generally has a density around 64%, a lattice arrangement is one in which the centers of the spheres form a very symmetric pattern which only needs n vectors to be uniquely defined. Arrangements in which the spheres do not form a lattice can still be periodic, lattice arrangements are easier to handle than irregular ones—their high degree of symmetry makes it easier to classify them and to measure their densities. In three-dimensional Euclidean space, the densest packing of spheres is achieved by a family of structures called close-packed structures. One method for generating such a structure is as follows, consider a plane with a compact arrangement of spheres on it. For any three neighbouring spheres, a sphere can be placed on top in the hollow between the three bottom spheres. If we do this everywhere in a plane above the first. A third layer can be placed directly above the first one, or the spheres can be offset, there are thus three types of planes, called A, B and C. Two simple arrangements within the close-packed family correspond to regular lattices, one is called cubic close packing — where the layers are alternated in the ABCABC… sequence. The other is called hexagonal close packing — where the layers are alternated in the ABAB… sequence, but many layer stacking sequences are possible, and still generate a close-packed structure. In all of these arrangements each sphere is surrounded by 12 other spheres, carl Friedrich Gauss proved in 1831 that these packings have the highest density amongst all possible lattice packings. In 1611 Johannes Kepler had conjectured that this is the maximum possible density amongst both regular and irregular arrangements — this became known as the Kepler conjecture. In 1998, Thomas Callister Hales, following the approach suggested by László Fejes Tóth in 1953, Hales proof is a proof by exhaustion involving checking of many individual cases using complex computer calculations. Referees said that they were 99% certain of the correctness of Hales proof, on 10 August 2014 Hales announced the completion of a formal proof using automated proof checking, removing any doubt. Some other lattice packings are often found in physical systems, Packings where all spheres are constrained by their neighbours to stay in one location are called rigid or jammed
27.
Kissing number problem
–
In geometry, a kissing number is defined as the number of non-overlapping unit spheres that can be arranged such that they each touch another given unit sphere. For a lattice packing the kissing number is the same for every sphere, other names for kissing number that have been used are Newton number, and contact number. In general, the number problem seeks the maximum possible kissing number for n-dimensional spheres in -dimensional Euclidean space. Ordinary spheres correspond to two-dimensional closed surfaces in three-dimensional space, finding the kissing number when centers of spheres are confined to a line or a plane is trivial. Proving a solution to the case, despite being easy to conceptualise and model in the physical world. Solutions in higher dimensions are more challenging, and only a handful of cases have been solved exactly. For others investigations have determined upper and lower bounds, but not exact solutions. In one dimension, the number is 2, In two dimensions, the kissing number is 6, Proof, Consider a circle with center C that is touched by circles with centers C1. These rays all emanate from the same center C, so the sum of angles between adjacent rays is 360°, assume by contradiction that there are more than six touching circles. Then at least two adjacent rays, say C C1 and C C2, are separated by an angle of less than 60°, the segments C Ci have the same length – 2r – for all i. Therefore the triangle C C1 C2 is isosceles, and its third side – C1 C2 – has a length of less than 2r. Therefore the circles 1 and 2 intersect – a contradiction, in three dimensions, the kissing number is 12, but the correct value was much more difficult to establish than in dimensions one and two. It is easy to arrange 12 spheres so that each touches a central sphere, but there is a lot of left over. This was the subject of a disagreement between mathematicians Isaac Newton and David Gregory. Newton correctly thought that the limit was 12, Gregory thought that a 13th could fit, some incomplete proofs that Newton was correct were offered in the nineteenth century, most notably one by Reinhold Hoppe, but the first correct proof did not appear until 1953. The twelve neighbors of the sphere correspond to the maximum bulk coordination number of an atom in a crystal lattice in which all atoms have the same size. A coordination number of 12 is found in a cubic close-packed or a hexagonal close-packed structure, in four dimensions, it was known for some time that the answer is either 24 or 25. It is easy to produce a packing of 24 spheres around a central sphere, as in the three-dimensional case, there is a lot of space left over—even more, in fact, than for n = 3—so the situation was even less clear
28.
Cubic crystal system
–
In crystallography, the cubic crystal system is a crystal system where the unit cell is in the shape of a cube. This is one of the most common and simplest shapes found in crystals and minerals, there are three main varieties of these crystals, Primitive cubic Body-centered cubic, Face-centered cubic Each is subdivided into other variants listed below. Note that although the cell in these crystals is conventionally taken to be a cube. This is related to the fact that in most cubic crystal systems, a classic isometric crystal has square or pentagonal faces. The three Bravais lattices in the crystal system are, The primitive cubic system consists of one lattice point on each corner of the cube. Each atom at a point is then shared equally between eight adjacent cubes, and the unit cell therefore contains in total one atom. The body-centered cubic system has one point in the center of the unit cell in addition to the eight corner points. It has a net total of 2 lattice points per unit cell, Each sphere in a cF lattice has coordination number 12. The face-centered cubic system is related to the hexagonal close packed system. The plane of a cubic system is a hexagonal grid. Attempting to create a C-centered cubic crystal system would result in a simple tetragonal Bravais lattice, there are a total 36 cubic space groups. Other terms for hexoctahedral are, normal class, holohedral, ditesseral central class, a simple cubic unit cell has a single cubic void in the center. Additionally, there are 24 tetrahedral voids located in a square spacing around each octahedral void and these tetrahedral voids are not local maxima and are not technically voids, but they do occasionally appear in multi-atom unit cells. A face-centered cubic unit cell has eight tetrahedral voids located midway between each corner and the center of the cell, for a total of eight net tetrahedral voids. One important characteristic of a structure is its atomic packing factor. This is calculated by assuming all the atoms are identical spheres. The atomic packing factor is the proportion of space filled by these spheres, assuming one atom per lattice point, in a primitive cubic lattice with cube side length a, the sphere radius would be a⁄2 and the atomic packing factor turns out to be about 0.524. Similarly, in a bcc lattice, the atomic packing factor is 0.680, as a rule, since atoms in a solid attract each other, the more tightly packed arrangements of atoms tend to be more common
29.
4-cube honeycomb
–
Its vertex figure is a 16-cell. Two tesseracts meet at each cell, four meet at each square face, eight meet on each edge. It is an analog of the tiling, of the plane. These are all part of the hypercubic honeycomb family of tessellations of the form, tessellations in this family are Self-dual. Vertices of this honeycomb can be positioned in 4-space in all integer coordinates, there are many different Wythoff constructions of this honeycomb. The most symmetric form is regular, with Schläfli symbol, another form has two alternating tesseract facets with Schläfli symbol. The lowest symmetry Wythoff construction has 16 types of facets around each vertex, one can be made by stericating another. The, Coxeter group generates 31 permutations of uniform tessellations,21 with distinct symmetry and 20 with distinct geometry, the expanded tesseractic honeycomb is geometrically identical to the tesseractic honeycomb. Three of the symmetric honeycombs are shared in the family, two alternations and, and the quarter tesseractic are repeated in other families. The, Coxeter group generates 31 permutations of uniform tessellations,23 with distinct symmetry and 4 with distinct geometry, there are two alternated forms, the alternations and have the same geometry as the 16-cell honeycomb and snub 24-cell honeycomb respectively. The 24-cell honeycomb is similar, but as a body centered cubic, it has vertices positioned at integers, the tesseract can make a regular tessellation of the 4-sphere, with three tesseracts per face, with Schläfli symbol, called an order-3 tesseractic honeycomb. It is topologically equivalent to the regular polytope penteract in 5-space, the tesseract can make a regular tessellation of 4-dimensional hyperbolic space, with 5 tesseracts around each face, with Schläfli symbol, called an order-5 tesseractic honeycomb. A birectified tesseractic honeycomb, contains all rectified 16-cell facets and is the Voronoi tessellation of the D4* lattice. Facets can be colored from a doubled C ~4 ×2, symmetry, alternately colored from C ~4, symmetry, three colors from B ~4, symmetry, and 4 colors from D ~4. Regular and uniform honeycombs in 4-space, 16-cell honeycomb 24-cell honeycomb 5-cell honeycomb Truncated 5-cell honeycomb Omnitruncated 5-cell honeycomb Coxeter, Regular Polytopes, Dover edition, ISBN 0-486-61480-8 p.296, Table II, Regular honeycombs 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 III, George Olshevsky, Uniform Panoploid Tetracombs, Manuscript - Model 1 Klitzing, Richard
30.
Voronoi diagram
–
In mathematics, a Voronoi diagram is a partitioning of a plane into regions based on distance to points in a specific subset of the plane. That set of points is specified beforehand, and for each seed there is a region consisting of all points closer to that seed than to any other. These regions are called Voronoi cells, the Voronoi diagram of a set of points is dual to its Delaunay triangulation. It is named after Georgy Voronoi, and is called a Voronoi tessellation, a Voronoi decomposition. Voronoi diagrams have practical and theoretical applications to a number of fields, mainly in science and technology. They are also known as Thiessen polygons, in the simplest case, shown in the first picture, we are given a finite set of points in the Euclidean plane. Each such cell is obtained from the intersection of half-spaces, the line segments of the Voronoi diagram are all the points in the plane that are equidistant to the two nearest sites. The Voronoi vertices are the points equidistant to three sites, let X be a metric space with distance function d. Let K be a set of indices and let k ∈ K be a tuple of nonempty subsets in the space X. In other words, if d = inf denotes the distance between the point x and the subset A, then R k = The Voronoi diagram is simply the tuple of cells k ∈ K. In principle some of the sites can intersect and even coincide, in addition, infinitely many sites are allowed in the definition, but again, in many cases only finitely many sites are considered. Sometimes the induced combinatorial structure is referred to as the Voronoi diagram, however, in general the Voronoi cells may not be convex or even connected. In the usual Euclidean space, we can rewrite the definition in usual terms. Each Voronoi polygon R k is associated with a generator point P k, let X be the set of all points in the Euclidean space. Let P1 be a point that generates its Voronoi region R1, P2 that generates R2, and P3 that generates R3, and so on. Then, as expressed by Tran et al all locations in the Voronoi polygon are closer to the point of that polygon than any other generator point in the Voronoi diagram in Euclidian plane. As a simple illustration, consider a group of shops in a city, suppose we want to estimate the number of customers of a given shop. With all else being equal, it is reasonable to assume that customers choose their preferred shop simply by distance considerations, they will go to the shop located nearest to them
31.
4-demicube
–
In four-dimensional geometry, a 16-cell is a regular convex 4-polytope. It is one of the six regular convex 4-polytopes first described by the Swiss mathematician Ludwig Schläfli in the mid-19th century and it is also called C16, hexadecachoron, or hexdecahedroid. It is a part of an family of polytopes, called cross-polytopes or orthoplexes. The dual polytope is the tesseract, conways name for a cross-polytope is orthoplex, for orthant complex. The 16-cell has 16 cells as the tesseract has 16 vertices and it is bounded by 16 cells, all of which are regular tetrahedra. It has 32 triangular faces,24 edges, and 8 vertices, the 24 edges bound 6 squares lying in the 6 coordinate planes. The eight vertices of the 16-cell are, all vertices are connected by edges except opposite pairs. The Schläfli symbol of the 16-cell is and its vertex figure is a regular octahedron. There are 8 tetrahedra,12 triangles, and 6 edges meeting at every vertex and its edge figure is a square. There are 4 tetrahedra and 4 triangles meeting at every edge, the 16-cell can be decomposed into two similar disjoint circular chains of eight tetrahedrons each, four edges long. Each chain, when stretched out straight, forms a Boerdijk–Coxeter helix and this decomposition can be seen in a 4-4 duoantiprism construction of the 16-cell, or, Schläfli symbol ⨂ or ss, symmetry, order 64. The 16-cell can be dissected into two octahedral pyramids, which share a new octahedron base through the 16-cell center, one can tessellate 4-dimensional Euclidean space by regular 16-cells. This is called the 16-cell honeycomb and has Schläfli symbol, hence, the 16-cell has a dihedral angle of 120°. The dual tessellation, 24-cell honeycomb, is made of by regular 24-cells, together with the tesseractic honeycomb, these are the only three regular tessellations of R4. Each 16-cell has 16 neighbors with which it shares a tetrahedron,24 neighbors with which it only an edge. Twenty-four 16-cells meet at any vertex in this tessellation. A 16-cell can constructed from two Boerdijk–Coxeter helixes of eight chained tetrahedra, each folded into a 4-dimensional ring, the 16 triangle faces can be seen in a 2D net within a triangular tiling, with 6 triangles around every vertex. The purple edges represent the Petrie polygon of the 16-cell, the cell-first parallel projection of the 16-cell into 3-space has a cubical envelope
32.
5-orthoplex
–
In five-dimensional geometry, a 5-orthoplex, or 5-cross polytope, is a five-dimensional polytope with 10 vertices,40 edges,80 triangle faces,80 tetrahedron cells,32 5-cell 4-faces. It has two constructed forms, the first being regular with Schläfli symbol, and the second with alternately labeled facets and it is a part of an infinite family of polytopes, called cross-polytopes or orthoplexes. The dual polytope is the 5-hypercube or 5-cube, pentacross, derived from combining the family name cross polytope with pente for five in Greek. Triacontaditeron - as a 32-facetted 5-polytope and this polytope is one of 31 uniform 5-polytopes generated from the B5 Coxeter plane, including the regular 5-cube and 5-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, 5D uniform polytopes x3o3o3o4o - tac. Archived from the original on 4 February 2007, Polytopes of Various Dimensions Multi-dimensional Glossary
33.
Uniform 6-polytope
–
In six-dimensional geometry, a uniform polypeton is a six-dimensional uniform polytope. A uniform polypeton is vertex-transitive, and all facets are uniform 5-polytopes, the complete set of convex uniform polypeta has not been determined, but most can be made as Wythoff constructions from a small set of symmetry groups. These construction operations are represented by the permutations of rings of the Coxeter-Dynkin diagrams, each combination of at least one ring on every connected group of nodes in the diagram produces a uniform 6-polytope. The simplest uniform polypeta are regular polytopes, the 6-simplex, the 6-cube, Regular polytopes,1852, Ludwig Schläfli proved in his manuscript Theorie der vielfachen Kontinuität that there are exactly 3 regular polytopes in 5 or more dimensions. Convex uniform polytopes,1940, The search was expanded systematically by H. S. M, Coxeter in his publication Regular and Semi-Regular Polytopes. Nonregular uniform star polytopes, Ongoing, Thousands of nonconvex uniform polypeta are known, participating researchers include Jonathan Bowers, Richard Klitzing and Norman Johnson. Uniform 6-polytopes with reflective symmetry can be generated by these four Coxeter groups, There are four fundamental reflective symmety groups which generate 153 unique uniform 6-polytopes. Uniform prism There are 6 categorical uniform prisms based on the uniform 5-polytopes, Uniform duoprism There are 11 categorical uniform duoprismatic families of polytopes based on Cartesian products of lower-dimensional uniform polytopes. Each combination of at least one ring on every connected group produces a uniform prismatic 6-polytope, in addition, there are 105 uniform 6-polytope constructions based on prisms of the uniform 5-polytopes. In addition, there are many uniform 6-polytope based on. There are 32+4−1=35 forms, derived by marking one or more nodes of the Coxeter-Dynkin diagram and they are named by Norman Johnson from the Wythoff construction operations upon regular 6-simplex. Bowers-style acronym names are given in parentheses for cross-referencing, the A6 family has symmetry of order 5040. The coordinates of uniform 6-polytopes with 6-simplex symmetry can be generated as permutations of simple integers in 7-space, see also list of A6 polytopes for graphs of these polytopes. There are 63 forms based on all permutations of the Coxeter-Dynkin diagrams with one or more rings, the B6 family has symmetry of order 46080. They are named by Norman Johnson from the Wythoff construction operations upon the regular 6-cube, Bowers names and acronym names are given for cross-referencing. See also list of B6 polytopes for graphs of these polytopes, the D6 family has symmetry of order 23040. This family has 3×16−1=47 Wythoffian uniform polytopes, generated by marking one or more nodes of the D6 Coxeter-Dynkin diagram, of these,31 are repeated from the B6 family and 16 are unique to this family. The 16 unique forms are enumerated below, bowers-style acronym names are given for cross-referencing
34.
Coxeter notation
–
The notation is named after H. S. M. Coxeter, and has been more comprehensively defined by Norman Johnson. For Coxeter groups defined by pure reflections, there is a correspondence between the bracket notation and Coxeter-Dynkin diagram. The numbers in the notation represent the mirror reflection orders in the branches of the Coxeter diagram. It uses the same simplification, suppressing 2s between orthogonal mirrors, the Coxeter notation is simplified with exponents to represent the number of branches in a row for linear diagram. So the An group is represented by, to imply n nodes connected by n-1 order-3 branches, example A2 = = or represents diagrams or. Coxeter initially represented bifurcating diagrams with vertical positioning of numbers, but later abbreviated with an exponent notation, like, Coxeter allowed for zeros as special cases to fit the An family, like A3 = = = =, like = =. Coxeter groups formed by cyclic diagrams are represented by parenthesese inside of brackets, if the branch orders are equal, they can be grouped as an exponent as the length the cycle in brackets, like =, representing Coxeter diagram or. More complicated looping diagrams can also be expressed with care, the paracompact complete graph diagram or, is represented as with the superscript as the symmetry of its regular tetrahedron coxeter diagram. The Coxeter diagram usually leaves order-2 branches undrawn, but the bracket notation includes an explicit 2 to connect the subgraphs, so the Coxeter diagram = A2×A2 = 2A2 can be represented by × =2 =. For the affine and hyperbolic groups, the subscript is one less than the number of nodes in each case, Coxeters notation represents rotational/translational symmetry by adding a + superscript operator outside the brackets which cuts the order of the group in half. This is called a direct subgroup because what remains are only direct isometries without reflective symmetry, + operators can also be applied inside of the brackets, and creates semidirect subgroups that include both reflective and nonreflective generators. Semidirect subgroups can only apply to Coxeter group subgroups that have even order branches next to it, the subgroup index is 2n for n + operators. So the snub cube, has symmetry +, and the tetrahedron, has symmetry. Johnson extends the + operator to work with a placeholder 1 nodes, in general this operation only applies to mirrors bounded by all even-order branches. The 1 represents a mirror so can be seen as, or, like diagram or, the effect of a mirror removal is to duplicate connecting nodes, which can be seen in the Coxeter diagrams, =, or in bracket notation, = =. Each of these mirrors can be removed so h = = = and this can be shown in a Coxeter diagram by adding a + symbol above the node, = =. If both mirrors are removed, a subgroup is generated, with the branch order becoming a gyration point of half the order, q = = +. For example, = = = ×, order 4. = +, the opposite to halving is doubling which adds a mirror, bisecting a fundamental domain, and doubling the group order
35.
Truncated 24-cell honeycomb
–
In four-dimensional Euclidean geometry, the truncated 24-cell honeycomb is a uniform space-filling honeycomb. It can be seen as a truncation of the regular 24-cell honeycomb, containing tesseract and it has a uniform alternation, called the snub 24-cell honeycomb. It is a snub from the D ~4 construction and this truncated 24-cell has Schläfli symbol t, and its snub is represented as s. Each symmetry can be represented by different arrangements of colored truncated 24-cell facets, in all cases, four truncated 24-cells, and one tesseract meet at each vertex, but the vertex figures have different symmetry generators. S. M. Regular Polytopes, Dover edition, ISBN 0-486-61480-8 p.296, Table II, Regular honeycombs Kaleidoscopes, Selected Writings of H. S. M. 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 III, George Olshevsky, Uniform Panoploid Tetracombs, Manuscript Model 99 Klitzing, Richard. O4x3x3x4o, x3x3x *b3x4o, x3x3x *b3x *b3x, o3o3o4x3x, x3x3x4o3o - ticot - O99
36.
Snub 24-cell honeycomb
–
In four-dimensional Euclidean geometry, the snub 24-cell honeycomb, or snub icositetrachoric honeycomb is a uniform space-filling tessellation by snub 24-cells, 16-cells, and 5-cells. It was discovered by Thorold Gosset with his 1900 paper of semiregular polytopes and it is not semiregular by Gossets definition of regular facets, but all of its cells are regular, either tetrahedra or icosahedra. It can be seen as an alternation of a truncated 24-cell honeycomb, and can be represented by Schläfli symbol s, s and it is defined by an irregular decachoron vertex figure, faceted by four snub 24-cells, one 16-cell, and five 5-cells. The vertex figure can be seen topologically as a tetrahedral prism. Then the four side-facets of the prism, the triangular prisms become tridiminished icosahedra, there are five different symmetry constructions of this tessellation. Each symmetry can be represented by different arrangements of colored snub 24-cell, 16-cell, in all cases, four snub 24-cells, five 5-cells, and one 16-cell meet at each vertex, but the vertex figures have different symmetry generators. Gosset, On the Regular and Semi-Regular Figures in Space of n Dimensions, Messenger of Mathematics, Macmillan,1900 Coxeter, Regular Polytopes, Dover edition, ISBN 0-486-61480-8 p.296, Table II, Regular honeycombs 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 III, George Olshevsky, Uniform Panoploid Tetracombs, Manuscript Model 133 Klitzing, o4s3s3s4o, s3s3s *b3s4o, s3s3s *b3s *b3s, o3o3o4s3s, s3s3s4o3o - sadit - O133
37.
5-cell honeycomb
–
In four-dimensional Euclidean geometry, the 4-simplex honeycomb, 5-cell honeycomb or pentachoric-dispentachoric honeycomb is a space-filling tessellation honeycomb. It is composed of 5-cells and rectified 5-cells facets in a ratio of 1,1, cells of the vertex figure are ten tetrahedrons and 20 triangular prisms, corresponding to the ten 5-cells and 20 rectified 5-cells that meet at each vertex. The 20 vertices of its figure, the runcinated 5-cell represent the 20 roots of the A ~4 Coxeter group. It is the 4-dimensional case of a simplectic honeycomb and this inversion results in another non-Wythoffian uniform convex honeycomb. Octahedral prisms and tetrahedral prisms may be inserted in between alternated laminae as well, resulting in two more non-Wythoffian elongated uniform honeycombs and this honeycomb is one of seven unique uniform honeycombs constructed by the A ~4 Coxeter group. The symmetry can be multiplied by the symmetry of rings in the Coxeter–Dynkin diagrams, Small cyclorhombated pentachoric tetracomb small prismatodispentachoric tetracomb The cyclotruncated 4-simplex honeycomb or cyclotruncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be seen as a birectified 5-cell honeycomb and it is composed of 5-cells, truncated 5-cells, and bitruncated 5-cells facets in a ratio of 2,2,1. Its vertex figure is an Elongated tetrahedral antiprism, with 8 equilateral triangle and 24 isosceles triangle faces and it can be constructed as five sets of parallel hyperplanes that divide space into two half-spaces. The 3-space hyperplanes contain quarter cubic honeycombs as a collection facets, cyclotruncated pentachoric tetracomb Small truncated-pentachoric tetracomb The truncated 4-simplex honeycomb or truncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be called a cyclocantitruncated 5-cell honeycomb, Great cyclorhombated pentachoric tetracomb Great truncated-pentachoric tetracomb The cantellated 4-simplex honeycomb or cantellated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be called a cycloruncitruncated 5-cell honeycomb, cycloprismatorhombated pentachoric tetracomb Great prismatodispentachoric tetracomb The bitruncated 4-simplex honeycomb or bitruncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be called a cycloruncicantitruncated 5-cell honeycomb, Great cycloprismated pentachoric tetracomb Grand prismatodispentachoric tetracomb The omnitruncated 4-simplex honeycomb or omnitruncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be seen as a cantitruncated 5-cell honeycomb and also a cyclosteriruncicantitruncated 5-cell honeycomb and it is composed entirely of omnitruncated 5-cell facets. Coxeter calls this Hintons honeycomb after C. H. Hinton, the facets of all omnitruncated simplectic honeycombs are called permutahedra and can be positioned in n+1 space with integral coordinates, permutations of the whole numbers. 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 III, George Olshevsky, Uniform Panoploid Tetracombs, Manuscript Model 134 Klitzing, Richard
38.
Truncated 5-cell honeycomb
–
In four-dimensional Euclidean geometry, the 4-simplex honeycomb, 5-cell honeycomb or pentachoric-dispentachoric honeycomb is a space-filling tessellation honeycomb. It is composed of 5-cells and rectified 5-cells facets in a ratio of 1,1, cells of the vertex figure are ten tetrahedrons and 20 triangular prisms, corresponding to the ten 5-cells and 20 rectified 5-cells that meet at each vertex. The 20 vertices of its figure, the runcinated 5-cell represent the 20 roots of the A ~4 Coxeter group. It is the 4-dimensional case of a simplectic honeycomb and this inversion results in another non-Wythoffian uniform convex honeycomb. Octahedral prisms and tetrahedral prisms may be inserted in between alternated laminae as well, resulting in two more non-Wythoffian elongated uniform honeycombs and this honeycomb is one of seven unique uniform honeycombs constructed by the A ~4 Coxeter group. The symmetry can be multiplied by the symmetry of rings in the Coxeter–Dynkin diagrams, Small cyclorhombated pentachoric tetracomb small prismatodispentachoric tetracomb The cyclotruncated 4-simplex honeycomb or cyclotruncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be seen as a birectified 5-cell honeycomb and it is composed of 5-cells, truncated 5-cells, and bitruncated 5-cells facets in a ratio of 2,2,1. Its vertex figure is an Elongated tetrahedral antiprism, with 8 equilateral triangle and 24 isosceles triangle faces and it can be constructed as five sets of parallel hyperplanes that divide space into two half-spaces. The 3-space hyperplanes contain quarter cubic honeycombs as a collection facets, cyclotruncated pentachoric tetracomb Small truncated-pentachoric tetracomb The truncated 4-simplex honeycomb or truncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be called a cyclocantitruncated 5-cell honeycomb, Great cyclorhombated pentachoric tetracomb Great truncated-pentachoric tetracomb The cantellated 4-simplex honeycomb or cantellated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be called a cycloruncitruncated 5-cell honeycomb, cycloprismatorhombated pentachoric tetracomb Great prismatodispentachoric tetracomb The bitruncated 4-simplex honeycomb or bitruncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be called a cycloruncicantitruncated 5-cell honeycomb, Great cycloprismated pentachoric tetracomb Grand prismatodispentachoric tetracomb The omnitruncated 4-simplex honeycomb or omnitruncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be seen as a cantitruncated 5-cell honeycomb and also a cyclosteriruncicantitruncated 5-cell honeycomb and it is composed entirely of omnitruncated 5-cell facets. Coxeter calls this Hintons honeycomb after C. H. Hinton, the facets of all omnitruncated simplectic honeycombs are called permutahedra and can be positioned in n+1 space with integral coordinates, permutations of the whole numbers. 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 III, George Olshevsky, Uniform Panoploid Tetracombs, Manuscript Model 134 Klitzing, Richard
39.
Omnitruncated 5-cell honeycomb
–
In four-dimensional Euclidean geometry, the 4-simplex honeycomb, 5-cell honeycomb or pentachoric-dispentachoric honeycomb is a space-filling tessellation honeycomb. It is composed of 5-cells and rectified 5-cells facets in a ratio of 1,1, cells of the vertex figure are ten tetrahedrons and 20 triangular prisms, corresponding to the ten 5-cells and 20 rectified 5-cells that meet at each vertex. The 20 vertices of its figure, the runcinated 5-cell represent the 20 roots of the A ~4 Coxeter group. It is the 4-dimensional case of a simplectic honeycomb and this inversion results in another non-Wythoffian uniform convex honeycomb. Octahedral prisms and tetrahedral prisms may be inserted in between alternated laminae as well, resulting in two more non-Wythoffian elongated uniform honeycombs and this honeycomb is one of seven unique uniform honeycombs constructed by the A ~4 Coxeter group. The symmetry can be multiplied by the symmetry of rings in the Coxeter–Dynkin diagrams, Small cyclorhombated pentachoric tetracomb small prismatodispentachoric tetracomb The cyclotruncated 4-simplex honeycomb or cyclotruncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be seen as a birectified 5-cell honeycomb and it is composed of 5-cells, truncated 5-cells, and bitruncated 5-cells facets in a ratio of 2,2,1. Its vertex figure is an Elongated tetrahedral antiprism, with 8 equilateral triangle and 24 isosceles triangle faces and it can be constructed as five sets of parallel hyperplanes that divide space into two half-spaces. The 3-space hyperplanes contain quarter cubic honeycombs as a collection facets, cyclotruncated pentachoric tetracomb Small truncated-pentachoric tetracomb The truncated 4-simplex honeycomb or truncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be called a cyclocantitruncated 5-cell honeycomb, Great cyclorhombated pentachoric tetracomb Great truncated-pentachoric tetracomb The cantellated 4-simplex honeycomb or cantellated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be called a cycloruncitruncated 5-cell honeycomb, cycloprismatorhombated pentachoric tetracomb Great prismatodispentachoric tetracomb The bitruncated 4-simplex honeycomb or bitruncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be called a cycloruncicantitruncated 5-cell honeycomb, Great cycloprismated pentachoric tetracomb Grand prismatodispentachoric tetracomb The omnitruncated 4-simplex honeycomb or omnitruncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be seen as a cantitruncated 5-cell honeycomb and also a cyclosteriruncicantitruncated 5-cell honeycomb and it is composed entirely of omnitruncated 5-cell facets. Coxeter calls this Hintons honeycomb after C. H. Hinton, the facets of all omnitruncated simplectic honeycombs are called permutahedra and can be positioned in n+1 space with integral coordinates, permutations of the whole numbers. 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 III, George Olshevsky, Uniform Panoploid Tetracombs, Manuscript Model 134 Klitzing, Richard
40.
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
41.
Regular Polytopes (book)
–
Regular Polytopes is a mathematical geometry book written by Canadian mathematician Harold Scott MacDonald Coxeter. Originally published in 1947, the book was updated and republished in 1963 and 1973, the book is a comprehensive survey of the geometry of regular polytopes, the generalisation of regular polygons and regular polyhedra to higher dimensions. Originating with an essay entitled Dimensional Analogy written in 1923, the first edition of the book took Coxeter twenty-four years to complete, regular Polytopes is a standard reference work on regular polygons, polyhedra and their higher dimensional analogues. It is unusual in the breadth of its coverage, its combination of mathematical rigour with geometric insight, Coxeter starts by introducing two-dimensional polygons and three-dimensional polyhedra. He then gives a rigorous definition of regularity and uses it to show that there are no other convex regular polyhedra apart from the five Platonic solids. The concept of regularity is extended to non-convex shapes such as star polygons and star polyhedra, to tessellations and honeycombs, Coxeter introduces and uses the groups generated by reflections that became known as Coxeter groups. The book combines algebraic rigour with clear explanations, many of which are illustrated with diagrams, the black and white plates in the book show solid models of three-dimensional polyhedra, and wire-frame models of projections of some higher-dimensional polytopes. At the end of each chapter Coxeter includes an Historical remarks section which provides a perspective of the development of the subject. The first two have been expounded by Sommerville and Neville, and we shall presuppose some familiarity with such treatises. Concerning the third, Poincaré wrote, A man who pursues it, will end up holding on to the fourth dimension. ”The original 1948 edition received a more complete review by M. Goldberg in MR0027148
42.
International Standard Book Number
–
The International Standard Book Number is a unique numeric commercial book identifier. An ISBN is assigned to each edition and variation of a book, for example, an e-book, a paperback and a hardcover edition of the same book would each have a different ISBN. The ISBN is 13 digits long if assigned on or after 1 January 2007, the method of assigning an ISBN is nation-based and varies from country to country, often depending on how large the publishing industry is within a country. The initial ISBN configuration of recognition was generated in 1967 based upon the 9-digit Standard Book Numbering created in 1966, the 10-digit ISBN format was developed by the International Organization for Standardization and was published in 1970 as international standard ISO2108. Occasionally, a book may appear without a printed ISBN if it is printed privately or the author does not follow the usual ISBN procedure, however, this can be rectified later. Another identifier, the International Standard Serial Number, identifies periodical publications such as magazines, the ISBN configuration of recognition was generated in 1967 in the United Kingdom by David Whitaker and in 1968 in the US by Emery Koltay. The 10-digit ISBN format was developed by the International Organization for Standardization and was published in 1970 as international standard ISO2108, the United Kingdom continued to use the 9-digit SBN code until 1974. The ISO on-line facility only refers back to 1978, an SBN may be converted to an ISBN by prefixing the digit 0. For example, the edition of Mr. J. G. Reeder Returns, published by Hodder in 1965, has SBN340013818 -340 indicating the publisher,01381 their serial number. This can be converted to ISBN 0-340-01381-8, the check digit does not need to be re-calculated, since 1 January 2007, ISBNs have contained 13 digits, a format that is compatible with Bookland European Article Number EAN-13s. An ISBN is assigned to each edition and variation of a book, for example, an ebook, a paperback, and a hardcover edition of the same book would each have a different ISBN. The ISBN is 13 digits long if assigned on or after 1 January 2007, a 13-digit ISBN can be separated into its parts, and when this is done it is customary to separate the parts with hyphens or spaces. Separating the parts of a 10-digit ISBN is also done with either hyphens or spaces, figuring out how to correctly separate a given ISBN number is complicated, because most of the parts do not use a fixed number of digits. ISBN issuance is country-specific, in that ISBNs are issued by the ISBN registration agency that is responsible for country or territory regardless of the publication language. Some ISBN registration agencies are based in national libraries or within ministries of culture, in other cases, the ISBN registration service is provided by organisations such as bibliographic data providers that are not government funded. In Canada, ISBNs are issued at no cost with the purpose of encouraging Canadian culture. In the United Kingdom, United States, and some countries, where the service is provided by non-government-funded organisations. Australia, ISBNs are issued by the library services agency Thorpe-Bowker
43.
Regular honeycomb
–
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