|
Birectified 6-cube
In six-dimensional geometry, a rectified 6-cube is a convex uniform 6-polytope, being a rectification of the regular 6-cube. There are unique 6 degrees of rectifications, the zeroth being the 6-cube, and the 6th and last being the 6-orthoplex. Vertices of the rectified 6-cube are located at the edge-centers of the 6-cube. Vertices of the birectified 6-cube are located in the square face centers of the 6-cube. Rectified 6-cube Alternate names * Rectified hexeract (acronym: rax) (Jonathan Bowers) Construction The rectified 6-cube may be constructed from the 6-cube by truncating its vertices at the midpoints of its edges. Coordinates The Cartesian coordinates of the vertices of the rectified 6-cube with edge length are all permutations of: :(0,\ \pm1,\ \pm1,\ \pm1,\ \pm1,\ \pm1) Images Birectified 6-cube Alternate names * Birectified hexeract (acronym: brox) (Jonathan Bowers) * Rectified 6-demicube Construction The birectified 6-cube may be constructed from the 6-c ... [...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- ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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] |
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] |
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] |
Dodecagon
In geometry, a dodecagon or 12-gon is any twelve-sided polygon. Regular dodecagon A regular dodecagon is a figure with sides of the same length and internal angles of the same size. It has twelve lines of reflective symmetry and rotational symmetry of order 12. A regular dodecagon is represented by the Schläfli symbol and can be constructed as a truncated hexagon, t, or a twice-truncated triangle, tt. The internal angle at each vertex of a regular dodecagon is 150°. Area The area of a regular dodecagon of side length ''a'' is given by: :\begin A & = 3 \cot\left(\frac \right) a^2 = 3 \left(2+\sqrt \right) a^2 \\ & \simeq 11.19615242\,a^2 \end And in terms of the apothem ''r'' (see also inscribed figure), the area is: :\begin A & = 12 \tan\left(\frac\right) r^2 = 12 \left(2-\sqrt \right) r^2 \\ & \simeq 3.2153903\,r^2 \end In terms of the circumradius ''R'', the area is: :A = 6 \sin\left(\frac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Petrie Polygon
In geometry, a Petrie polygon for a regular polytope of dimensions is a skew polygon in which every consecutive sides (but no ) belongs to one of the facets. The Petrie polygon of a regular polygon is the regular polygon itself; that of a regular polyhedron is a skew polygon such that every two consecutive sides (but no three) belongs to one of the faces. Petrie polygons are named for mathematician John Flinders Petrie. For every regular polytope there exists an orthogonal projection onto a plane such that one Petrie polygon becomes a regular polygon with the remainder of the projection interior to it. The plane in question is the Coxeter plane of the symmetry group of the polygon, and the number of sides, , is the Coxeter number of the Coxeter group. These polygons and projected graphs are useful in visualizing symmetric structure of the higher-dimensional regular polytopes. Petrie polygons can be defined more generally for any embedded graph. They form the faces of anothe ... [...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] |
