|
Truncated 5-cube
In five-dimensional geometry, a truncated 5-cube is a convex uniform 5-polytope, being a truncation of the regular 5-cube. There are four unique truncations of the 5-cube. Vertices of the truncated 5-cube are located as pairs on the edge of the 5-cube. Vertices of the bitruncated 5-cube are located on the square faces of the 5-cube. The third and fourth truncations are more easily constructed as second and first truncations of the 5-orthoplex. Truncated 5-cube Alternate names * Truncated penteract (Acronym: tan) (Jonathan Bowers) Construction and coordinates The ''truncated 5-cube'' may be constructed by truncating the vertices of the 5-cube at 1/(\sqrt+2) of the edge length. A regular 5-cell is formed at each truncated vertex. The Cartesian coordinates of the vertices of a ''truncated 5-cube'' having edge length 2 are all permutations of: :\left(\pm1,\ \pm(1+\sqrt),\ \pm(1+\sqrt),\ \pm(1+\sqrt),\ \pm(1+\sqrt)\right) Images The truncated 5-cube is constructed ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
5-cube T0
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] |
4-cube T01
In geometry, a tesseract is the four-dimensional analogue of the cube; the tesseract is to the cube as the cube is to the square. Just as the surface of the cube consists of six square faces, the hypersurface of the tesseract consists of eight cubical cells. The tesseract is one of the six convex regular 4-polytopes. The tesseract is also called an 8-cell, C8, (regular) octachoron, octahedroid, cubic prism, and tetracube. It is the four-dimensional hypercube, or 4-cube as a member of the dimensional family of hypercubes or measure polytopes. Coxeter labels it the \gamma_4 polytope. The term ''hypercube'' without a dimension reference is frequently treated as a synonym for this specific polytope. The ''Oxford English Dictionary'' traces the word ''tesseract'' to Charles Howard Hinton's 1888 book '' A New Era of Thought''. The term derives from the Greek ( 'four') and from ( 'ray'), referring to the four edges from each vertex to other vertices. Hinton originally spe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hypercube
In geometry, a hypercube is an ''n''-dimensional analogue of a square () and a cube (). It is a closed, compact, convex figure whose 1- skeleton consists of groups of opposite parallel line segments aligned in each of the space's dimensions, perpendicular to each other and of the same length. A unit hypercube's longest diagonal in ''n'' dimensions is equal to \sqrt. An ''n''-dimensional hypercube is more commonly referred to as an ''n''-cube or sometimes as an ''n''-dimensional cube. The term measure polytope (originally from Elte, 1912) is also used, notably in the work of H. S. M. Coxeter who also labels the hypercubes the γn polytopes. The hypercube is the special case of a hyperrectangle (also called an ''n-orthotope''). A ''unit hypercube'' is a hypercube whose side has length one unit. Often, the hypercube whose corners (or ''vertices'') are the 2''n'' points in R''n'' with each coordinate equal to 0 or 1 is called ''the'' unit hypercube. Construction A hyp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cartesian Coordinate
A Cartesian coordinate system (, ) in a plane is a coordinate system that specifies each point uniquely by a pair of numerical coordinates, which are the signed distances to the point from two fixed perpendicular oriented lines, measured in the same unit of length. Each reference coordinate line is called a ''coordinate axis'' or just ''axis'' (plural ''axes'') of the system, and the point where they meet is its ''origin'', at ordered pair . The coordinates can also be defined as the positions of the perpendicular projections of the point onto the two axes, expressed as signed distances from the origin. One can use the same principle to specify the position of any point in three-dimensional space by three Cartesian coordinates, its signed distances to three mutually perpendicular planes (or, equivalently, by its perpendicular projection onto three mutually perpendicular lines). In general, ''n'' Cartesian coordinates (an element of real ''n''-space) specify the point in an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
5-cell
In geometry, the 5-cell is the convex 4-polytope with Schläfli symbol . It is a 5-vertex four-dimensional object bounded by five tetrahedral cells. It is also known as a C5, pentachoron, pentatope, pentahedroid, or tetrahedral pyramid. It is the 4- simplex (Coxeter's \alpha_4 polytope), the simplest possible convex 4-polytope, and is analogous to the tetrahedron in three dimensions and the triangle in two dimensions. The 5-cell is a 4-dimensional pyramid with a tetrahedral base and four tetrahedral sides. The regular 5-cell is bounded by five regular tetrahedra, and is one of the six regular convex 4-polytopes (the four-dimensional analogues of the Platonic solids). A regular 5-cell can be constructed from a regular tetrahedron by adding a fifth vertex one edge length distant from all the vertices of the tetrahedron. This cannot be done in 3-dimensional space. The regular 5-cell is a solution to the problem: ''Make 10 equilateral triangles, all of the same size, using 10 m ... [...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] |
Tetrahedral Pyramid
In geometry, the 5-cell is the convex 4-polytope with Schläfli symbol . It is a 5-vertex four-dimensional object bounded by five tetrahedral cells. It is also known as a C5, pentachoron, pentatope, pentahedroid, or tetrahedral pyramid. It is the 4- simplex (Coxeter's \alpha_4 polytope), the simplest possible convex 4-polytope, and is analogous to the tetrahedron in three dimensions and the triangle in two dimensions. The 5-cell is a 4-dimensional pyramid with a tetrahedral base and four tetrahedral sides. The regular 5-cell is bounded by five regular tetrahedra, and is one of the six regular convex 4-polytopes (the four-dimensional analogues of the Platonic solids). A regular 5-cell can be constructed from a regular tetrahedron by adding a fifth vertex one edge length distant from all the vertices of the tetrahedron. This cannot be done in 3-dimensional space. The regular 5-cell is a solution to the problem: ''Make 10 equilateral triangles, all of the same size, using 10 ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Truncated 5-cube Verf
Truncation is the term used for limiting the number of digits right of the decimal point by discarding the least significant ones. Truncation may also refer to: Mathematics * Truncation (statistics) refers to measurements which have been cut off at some value * Truncation (numerical analysis) refers to truncating an infinite sum by a finite one * Truncation (geometry) is the removal of one or more parts, as for example in truncated cube * Propositional truncation, a type former which truncates a type down to a mere proposition Computer science * Data truncation, an event that occurs when a file or other data is stored in a location too small to accommodate its entire length * Truncate (SQL), a command in the SQL data manipulation language to quickly remove all data from a table Biology * Truncate, a leaf shape * Truncated protein, a protein shortened by a mutation which specifically induces premature termination of messenger RNA translation Other uses * Cheque truncatio ... [...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] |
Regular Octagon
In geometry, an octagon (from the Greek ὀκτάγωνον ''oktágōnon'', "eight angles") is an eight-sided polygon or 8-gon. A '' regular octagon'' has Schläfli symbol and can also be constructed as a quasiregular truncated square, t, which alternates two types of edges. A truncated octagon, t is a hexadecagon, . A 3D analog of the octagon can be the rhombicuboctahedron with the triangular faces on it like the replaced edges, if one considers the octagon to be a truncated square. Properties of the general octagon The sum of all the internal angles of any octagon is 1080°. As with all polygons, the external angles total 360°. If squares are constructed all internally or all externally on the sides of an octagon, then the midpoints of the segments connecting the centers of opposite squares form a quadrilateral that is both equidiagonal and orthodiagonal (that is, whose diagonals are equal in length and at right angles to each other).Dao Thanh Oai (2015), "Equilatera ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
