|
Runcinated 5-orthoplex
In five-dimensional geometry, a runcinated 5-orthoplex is a convex uniform 5-polytope with 3rd order truncation (runcination) of the regular 5-orthoplex. There are 8 runcinations of the 5-orthoplex with permutations of truncations, and cantellations. Four are more simply constructed relative to the 5-cube. Runcinated 5-orthoplex Alternate names * Runcinated pentacross * Small prismated triacontiditeron (Acronym: spat) (Jonathan Bowers) Coordinates The vertices of the can be made in 5-space, as permutations and sign combinations of: : (0,1,1,1,2) Images Runcitruncated 5-orthoplex Alternate names * Runcitruncated pentacross * Prismatotruncated triacontiditeron (Acronym: pattit) (Jonathan Bowers) Coordinates Cartesian coordinates for the vertices of a runcitruncated 5-orthoplex, centered at the origin, are all 80 vertices are sign (4) and coordinate (20) permutations of : (±3,±2,±1,±1,0) Images Runcicantellated 5-orthoplex Alternate names * Runcica ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
5-cube T4
In five-dimensional geometry, a 5-cube is a name for a five-dimensional hypercube with 32 vertices, 80 edges, 80 square faces, 40 cubic cells, and 10 tesseract 4-faces. It is represented by Schläfli symbol or , constructed as 3 tesseracts, , around each cubic ridge. It can be called a penteract, a portmanteau of the Greek word , for 'five' (dimensions), and the word ''tesseract'' (the 4-cube). It can also be called a regular deca-5-tope or decateron, being a 5-dimensional polytope constructed from 10 regular facets. Related polytopes It is a part of an infinite hypercube family. The dual of a 5-cube is the 5-orthoplex, of the infinite family of orthoplexes. Applying an '' alternation'' operation, deleting alternating vertices of the 5-cube, creates another uniform 5-polytope, called a 5-demicube, which is also part of an infinite family called the demihypercubes. The 5-cube can be seen as an ''order-3 tesseractic honeycomb'' on a 4-sphere. It is related to the Euclide ... [...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] |
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] |
Runcinated Pentacross Verf
In geometry, runcination is an operation that cuts a regular polytope (or honeycomb) simultaneously along the faces, edges, and vertices, creating new facets in place of the original face, edge, and vertex centers. It is a higher order truncation operation, following cantellation, and truncation. It is represented by an extended Schläfli symbol t0,3. This operation only exists for 4-polytopes or higher. This operation is dual-symmetric for regular uniform 4-polytopes and 3-space convex uniform honeycombs. For a regular 4-polytope, the original cells remain, but become separated. The gaps at the separated faces become p-gonal prisms. The gaps between the separated edges become r-gonal prisms. The gaps between the separated vertices become cells. The vertex figure for a regular 4-polytope is an ''q''-gonal antiprism (called an ''antipodium'' if ''p'' and ''r'' are different). For regular 4-polytopes/honeycombs, this operation is also called expansion by Alicia Boole S ... [...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] |
Schläfli Symbol
In geometry, the Schläfli symbol is a notation of the form \ that defines regular polytopes and tessellations. The Schläfli symbol is named after the 19th-century Swiss mathematician Ludwig Schläfli, who generalized Euclidean geometry to more than three dimensions and discovered all their convex regular polytopes, including the six that occur in four dimensions. Definition The Schläfli symbol is a recursive description, starting with for a ''p''-sided regular polygon that is convex. For example, is an equilateral triangle, is a square, a convex regular pentagon, etc. Regular star polygons are not convex, and their Schläfli symbols contain irreducible fractions ''p''/''q'', where ''p'' is the number of vertices, and ''q'' is their turning number. Equivalently, is created from the vertices of , connected every ''q''. For example, is a pentagram; is a pentagon. A regular polyhedron that has ''q'' regular ''p''-sided Face (geometry), polygon faces around each Verte ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform 5-polytope
In geometry, a uniform 5-polytope is a five-dimensional uniform polytope. By definition, a uniform 5-polytope is vertex-transitive and constructed from uniform 4-polytope Facet (geometry), facets. The complete set of convex uniform 5-polytopes has not been determined, but many can be made as Wythoff constructions from a small set of Coxeter groups, symmetry groups. These construction operations are represented by the permutations of rings of the Coxeter diagrams. History of discovery *Regular polytopes: (convex faces) **1852: Ludwig Schläfli proved in his manuscript ''Theorie der vielfachen Kontinuität'' that there are exactly 3 regular polytopes in 5 or more dimensions. *Convex semiregular polytopes: (Various definitions before Coxeter's uniform category) **1900: Thorold Gosset enumerated the list of nonprismatic semiregular convex polytopes with regular facets (convex regular 4-polytopes) in his publication ''On the Regular and Semi-Regular Figures in Space of n Dimension ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Runcinated 5-cubes
In five-dimensional geometry, a runcinated 5-cube is a convex uniform 5-polytope that is a runcination (a 3rd order truncation) of the regular 5-cube. There are 8 unique degrees of runcinations of the 5-cube, along with permutations of truncations and cantellations. Four are more simply constructed relative to the 5-orthoplex. Runcinated 5-cube Alternate names * Small prismated penteract (Acronym: span) (Jonathan Bowers) Coordinates The Cartesian coordinates of the vertices of a ''runcinated 5-cube'' having edge length 2 are all permutations of: :\left(\pm1,\ \pm1,\ \pm1,\ \pm(1+\sqrt),\ \pm(1+\sqrt)\right) Images Runcitruncated 5-cube Alternate names * Runcitruncated penteract * Prismatotruncated penteract (Acronym: pattin) (Jonathan Bowers) Construction and coordinates The Cartesian coordinates of the vertices of a ''runcitruncated 5-cube'' having edge length 2 are all permutations of: :\left(\pm1,\ \pm(1+\sqrt),\ \pm(1+\sqrt),\ \pm(1+2\sqrt),\ \pm ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cantellation
In geometry, a cantellation is a 2nd-order truncation in any dimension that bevels a regular polytope at its edges and at its vertices, creating a new facet in place of each edge and of each vertex. Cantellation also applies to regular tilings and honeycombs. Cantellating a polyhedron is also rectifying its rectification. Cantellation (for polyhedra and tilings) is also called ''expansion'' by Alicia Boole Stott: it corresponds to moving the faces of the regular form away from the center, and filling in a new face in the gap for each opened edge and for each opened vertex. Notation A cantellated polytope is represented by an extended Schläfli symbol ''t''0,2 or ''r''\beginp\\q\\...\end or ''rr''. For polyhedra, a cantellation offers a direct sequence from a regular polyhedron to its dual. Example: cantellation sequence between cube and octahedron: Example: a cuboctahedron is a cantellated tetrahedron. For higher-dimensional polytopes, a cantellation offers a direct ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or process of changing the linear order of an ordered set. Permutations differ from combinations, which are selections of some members of a set regardless of order. For example, written as tuples, there are six permutations of the set , namely (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1). These are all the possible orderings of this three-element set. Anagrams of words whose letters are different are also permutations: the letters are already ordered in the original word, and the anagram is a reordering of the letters. The study of permutations of finite sets is an important topic in the fields of combinatorics and group theory. Permutations are used in almost every branch of mathematics, and in many other fields of scie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
