|
Trirectified 9-simplex
In nine-dimensional geometry, a rectified 9-simplex is a convex uniform 9-polytope, being a rectification of the regular 9-simplex. These polytopes are part of a family of 271 uniform 9-polytopes with A9 symmetry. There are unique 4 degrees of rectifications. Vertices of the rectified 9-simplex are located at the edge-centers of the 9-simplex. Vertices of the birectified 9-simplex are located in the triangular face centers of the 9-simplex. Vertices of the trirectified 9-simplex are located in the tetrahedral cell centers of the 9-simplex. Vertices of the quadrirectified 9-simplex are located in the 5-cell centers of the 9-simplex. Rectified 9-simplex The rectified 9-simplex is the vertex figure of the 10-demicube. Alternate names * Rectified decayotton (reday) (Jonathan Bowers) Coordinates The Cartesian coordinates of the vertices of the ''rectified 9-simplex'' can be most simply positioned in 10-space as permutations of (0,0,0,0,0,0,0,0,1,1). This construction is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
9-simplex T0
In geometry, a 9-simplex is a self-dual regular 9-polytope. It has 10 vertices, 45 edges, 120 triangle faces, 210 tetrahedral cells, 252 5-cell 4-faces, 210 5-simplex 5-faces, 120 6-simplex 6-faces, 45 7-simplex 7-faces, and 10 8-simplex 8-faces. Its dihedral angle is cos−1(1/9), or approximately 83.62°. It can also be called a decayotton, or deca-9-tope, as a 10- facetted polytope in 9-dimensions.. The name ''decayotton'' is derived from ''deca'' for ten facets in Greek and yotta (a variation of "oct" for eight), having 8-dimensional facets, and ''-on''. Coordinates The Cartesian coordinates of the vertices of an origin-centered regular decayotton having edge length 2 are: :\left(\sqrt,\ 1/6,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ \pm1\right) :\left(\sqrt,\ 1/6,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ -2\sqrt,\ 0\right) :\left(\sqrt,\ 1/6,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ -\sqrt,\ 0,\ 0\right) :\left(\sqrt,\ 1/6,\ \sqrt,\ \sqrt,\ \sqrt,\ -2\sqrt,\ 0,\ 0,\ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Decagon
In geometry, a decagon (from the Greek δέκα ''déka'' and γωνία ''gonía,'' "ten angles") is a ten-sided polygon or 10-gon.. The total sum of the interior angles of a simple decagon is 1440°. A self-intersecting ''regular decagon'' is known as a decagram. Regular decagon A '' regular decagon'' has all sides of equal length and each internal angle will always be equal to 144°. Its Schläfli symbol is and can also be constructed as a truncated pentagon, t, a quasiregular decagon alternating two types of edges. Side length The picture shows a regular decagon with side length a and radius R of the circumscribed circle. * The triangle E_E_1M has to equally long legs with length R and a base with length a * The circle around E_1 with radius a intersects ]M\,E_ _in_a_point_P_(not_designated_in_the_picture)._ *_Now_the_triangle_\;_is_a_isosceles_triangle.html" ;"title="/math> in a point P (not designated in the picture). * Now the triangle \; is a isosceles triang ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Trirectified 10-orthoplex
In ten-dimensional geometry, a rectified 10-orthoplex is a convex uniform 10-polytope, being a rectification of the regular 10-orthoplex. There are 10 rectifications of the 10-orthoplex. Vertices of the rectified 10-orthoplex are located at the edge-centers of the 9-orthoplex. Vertices of the birectified 10-orthoplex are located in the triangular face centers of the 10-orthoplex. Vertices of the trirectified 10-orthoplex are located in the tetrahedral cell centers of the 10-orthoplex. These polytopes are part of a family 1023 uniform 10-polytopes with BC10 symmetry. Rectified 10-orthoplex In ten-dimensional geometry, a rectified 10-orthoplex is a 10-polytope, being a rectification of the regular 10-orthoplex. Rectified 10-orthoplex The ''rectified 10-orthoplex'' is the vertex figure for the demidekeractic honeycomb. : or Alternate names * rectified decacross (Acronym rake) (Jonathan Bowers) Construction There are two Coxeter groups associated with the ''rect ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Birectified 10-orthoplex
In ten-dimensional geometry, a rectified 10-orthoplex is a convex uniform 10-polytope, being a rectification of the regular 10-orthoplex. There are 10 rectifications of the 10-orthoplex. Vertices of the rectified 10-orthoplex are located at the edge-centers of the 9-orthoplex. Vertices of the birectified 10-orthoplex are located in the triangular face centers of the 10-orthoplex. Vertices of the trirectified 10-orthoplex are located in the tetrahedral cell centers of the 10-orthoplex. These polytopes are part of a family 1023 uniform 10-polytopes with BC10 symmetry. Rectified 10-orthoplex In ten-dimensional geometry, a rectified 10-orthoplex is a 10-polytope, being a rectification of the regular 10-orthoplex. Rectified 10-orthoplex The ''rectified 10-orthoplex'' is the vertex figure for the demidekeractic honeycomb. : or Alternate names * rectified decacross (Acronym rake) (Jonathan Bowers) Construction There are two Coxeter groups associated with the ''rect ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sphere Packing
In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical size, and the space is usually three-dimensional Euclidean space. However, sphere packing problems can be generalised to consider unequal spheres, spaces of other dimensions (where the problem becomes circle packing in two dimensions, or hypersphere packing in higher dimensions) or to non-Euclidean spaces such as hyperbolic space. A typical sphere packing problem is to find an arrangement in which the spheres fill as much of the space as possible. The proportion of space filled by the spheres is called the ''packing density'' of the arrangement. As the local density of a packing in an infinite space can vary depending on the volume over which it is measured, the problem is usually to maximise the average or asymptotic density, measured over a large enough volume. For equal spheres in three dimensions, the densest packing uses ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kissing Number
In geometry, the kissing number of a mathematical space is defined as the greatest number of non-overlapping unit spheres that can be arranged in that space such that they each touch a common unit sphere. For a given sphere packing (arrangement of spheres) in a given space, a kissing number can also be defined for each individual sphere as the number of spheres it touches. For a lattice packing the kissing number is the same for every sphere, but for an arbitrary sphere packing the kissing number may vary from one sphere to another. Other names for kissing number that have been used are Newton number (after the originator of the problem), and contact number. In general, the kissing number problem seeks the maximum possible kissing number for ''n''-dimensional spheres in (''n'' + 1)-dimensional Euclidean space. Ordinary spheres correspond to two-dimensional closed surfaces in three-dimensional space. Finding the kissing number when centers of spheres are confined to a line (the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1 62 Honeycomb
In geometry, an E9 honeycomb is a tessellation of uniform polytopes in hyperbolic 9-dimensional space. _9, also (E10) is a paracompact hyperbolic group, so either facets or vertex figures will not be bounded. E10 is last of the series of Coxeter groups with a bifurcated Coxeter-Dynkin diagram of lengths 6,2,1. There are 1023 unique E10 honeycombs by all combinations of its Coxeter-Dynkin diagram. There are no regular honeycombs in the family since its Coxeter diagram is a nonlinear graph, but there are three simplest ones, with a single ring at the end of its 3 branches: 621, 261, 162. 621 honeycomb The 621 honeycomb is constructed from alternating 9-simplex and 9-orthoplex facets within the symmetry of the E10 Coxeter group. This honeycomb is highly regular in the sense that its symmetry group (the affine E9 Weyl group) acts transitively on the ''k''-faces for ''k'' ≤ 7. All of the ''k''-faces for ''k'' ≤ 8 are simplices. This honeycomb is last in the series of k21 p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rectified 10-orthoplex
In ten-dimensional geometry, a rectified 10-orthoplex is a convex uniform 10-polytope, being a rectification of the regular 10-orthoplex. There are 10 rectifications of the 10-orthoplex. Vertices of the rectified 10-orthoplex are located at the edge-centers of the 9-orthoplex. Vertices of the birectified 10-orthoplex are located in the triangular face centers of the 10-orthoplex. Vertices of the trirectified 10-orthoplex are located in the tetrahedral cell centers of the 10-orthoplex. These polytopes are part of a family 1023 uniform 10-polytopes with BC10 symmetry. Rectified 10-orthoplex In ten-dimensional geometry, a rectified 10-orthoplex is a 10-polytope, being a rectification of the regular 10-orthoplex. Rectified 10-orthoplex The ''rectified 10-orthoplex'' is the vertex figure for the demidekeractic honeycomb. : or Alternate names * rectified decacross (Acronym rake) (Jonathan Bowers) Construction There are two Coxeter groups associated with the ''rec ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Facet (geometry)
In geometry, a facet is a feature of a polyhedron, polytope, or related geometric structure, generally of dimension one less than the structure itself. More specifically: * In three-dimensional geometry, a facet of a polyhedron is any polygon whose corners are vertices of the polyhedron, and is not a ''face''. To ''facet'' a polyhedron is to find and join such facets to form the faces of a new polyhedron; this is the reciprocal process to '' stellation'' and may also be applied to higher-dimensional polytopes. * In polyhedral combinatorics and in the general theory of polytopes, a facet (or hyperface) of a polytope of dimension ''n'' is a face that has dimension ''n'' − 1. Facets may also be called (''n'' − 1)-faces. In three-dimensional geometry, they are often called "faces" without qualification. * A facet of a simplicial complex is a maximal simplex, that is a simplex that is not a face of another simplex of the complex.. For (boundary complexes of) sim ... [...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 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] |
10-demicube
In geometry, a 10-demicube or demidekeract is a uniform 10-polytope, constructed from the 10-cube with alternated vertices removed. It is part of a dimensionally infinite family of uniform polytopes called demihypercubes. E. L. Elte identified it in 1912 as a semiregular polytope, labeling it as HM10 for a ten-dimensional ''half measure'' polytope. Coxeter named this polytope as 171 from its Coxeter diagram, with a ring on one of the 1-length branches, and Schläfli symbol \left\ or . Cartesian coordinates Cartesian coordinates for the vertices of a demidekeract centered at the origin are alternate halves of the dekeract: : (±1,±1,±1,±1,±1,±1,±1,±1,±1,±1) with an odd number of plus signs. Images References * H.S.M. Coxeter: ** Coxeter, ''Regular Polytopes'', (3rd edition, 1973), Dover edition, , p.296, Table I (iii): Regular Polytopes, three regular polytopes in n-dimensions (n≥5) ** H.S.M. Coxeter, ''Regular Polytopes'', 3rd Edition, Dover New York, 1973, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
_(cropped).jpg "Click for more on -> Sphere Packing")
