HOME
*



picture info

Rectified 10-cube
In ten-dimensional geometry, a rectified 10-cube is a convex uniform 10-polytope, being a rectification of the regular 10-cube. There are 10 rectifications of the ''10-cube'', with the zeroth being the 10-cube itself. Vertices of the ''rectified 10-cube'' are located at the edge-centers of the ''10-cube''. Vertices of the ''birectified 10-cube'' are located in the square face centers of the ''10-cube''. Vertices of the ''trirectified 10-cube'' are located in the cubic cell centers of the 10-cube. The others are more simply constructed relative to the 10-cube dual polytope, the 10-orthoplex. These polytopes are part of a family 1023 uniform 10-polytopes with BC10 symmetry. Rectified 10-cube Alternate names * Rectified dekeract (Acronym rade) (Jonathan Bowers) Cartesian coordinates Cartesian coordinates for the vertices of a rectified 10-cube, centered at the origin, edge length \sqrt are all permutations of: : (±1,±1,±1,±1,±1,±1,±1,±1,±1,0) Images Birectified ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

10-orthoplex
In geometry, a 10-orthoplex or 10-cross polytope, is a regular 10-polytope with 20 vertices, 180 edges, 960 triangle faces, 3360 octahedron cells, 8064 5-cells ''4-faces'', 13440 ''5-faces'', 15360 ''6-faces'', 11520 ''7-faces'', 5120 ''8-faces'', and 1024 ''9-faces''. It has two constructed forms, the first being regular with Schläfli symbol , and the second with alternately labeled (checker-boarded) facets, with Schläfli symbol or Coxeter symbol 711. It is one of an infinite family of polytopes, called cross-polytopes or ''orthoplexes''. The dual polytope is the 10-hypercube or 10-cube. Alternate names *Decacross is derived from combining the family name ''cross polytope'' with ''deca'' for ten (dimensions) in Greek * Chilliaicositetraxennon as a 1024- facetted 10-polytope (polyxennon). Construction There are two Coxeter groups associated with the 10-orthoplex, one regular, dual of the 10-cube with the C10 or ,38symmetry group, and a lower symmetry with two copies of ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Coxeter Plane
In mathematics, the Coxeter number ''h'' is the order of a Coxeter element of an irreducible Coxeter group. It is named after H.S.M. Coxeter. Definitions Note that this article assumes a finite Coxeter group. For infinite Coxeter groups, there are multiple conjugacy classes of Coxeter elements, and they have infinite order. There are many different ways to define the Coxeter number ''h'' of an irreducible root system. A Coxeter element is a product of all simple reflections. The product depends on the order in which they are taken, but different orderings produce conjugate elements, which have the same order. *The Coxeter number is the order of any Coxeter element;. *The Coxeter number is 2''m''/''n'', where ''n'' is the rank, and ''m'' is the number of reflections. In the crystallographic case, ''m'' is half the number of roots; and ''2m''+''n'' is the dimension of the corresponding semisimple Lie algebra. *If the highest root is Σ''m''iα''i'' for simple roots α''i'', th ...
[...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]  


Coxeter Symbol
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]  


picture info

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]  


picture info

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]  


picture info

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]  


picture info

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]  


picture info

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]  


picture info

Cube
In geometry, a cube is a three-dimensional solid object bounded by six square faces, facets or sides, with three meeting at each vertex. Viewed from a corner it is a hexagon and its net is usually depicted as a cross. The cube is the only regular hexahedron and is one of the five Platonic solids. It has 6 faces, 12 edges, and 8 vertices. The cube is also a square parallelepiped, an equilateral cuboid and a right rhombohedron a 3-zonohedron. It is a regular square prism in three orientations, and a trigonal trapezohedron in four orientations. The cube is dual to the octahedron. It has cubical or octahedral symmetry. The cube is the only convex polyhedron whose faces are all squares. Orthogonal projections The ''cube'' has four special orthogonal projections, centered, on a vertex, edges, face and normal to its vertex figure. The first and third correspond to the A2 and B2 Coxeter planes. Spherical tiling The cube can also be represented as a spherical tiling, and ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Rectification (geometry)
In Euclidean geometry, rectification, also known as critical truncation or complete-truncation, is the process of truncating a polytope by marking the midpoints of all its Edge (geometry), edges, and cutting off its Vertex (geometry), vertices at those points. The resulting polytope will be bounded by vertex figure facets and the rectified facets of the original polytope. A rectification operator is sometimes denoted by the letter with a Schläfli symbol. For example, is the rectified cube, also called a cuboctahedron, and also represented as \begin 4 \\ 3 \end. And a rectified cuboctahedron is a rhombicuboctahedron, and also represented as r\begin 4 \\ 3 \end. Conway polyhedron notation uses for ambo as this operator. In graph theory this operation creates a medial graph. The rectification of any regular self-dual polyhedron or tiling will result in another regular polyhedron or tiling with a tiling order of 4, for example the tetrahedron becoming an octahedron As a s ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]