|
Truncated 6-cube
In six-dimensional geometry, a truncated 6-cube (or truncated hexeract) is a convex uniform 6-polytope, being a truncation of the regular 6-cube. There are 5 truncations for the 6-cube. Vertices of the truncated 6-cube are located as pairs on the edge of the 6-cube. Vertices of the bitruncated 6-cube are located on the square faces of the 6-cube. Vertices of the tritruncated 6-cube are located inside the cubic cells of the 6-cube. Truncated 6-cube Alternate names * Truncated hexeract (Acronym: tox) (Jonathan Bowers) Construction and coordinates The truncated 6-cube may be constructed by truncating the vertices of the 6-cube at 1/(\sqrt+2) of the edge length. A regular 5-simplex replaces each original vertex. The Cartesian coordinates of the vertices of a ''truncated 6-cube'' having edge length 2 are the permutations of: :\left(\pm1,\ \pm(1+\sqrt),\ \pm(1+\sqrt),\ \pm(1+\sqrt),\ \pm(1+\sqrt),\ \pm(1+\sqrt)\right) Images Related polytopes The '' truncated 6 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
6-cube T0
In geometry, a 6-cube is a six-dimensional hypercube with 64 vertices, 192 edges, 240 square faces, 160 cubic cells, 60 tesseract 4-faces, and 12 5-cube 5-faces. It has Schläfli symbol , being composed of 3 5-cubes around each 4-face. It can be called a hexeract, a portmanteau of tesseract (the ''4-cube'') with ''hex'' for six (dimensions) in Greek. It can also be called a regular dodeca-6-tope or dodecapeton, being a 6-dimensional polytope constructed from 12 regular facets. Related polytopes It is a part of an infinite family of polytopes, called hypercubes. The dual of a 6-cube can be called a 6-orthoplex, and is a part of the infinite family of cross-polytopes. Applying an '' alternation'' operation, deleting alternating vertices of the 6-cube, creates another uniform polytope, called a 6-demicube, (part of an infinite family called demihypercubes), which has 12 5-demicube and 32 5-simplex facets. As a configuration This configuration matrix represents the 6-cube. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
B6 Polytope
In 6-dimensional geometry, there are 64 uniform polytopes with B6 symmetry. There are two regular forms, the 6-orthoplex, and 6-cube with 12 and 64 vertices respectively. The 6-demicube is added with half the symmetry. They can be visualized as symmetric orthographic projections in Coxeter planes of the B6 Coxeter group, and other subgroups. __TOC__ Graphs Symmetric orthographic projections of these 64 polytopes can be made in the B6, B5, B4, B3, B2, A5, A3, Coxeter planes. Ak has '' +1' symmetry, and Bk has '' k' symmetry. These 64 polytopes are each shown in these 8 symmetry planes, with vertices and edges drawn, and vertices colored by the number of overlapping vertices in each projective position. References * H.S.M. Coxeter Harold Scott MacDonald "Donald" Coxeter, (9 February 1907 – 31 March 2003) was a British and later also Canadian geometer. He is regarded as one of the greatest geometers of the 20th century. Biography Coxeter was born in Kensington ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform 6-polytope
In six-dimensional geometry, a uniform 6-polytope 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 6-polytopes 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 (hexeract) , and the 6-orthoplex (hexacross) . 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) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bitruncation
In geometry, a bitruncation is an operation on regular polytopes. It represents a truncation beyond rectification. The original edges are lost completely and the original faces remain as smaller copies of themselves. Bitruncated regular polytopes can be represented by an extended Schläfli symbol notation or In regular polyhedra and tilings For regular polyhedra (i.e. regular 3-polytopes), a ''bitruncated'' form is the truncated dual. For example, a bitruncated cube is a truncated octahedron. In regular 4-polytopes and honeycombs For a regular 4-polytope, a ''bitruncated'' form is a dual-symmetric operator. A bitruncated 4-polytope is the same as the bitruncated dual, and will have double the symmetry if the original 4-polytope is self-dual. A regular polytope (or honeycomb) will have its cells bitruncated into truncated cells, and the vertices are replaced by truncated cells. Self-dual 4-polytope/honeycombs An interesting result of this operation is that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bitruncated 6-cube Verf
In geometry, a bitruncation is an operation on regular polytopes. It represents a truncation beyond rectification. The original edges are lost completely and the original faces remain as smaller copies of themselves. Bitruncated regular polytopes can be represented by an extended Schläfli symbol notation or In regular polyhedra and tilings For regular polyhedra (i.e. regular 3-polytopes), a ''bitruncated'' form is the truncated dual. For example, a bitruncated cube is a truncated octahedron. In regular 4-polytopes and honeycombs For a regular 4-polytope, a ''bitruncated'' form is a dual-symmetric operator. A bitruncated 4-polytope is the same as the bitruncated dual, and will have double the symmetry if the original 4-polytope is self-dual. A regular polytope (or honeycomb) will have its cells bitruncated into truncated cells, and the vertices are replaced by truncated cells. Self-dual 4-polytope/honeycombs An interesting result of this operation is that ... [...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 hype ... [...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-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 ... [...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 avo ... [...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. Standa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Truncated 6-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 truncation, t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
