|
Uniform 1 K2 Polytope
In geometry, 1k2 polytope is a uniform polytope in n-dimensions (n = k+4) constructed from the En Coxeter group. The family was named by their Coxeter symbol 1k2 by its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of the 1-node sequence. It can be named by an extended Schläfli symbol . Family members The family starts uniquely as 6-polytope In six-dimensional geometry, a six-dimensional polytope or 6-polytope is a polytope, bounded by 5-polytope facets. Definition A 6-polytope is a closed six-dimensional figure with vertices, edges, faces, cells (3-faces), 4-faces, and 5-faces. A ...s, but can be extended backwards to include the 5-demihypercube, demicube (demipenteract) in 5-dimensions, and the 4-simplex (5-cell) in 4-dimensions. Each polytope is constructed from 1k-1,2 and (n-1)-Demihypercube, demicube facets. Each has a vertex figure of a ' polytope is a birectified n-simplex, ''t2''. The sequence ends with k=6 (n=10), as an infinite tessellatio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometry
Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is called a ''geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point, line, plane, distance, angle, surface, and curve, as fundamental concepts. During the 19th century several discoveries enlarged dramatically the scope of geometry. One of the oldest such discoveries is Carl Friedrich Gauss' ("remarkable theorem") that asserts roughly that the Gaussian curvature of a surface is independent from any specific embedding in a Euclidean space. This implies that surfaces can be studied ''intrinsically'', that is, as stand-alone spaces, and has been expanded into the theory of manifolds and Riemannian geometry. Later in the 19th century, it appeared that geometries ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1 22 Polytope
In 6-dimensional geometry, the 122 polytope is a uniform polytope, constructed from the E6 (mathematics), E6 group. It was first published in E. L. Elte's 1912 listing of semiregular polytopes, named as V72 (for its 72 vertices). Its Coxeter symbol is 122, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of the 1-node sequence. There are two rectifications of the 122, constructed by positions points on the elements of 122. The rectified 122 is constructed by points at the mid-edges of the 122. The birectified 122 is constructed by points at the triangle face centers of the 122. These polytopes are from a family of 39 convex uniform 6-polytope, uniform polytopes in 6-dimensions, made of uniform 5-polytope, uniform polytope facets and vertex figures, defined by all permutations of rings in this Coxeter-Dynkin diagram: . 122 polytope The 122 polytope contains 72 vertices, and 54 5-demicube, 5-demicubic facets. It has a birectified 5-simplex vertex ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Face (geometry)
In solid geometry, a face is a flat surface (a planar region) that forms part of the boundary of a solid object; a three-dimensional solid bounded exclusively by faces is a ''polyhedron''. In more technical treatments of the geometry of polyhedra and higher-dimensional polytopes, the term is also used to mean an element of any dimension of a more general polytope (in any number of dimensions).. Polygonal face In elementary geometry, a face is a polygon on the boundary of a polyhedron. Other names for a polygonal face include polyhedron side and Euclidean plane ''tile''. For example, any of the six squares that bound a cube is a face of the cube. Sometimes "face" is also used to refer to the 2-dimensional features of a 4-polytope. With this meaning, the 4-dimensional tesseract has 24 square faces, each sharing two of 8 cubic cells. Number of polygonal faces of a polyhedron Any convex polyhedron's surface has Euler characteristic :V - E + F = 2, where ''V'' is the number of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Edge (geometry)
In geometry, an edge is a particular type of line segment joining two vertices in a polygon, polyhedron, or higher-dimensional polytope. In a polygon, an edge is a line segment on the boundary, and is often called a polygon side. In a polyhedron or more generally a polytope, an edge is a line segment where two faces (or polyhedron sides) meet. A segment joining two vertices while passing through the interior or exterior is not an edge but instead is called a diagonal. Relation to edges in graphs In graph theory, an edge is an abstract object connecting two graph vertices, unlike polygon and polyhedron edges which have a concrete geometric representation as a line segment. However, any polyhedron can be represented by its skeleton or edge-skeleton, a graph whose vertices are the geometric vertices of the polyhedron and whose edges correspond to the geometric edges. Conversely, the graphs that are skeletons of three-dimensional polyhedra can be characterized by Steinitz's theore ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex (geometry)
In geometry, a vertex (in plural form: vertices or vertexes) is a point (geometry), point where two or more curves, line (geometry), lines, or edge (geometry), edges meet. As a consequence of this definition, the point where two lines meet to form an angle and the corners of polygons and polyhedron, polyhedra are vertices. Definition Of an angle The ''vertex'' of an angle is the point where two Line (mathematics)#Ray, rays begin or meet, where two line segments join or meet, where two lines intersect (cross), or any appropriate combination of rays, segments, and lines that result in two straight "sides" meeting at one place. :(3 vols.): (vol. 1), (vol. 2), (vol. 3). Of a polytope A vertex is a corner point of a polygon, polyhedron, or other higher-dimensional polytope, formed by the intersection (Euclidean geometry), intersection of Edge (geometry), edges, face (geometry), faces or facets of the object. In a polygon, a vertex is called "convex set, convex" if the internal an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Facet (mathematics)
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] |
Petrie Polygon
In geometry, a Petrie polygon for a regular polytope of dimensions is a skew polygon in which every consecutive sides (but no ) belongs to one of the facets. The Petrie polygon of a regular polygon is the regular polygon itself; that of a regular polyhedron is a skew polygon such that every two consecutive sides (but no three) belongs to one of the faces. Petrie polygons are named for mathematician John Flinders Petrie. For every regular polytope there exists an orthogonal projection onto a plane such that one Petrie polygon becomes a regular polygon with the remainder of the projection interior to it. The plane in question is the Coxeter plane of the symmetry group of the polygon, and the number of sides, , is the Coxeter number of the Coxeter group. These polygons and projected graphs are useful in visualizing symmetric structure of the higher-dimensional regular polytopes. Petrie polygons can be defined more generally for any embedded graph. They form the faces of anothe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Demienneract
In geometry, a demienneract or 9-demicube is a uniform 9-polytope, constructed from the 9-cube, with alternated vertices removed. It is part of a dimensionally infinite family of uniform polytopes called demihypercubes. E. L. Elte identified it in 1912 as a semiregular polytope, labeling it as HM9 for a 9-dimensional ''half measure'' polytope. Coxeter named this polytope as 161 from its Coxeter diagram, with a ring on one of the 1-length branches, and Schläfli symbol \left\ or . Cartesian coordinates Cartesian coordinates for the vertices of a demienneract centered at the origin are alternate halves of the enneract: : (±1,±1,±1,±1,±1,±1,±1,±1,±1) with an odd number of plus signs. Images References * H.S.M. Coxeter: ** Coxeter, ''Regular Polytopes'', (3rd edition, 1973), Dover edition, , p. 296, Table I (iii): Regular Polytopes, three regular polytopes in n-dimensions (n≥5) ** H.S.M. Coxeter, ''Regular Polytopes'', 3rd Edition, Dover New York, 1973, p.& ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1 62 Honeycomb
In geometry, an E9 honeycomb is a tessellation of uniform polytopes in hyperbolic 9-dimensional space. _9, also (E10) is a paracompact hyperbolic group, so either facets or vertex figures will not be bounded. E10 is last of the series of Coxeter groups with a bifurcated Coxeter-Dynkin diagram of lengths 6,2,1. There are 1023 unique E10 honeycombs by all combinations of its Coxeter-Dynkin diagram. There are no regular honeycombs in the family since its Coxeter diagram is a nonlinear graph, but there are three simplest ones, with a single ring at the end of its 3 branches: 621, 261, 162. 621 honeycomb The 621 honeycomb is constructed from alternating 9-simplex and 9-orthoplex facets within the symmetry of the E10 Coxeter group. This honeycomb is highly regular in the sense that its symmetry group (the affine E9 Weyl group) acts transitively on the ''k''-faces for ''k'' ≤ 7. All of the ''k''-faces for ''k'' ≤ 8 are simplices. This honeycomb is last in the series of k21 p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Demiocteract
In geometry, a demiocteract or 8-demicube is a uniform 8-polytope, constructed from the 8-hypercube, octeract, with alternated vertices removed. It is part of a dimensionally infinite family of uniform polytopes called demihypercubes. E. L. Elte identified it in 1912 as a semiregular polytope, labeling it as HM8 for an 8-dimensional ''half measure'' polytope. Coxeter named this polytope as 151 from its Coxeter diagram, with a ring on one of the 1-length branches, and Schläfli symbol \left\ or . Cartesian coordinates Cartesian coordinates for the vertices of an 8-demicube centered at the origin are alternate halves of the 8-cube: : (±1,±1,±1,±1,±1,±1,±1,±1) with an odd number of plus signs. Related polytopes and honeycombs This polytope is the vertex figure for the uniform tessellation, 251 with Coxeter-Dynkin diagram: : Images References * H.S.M. Coxeter: ** Coxeter, ''Regular Polytopes'', (3rd edition, 1973), Dover edition, , p. 296, Table I (iii ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1 52 Honeycomb
In geometry, the 152 honeycomb is a Uniform honeycomb, uniform tessellation of 8-dimensional Euclidean space. It contains Gosset 1 42 polytope, 142 and demiocteract, 151 Facet (geometry), facets, in a birectified 8-simplex vertex figure. It is the final figure in the uniform 1 k2 polytope, 1k2 polytope family. Construction It is created by a Wythoff construction upon a set of 9 hyperplane mirrors in 8-dimensional space. The facet information can be extracted from its Coxeter-Dynkin diagram. : Removing the node on the end of the 2-length branch leaves the 8-demicube, 151. : Removing the node on the end of the 5-length branch leaves the 1 42 polytope, 142. : The vertex figure is determined by removing the ringed node and ringing the neighboring node. This makes the birectified 8-simplex, 052. : Related polytopes and honeycombs See also * 5 21 honeycomb, 521 honeycomb * 2 51 honeycomb, 251 honeycomb References * Harold Scott MacDonald Coxeter, Coxeter ''The Beauty of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Demihepteract
In geometry, a demihepteract or 7-demicube is a uniform 7-polytope, constructed from the 7-hypercube ( hepteract) with alternated vertices removed. It is part of a dimensionally infinite family of uniform polytopes called demihypercubes. E. L. Elte identified it in 1912 as a semiregular polytope, labeling it as HM7 for a 7-dimensional ''half measure'' polytope. Coxeter named this polytope as 141 from its Coxeter diagram, with a ring on one of the 1-length branches, and Schläfli symbol \left\ or . Cartesian coordinates Cartesian coordinates for the vertices of a demihepteract centered at the origin are alternate halves of the hepteract: : (±1,±1,±1,±1,±1,±1,±1) with an odd number of plus signs. Images As a configuration This configuration matrix represents the 7-demicube. The rows and columns correspond to vertices, edges, faces, cells, 4-faces, 5-faces and 6-faces. The diagonal numbers say how many of each element occur in the whole 7-demicube. The nondiagona ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
