|
Expanded 6-simplex
In six-dimensional geometry, a pentellated 6-simplex is a convex uniform 6-polytope with 5th order truncations of the regular 6-simplex. There are unique 10 degrees of pentellations of the 6-simplex with permutations of truncations, cantellations, runcinations, and sterications. The simple pentellated 6-simplex is also called an expanded 6-simplex, constructed by an expansion operation applied to the regular 6-simplex. The highest form, the ''pentisteriruncicantitruncated 6-simplex'', is called an ''omnitruncated 6-simplex'' with all of the nodes ringed. Pentellated 6-simplex Alternate names * Expanded 6-simplex * Small terated tetradecapeton (Acronym: staf) (Jonathan Bowers) Coordinates The vertices of the ''pentellated 6-simplex'' can be positioned in 7-space as permutations of (0,1,1,1,1,1,2). This construction is based on facets of the pentellated 7-orthoplex. A second construction in 7-space, from the center of a rectified 7-orthoplex is given by coordinate permut ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
6-simplex T0
In geometry, a 6-simplex is a Duality (mathematics), self-dual Regular polytope, regular 6-polytope. It has 7 vertex (geometry), vertices, 21 Edge (geometry), edges, 35 triangle Face (geometry), faces, 35 Tetrahedron, tetrahedral Cell (mathematics), cells, 21 5-cell 4-faces, and 7 5-simplex 5-faces. Its dihedral angle is cos−1(1/6), or approximately 80.41°. Alternate names It can also be called a heptapeton, or hepta-6-tope, as a 7-facet (geometry), facetted polytope in 6-dimensions. The 5-polytope#A note on generality of terms for n-polytopes and elements, name ''heptapeton'' is derived from ''hepta'' for seven Facet (mathematics), facets in Greek language, Greek and Peta-, ''-peta'' for having five-dimensional facets, and ''-on''. Jonathan Bowers gives a heptapeton the acronym hop. As a configuration This Regular 4-polytope#As configurations, configuration matrix represents the 6-simplex. The rows and columns correspond to vertices, edges, faces, cells, 4-faces and 5-face ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Expansion (geometry)
In geometry, expansion is a polytope operation where facets are separated and moved radially apart, and new facets are formed at separated elements ( vertices, edges, etc.). Equivalently this operation can be imagined by keeping facets in the same position but reducing their size. The expansion of a regular polytope creates a uniform polytope, but the operation can be applied to any convex polytope, as demonstrated for polyhedra in Conway polyhedron notation (which represents expansion with the letter ). For polyhedra, an expanded polyhedron has all the faces of the original polyhedron, all the faces of the dual polyhedron, and new square faces in place of the original edges. Expansion of regular polytopes According to Coxeter, this multidimensional term was defined by Alicia Boole StottCoxeter, ''Regular Polytopes'' (1973), p. 123. p.210 for creating new polytopes, specifically starting from regular polytopes to construct new uniform polytopes. The ''expansion'' operation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex Figure
In geometry, a vertex figure, broadly speaking, is the figure exposed when a corner of a polyhedron or polytope is sliced off. Definitions Take some corner or Vertex (geometry), vertex of a polyhedron. Mark a point somewhere along each connected edge. Draw lines across the connected faces, joining adjacent points around the face. When done, these lines form a complete circuit, i.e. a polygon, around the vertex. This polygon is the vertex figure. More precise formal definitions can vary quite widely, according to circumstance. For example Coxeter (e.g. 1948, 1954) 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 tessellation, tilings or, by extension, to Honeycomb (geometry), space-filling tessellation with polytope Cell (geometry), cells and other higher-dimensional polytopes. As a flat slice Make a slice through the corner of the polyhedron, cutting through all the edges ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simple Lie Group
In mathematics, a simple Lie group is a connected non-abelian Lie group ''G'' which does not have nontrivial connected normal subgroups. The list of simple Lie groups can be used to read off the list of simple Lie algebras and Riemannian symmetric spaces. Together with the commutative Lie group of the real numbers, \mathbb, and that of the unit-magnitude complex numbers, U(1) (the unit circle), simple Lie groups give the atomic "blocks" that make up all (finite-dimensional) connected Lie groups via the operation of group extension. Many commonly encountered Lie groups are either simple or 'close' to being simple: for example, the so-called "special linear group" SL(''n'') of ''n'' by ''n'' matrices with determinant equal to 1 is simple for all ''n'' > 1. The first classification of simple Lie groups was by Wilhelm Killing, and this work was later perfected by Élie Cartan. The final classification is often referred to as Killing-Cartan classification. Definition Unfortun ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rectified 7-orthoplex
In seven-dimensional geometry, a rectified 7-orthoplex is a convex uniform 7-polytope, being a rectification of the regular 7-orthoplex. There are unique 7 degrees of rectifications, the zeroth being the 7-orthoplex, and the 6th and last being the 7-cube. Vertices of the rectified 7-orthoplex are located at the edge-centers of the 7-orthoplex. Vertices of the birectified 7-orthoplex are located in the triangular face centers of the 7-orthoplex. Vertices of the trirectified 7-orthoplex are located in the tetrahedral cell centers of the 7-orthoplex. Rectified 7-orthoplex The ''rectified 7-orthoplex'' is the vertex figure for the demihepteractic honeycomb. The rectified 7-orthoplex's 84 vertices represent the kissing number of a sphere-packing constructed from this honeycomb. : or Alternate names * rectified heptacross * rectified hecatonicosoctaexon (Acronym rez) (Jonathan Bowers) - rectified 128-faceted polyexon Images Construction There are two Coxeter groups asso ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pentellated 7-orthoplex
In seven-dimensional geometry, a pentellated 7-orthoplex is a convex uniform 7-polytope with 5th order truncations (pentellation) of the regular 7-orthoplex. There are 32 unique of the 7-orthoplex with permutations of truncations, cantellations, runcinations, and . 16 are more simply constructed relative to the 7-cube. These polytopes are a part of a set of 127 uniform 7-polytope In seven-dimensional geometry, a 7-polytope is a polytope contained by 6-polytope facets. Each 5-polytope ridge being shared by exactly two 6-polytope facets. A uniform 7-polytope is one whose symmetry group is transitive on vertices and whose ...s with B7 symmetry. Pentellated 7-orthoplex Alternate names * Small hecatonicosoctaexon (acronym: Staz) (Jonathan Bowers) Coordinates Coordinates are permutations of (0,1,1,1,1,1,2) Images Pentitruncated 7-orthoplex Alternate names * Teritruncated hecatonicosoctaexon (acronym: Tetaz) (Jonathan Bowers) Images Coordinates Coordinates are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Facet (geometry)
In geometry, a facet is a feature of a polyhedron, polytope, or related geometric structure, generally of dimension one less than the structure itself. More specifically: * In three-dimensional geometry, a facet of a polyhedron is any polygon whose corners are vertices of the polyhedron, and is not a ''face''. To ''facet'' a polyhedron is to find and join such facets to form the faces of a new polyhedron; this is the reciprocal process to '' stellation'' and may also be applied to higher-dimensional polytopes. * In polyhedral combinatorics and in the general theory of polytopes, a facet (or hyperface) of a polytope of dimension ''n'' is a face that has dimension ''n'' − 1. Facets may also be called (''n'' − 1)-faces. In three-dimensional geometry, they are often called "faces" without qualification. * A facet of a simplicial complex is a maximal simplex, that is a simplex that is not a face of another simplex of the complex.. For (boundary complexes of) sim ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Polytope
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean space \mathbb^n. Most texts. use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others''Mathematical Programming'', by Melvyn W. Jeter (1986) p. 68/ref> (including this article) allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary. Convex polytopes play an important role both in various branches of mathematics and in applied areas, most notably in linear programming. In the influential textbooks of Grünbaum and Ziegler on the subject, as well as in many other texts in discrete geometry, convex polytopes are often simply called "polytopes". Grünbaum points out that this is solely to avoi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example. However, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced in 1934 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 symmetry groups of regular polytopes, and the Weyl groups of simple Lie algebras. Examples of infinite Coxeter groups include the triangle groups corresponding to regular tessellations of the Euclidean plane and the hyperbolic plane, and the Weyl groups of infinite-dimensional Kac–Moody algebras. Standard ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex Figure
In geometry, a vertex figure, broadly speaking, is the figure exposed when a corner of a polyhedron or polytope is sliced off. Definitions Take some corner or Vertex (geometry), vertex of a polyhedron. Mark a point somewhere along each connected edge. Draw lines across the connected faces, joining adjacent points around the face. When done, these lines form a complete circuit, i.e. a polygon, around the vertex. This polygon is the vertex figure. More precise formal definitions can vary quite widely, according to circumstance. For example Coxeter (e.g. 1948, 1954) 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 tessellation, tilings or, by extension, to Honeycomb (geometry), space-filling tessellation with polytope Cell (geometry), cells and other higher-dimensional polytopes. As a flat slice Make a slice through the corner of the polyhedron, cutting through all the edges ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
5-simplex T0
In five-dimensional geometry, a 5- simplex is a self-dual regular 5-polytope. It has six vertices, 15 edges, 20 triangle faces, 15 tetrahedral cells, and 6 5-cell facets. It has a dihedral angle of cos−1(), or approximately 78.46°. The 5-simplex is a solution to the problem: ''Make 20 equilateral triangles using 15 matchsticks, where each side of every triangle is exactly one matchstick.'' Alternate names It can also be called a hexateron, or hexa-5-tope, as a 6- facetted polytope in 5-dimensions. The name ''hexateron'' is derived from ''hexa-'' for having six facets and '' teron'' (with ''ter-'' being a corruption of ''tetra-'') for having four-dimensional facets. By Jonathan Bowers, a hexateron is given the acronym hix. As a configuration This configuration matrix represents the 5-simplex. The rows and columns correspond to vertices, edges, faces, cells and 4-faces. The diagonal numbers say how many of each element occur in the whole 5-simplex. The nondiagonal num ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
5-simplex
In five-dimensional geometry, a 5-simplex is a self-dual regular 5-polytope. It has six vertices, 15 edges, 20 triangle faces, 15 tetrahedral cells, and 6 5-cell facets. It has a dihedral angle of cos−1(), or approximately 78.46°. The 5-simplex is a solution to the problem: ''Make 20 equilateral triangles using 15 matchsticks, where each side of every triangle is exactly one matchstick.'' Alternate names It can also be called a hexateron, or hexa-5-tope, as a 6- facetted polytope in 5-dimensions. The name ''hexateron'' is derived from ''hexa-'' for having six facets and '' teron'' (with ''ter-'' being a corruption of ''tetra-'') for having four-dimensional facets. By Jonathan Bowers, a hexateron is given the acronym hix. As a configuration This configuration matrix represents the 5-simplex. The rows and columns correspond to vertices, edges, faces, cells and 4-faces. The diagonal numbers say how many of each element occur in the whole 5-simplex. The nondiagonal numb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
