|
Quadritruncated 8-cube
In eight-dimensional geometry, a truncated 8-cube is a convex uniform 8-polytope, being a truncation of the regular 8-cube. There are unique 7 degrees of truncation for the 8-cube. Vertices of the truncation 8-cube are located as pairs on the edge of the 8-cube. Vertices of the bitruncated 8-cube are located on the square faces of the 8-cube. Vertices of the tritruncated 7-cube are located inside the cubic cells of the 8-cube. The final truncations are best expressed relative to the 8-orthoplex. Truncated 8-cube Alternate names * Truncated octeract (acronym tocto) (Jonathan Bowers) Coordinates Cartesian coordinates for the vertices of a truncated 8-cube, centered at the origin, are all 224 vertices are sign (4) and coordinate (56) permutations of : (±2,±2,±2,±2,±2,±2,±1,0) Images Related polytopes The '' truncated 8-cube'', is seventh in a sequence of truncated hypercubes: Bitruncated 8-cube Alternate names * Bitruncated octeract (acronym bato) ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
8-cube T0
In geometry, an 8-cube is an eight- dimensional hypercube. It has 256 vertices, 1024 edges, 1792 square faces, 1792 cubic cells, 1120 tesseract 4-faces, 448 5-cube 5-faces, 112 6-cube 6-faces, and 16 7-cube 7-faces. It is represented by Schläfli symbol , being composed of 3 7-cubes around each 6-face. It is called an octeract, a portmanteau of tesseract (the ''4-cube'') and ''oct'' for eight (dimensions) in Greek. It can also be called a regular hexdeca-8-tope or hexadecazetton, being an 8-dimensional polytope constructed from 16 regular facets. It is a part of an infinite family of polytopes, called hypercubes. The dual of an 8-cube can be called an 8-orthoplex and is a part of the infinite family of cross-polytopes. Cartesian coordinates Cartesian coordinates for the vertices of an 8-cube centered at the origin and edge length 2 are : (±1,±1,±1,±1,±1,±1,±1,±1) while the interior of the same consists of all points (x0, x1, x2, x3, x4, x5, x6, x7) with ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform 8-polytope
In Eight-dimensional space, eight-dimensional geometry, an eight-dimensional polytope or 8-polytope is a polytope contained by 7-polytope facets. Each 6-polytope Ridge (geometry), ridge being shared by exactly two 7-polytope Facet (mathematics), facets. A uniform 8-polytope is one which is vertex-transitive, and constructed from uniform 7-polytope facets. Regular 8-polytopes Regular 8-polytopes can be represented by the Schläfli symbol , with v 7-polytope Facet (mathematics), facets around each Peak (geometry), peak. There are exactly three such List of regular polytopes#Convex 4, convex regular 8-polytopes: # - 8-simplex # - 8-cube # - 8-orthoplex There are no nonconvex regular 8-polytopes. Characteristics The topology of any given 8-polytope is defined by its Betti numbers and torsion coefficient (topology), torsion coefficients.Richeson, D.; ''Euler's Gem: The Polyhedron Formula and the Birth of Topoplogy'', Princeton, 2008. The value of the Euler characteristic u ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Harold Scott MacDonald 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 to Harold Samuel Coxeter and Lucy (). His father had taken over the family business of Coxeter & Son, manufacturers of surgical instruments and compressed gases (including a mechanism for anaesthetising surgical patients with nitrous oxide), but was able to retire early and focus on sculpting and baritone singing; Lucy Coxeter was a portrait and landscape painter who had attended the Royal Academy of Arts. A maternal cousin was the architect Sir Giles Gilbert Scott. In his youth, Coxeter composed music and was an accomplished pianist at the age of 10. Roberts, Siobhan, ''King of Infinite Space: Donald Coxeter, The Man Who Saved Geometry'', Walker & Company, 2006, He felt that mathematics and music were intimately related, outlining his i ... [...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 self- ... [...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] |
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] |
Cartesian Coordinates
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] |
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] |
7-simplex
In 7-dimensional geometry, a 7-simplex is a self-dual regular 7-polytope. It has 8 vertices, 28 edges, 56 triangle faces, 70 tetrahedral cells, 56 5-cell 5-faces, 28 5-simplex 6-faces, and 8 6-simplex 7-faces. Its dihedral angle is cos−1(1/7), or approximately 81.79°. Alternate names It can also be called an octaexon, or octa-7-tope, as an 8- facetted polytope in 7-dimensions. The name ''octaexon'' is derived from ''octa'' for eight facets in Greek and ''-ex'' for having six-dimensional facets, and ''-on''. Jonathan Bowers gives an octaexon the acronym oca. As a configuration This configuration matrix represents the 7-simplex. 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-simplex. The nondiagonal numbers say how many of the column's element occur in or at the row's element. This self-dual simplex's matrix is identical to its 180 degree rotation. \beg ... [...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] |
