|
Regular Complex Polygon
In geometry, a regular complex polygon is a generalization of a regular polygon in real space to an analogous structure in a complex Hilbert space, where each real dimension is accompanied by an imaginary one. A regular polygon exists in 2 real dimensions, \mathbb^2, while a complex polygon exists in two complex dimensions, \mathbb^2, which can be given real representations in 4 dimensions, \mathbb^4, which then must be projected down to 2 or 3 real dimensions to be visualized. A ''complex polygon'' is generalized as a complex polytope in \mathbb^n. A complex polygon may be understood as a collection of complex points, lines, planes, and so on, where every point is the junction of multiple lines, every line of multiple planes, and so on. The ''regular complex polygons'' have been completely characterized, and can be described using a symbolic notation developed by Coxeter. Regular complex polygons While 1-polytopes can have unlimited ''p'', finite regular complex polygons, exc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rank 2 Shephard Subgroups2
Rank is the relative position, value, worth, complexity, power, importance, authority, level, etc. of a person or object within a ranking, such as: Level or position in a hierarchical organization * Academic rank * Diplomatic rank * Hierarchy * Hierarchy of the Catholic Church * Military rank * Police ranks of the United States * Ranking member, S politicsthe most senior member of a committee from the minority party, and thus second-most senior member of a committee * Imperial, royal and noble ranks Level or position in society *Social class *Social position *Social status Places * Rank, Iran, a village * Rank, Nepal, a village development committee People * Rank (surname), a list of people with the name Arts, entertainment, and media Music * ''Rank'' (album), a live album by the Smiths * "Rank", a song by Artwork from '' A Bugged Out Mix'' Other arts, entertainment, and media * Rank (chess), a row of the chessboard * ''Rank'' (film), a short film directed by David Yates * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tesseract
In geometry, a tesseract is the four-dimensional analogue of the cube; the tesseract is to the cube as the cube is to the square. Just as the surface of the cube consists of six square faces, the hypersurface of the tesseract consists of eight cubical cells. The tesseract is one of the six convex regular 4-polytopes. The tesseract is also called an 8-cell, C8, (regular) octachoron, octahedroid, cubic prism, and tetracube. It is the four-dimensional hypercube, or 4-cube as a member of the dimensional family of hypercubes or measure polytopes. Coxeter labels it the \gamma_4 polytope. The term ''hypercube'' without a dimension reference is frequently treated as a synonym for this specific polytope. The ''Oxford English Dictionary'' traces the word ''tesseract'' to Charles Howard Hinton's 1888 book ''A New Era of Thought''. The term derives from the Greek ( 'four') and from ( 'ray'), referring to the four edges from each vertex to other vertices. Hinton originally spell ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
3-3 Duopyramid
In the geometry of 4 dimensions, the 3-3 duoprism or triangular duoprism is a four-dimensional convex polytope. It can be constructed as the Cartesian product of two triangles and is the simplest of an infinite family of four-dimensional polytopes constructed as Cartesian products of two polygons, the duoprisms. It has 9 vertices, 18 edges, 15 faces (9 squares, and 6 triangles), in 6 triangular prism cells. It has Coxeter diagram , and symmetry , order 72. Its vertices and edges form a 3\times 3 rook's graph. Hypervolume The hypervolume of a uniform 3-3 duoprism, with edge length ''a'', is V_4 = a^4. This is the square of the area of an equilateral triangle, A = a^2. Graph The graph of vertices and edges of the 3-3 duoprism has 9 vertices and 18 edges. Like the Berlekamp–van Lint–Seidel graph and the unknown solution to Conway's 99-graph problem, every edge is part of a unique triangle and every non-adjacent pair of vertices is the diagonal of a unique square. It is a toro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
3-3 Duoprism
In the geometry of 4 dimensions, the 3-3 duoprism or triangular duoprism is a 4-polytope, four-dimensional convex polytope. It can be constructed as the Cartesian product of two triangles and is the simplest of an infinite family of four-dimensional polytopes constructed as Cartesian products of two polygons, the duoprisms. It has 9 vertices, 18 edges, 15 faces (9 squares, and 6 triangles), in 6 triangular prism cells. It has Coxeter diagram , and symmetry , order 72. Its vertices and edges form a 3\times 3 rook's graph. Hypervolume The hypervolume of a Uniform_4-polytope#Duoprisms:_.5Bp.5D_.C3.97_.5Bq.5D, uniform 3-3 duoprism, with edge length ''a'', is V_4 = a^4. This is the square of the Equilateral_triangle#Principal_properties, area of an equilateral triangle, A = a^2. Graph The graph of vertices and edges of the 3-3 duoprism has 9 vertices and 18 edges. Like the Berlekamp–van Lint–Seidel graph and the unknown solution to Conway's 99-graph problem, every edge is part of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Duopyramid
In geometry of 4 dimensions or higher, a double pyramid or duopyramid or fusil is a polytope constructed by 2 orthogonal polytopes with edges connecting all pairs of vertices between the two. The term fusil is used by Norman Johnson as a rhombic-shape. The term ''duopyramid'' was used by George Olshevsky, as the dual of a duoprism. Polygonal forms The lowest dimensional forms are 4 dimensional and connect two polygons. A ''p''-''q'' duopyramid or ''p''-''q'' fusil, represented by a composite Schläfli symbol + , and Coxeter-Dynkin diagram . The regular 16-cell can be seen as a 4-4 duopyramid or 4-4 fusil, , symmetry , order 128. A ''p-q duopyramid'' or ''p-q'' fusil has Coxeter group symmetry 'p'',2,''q'' order 4pq. When ''p'' and ''q'' are identical, the symmetry in Coxeter notation is doubled as or ''p'',2+,2''q'' order 8''p''2. Edges exist on all pairs of vertices between the ''p''-gon and ''q''-gon. The 1-skeleton of a ''p''-''q'' duopyramid represents edges o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Duoprism
In geometry of 4 dimensions or higher, a double prism or duoprism is a polytope resulting from the Cartesian product of two polytopes, each of two dimensions or higher. The Cartesian product of an -polytope and an -polytope is an -polytope, where and are dimensions of 2 (polygon) or higher. The lowest-dimensional duoprisms exist in 4-dimensional space as 4-polytopes being the Cartesian product of two polygons in 2-dimensional Euclidean space. More precisely, it is the set of points: :P_1 \times P_2 = \ where and are the sets of the points contained in the respective polygons. Such a duoprism is convex if both bases are convex, and is bounded by prismatic cells. Nomenclature Four-dimensional duoprisms are considered to be prismatic 4-polytopes. A duoprism constructed from two regular polygons of the same edge length is a uniform duoprism. A duoprism made of ''n''-polygons and ''m''-polygons is named by prefixing 'duoprism' with the names of the base polygons, for examp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complex Reflection Group
In mathematics, a complex reflection group is a finite group acting on a finite-dimensional complex vector space that is generated by complex reflections: non-trivial elements that fix a complex hyperplane pointwise. Complex reflection groups arise in the study of the invariant theory of polynomial rings. In the mid-20th century, they were completely classified in work of Shephard and Todd. Special cases include the symmetric group of permutations, the dihedral groups, and more generally all finite real reflection groups (the Coxeter groups or Weyl groups, including the symmetry groups of regular polyhedra). Definition A (complex) reflection ''r'' (sometimes also called ''pseudo reflection'' or ''unitary reflection'') of a finite-dimensional complex vector space ''V'' is an element r \in GL(V) of finite order that fixes a complex hyperplane pointwise, that is, the ''fixed-space'' \operatorname(r) := \operatorname(r-\operatorname_V) has codimension 1. A (finite) complex reflectio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alternation (geometry)
In geometry, an alternation or ''partial truncation'', is an operation on a polygon, polyhedron, tiling, or higher dimensional polytope that removes alternate vertices.Coxeter, Regular polytopes, pp. 154–156 8.6 Partial truncation, or alternation Coxeter labels an ''alternation'' by a prefixed ''h'', standing for ''hemi'' or ''half''. Because alternation reduces all polygon faces to half as many sides, it can only be applied to polytopes with all even-sided faces. An alternated square face becomes a digon, and being degenerate, is usually reduced to a single edge. More generally any vertex-uniform polyhedron or tiling with a vertex configuration consisting of all even-numbered elements can be ''alternated''. For example, the alternation of a vertex figure with ''2a.2b.2c'' is ''a.3.b.3.c.3'' where the three is the number of elements in this vertex figure. A special case is square faces whose order divides in half into degenerate digons. So for example, the cube ''4.4.4'' i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Coxeter Number
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] |
Unitary Reflection
In mathematics, a complex reflection group is a finite group acting on a finite-dimensional complex vector space that is generated by complex reflections: non-trivial elements that fix a complex hyperplane pointwise. Complex reflection groups arise in the study of the invariant theory of polynomial rings. In the mid-20th century, they were completely classified in work of Shephard and Todd. Special cases include the symmetric group of permutations, the dihedral groups, and more generally all finite real reflection groups (the Coxeter groups or Weyl groups, including the symmetry groups of regular polyhedra). Definition A (complex) reflection ''r'' (sometimes also called ''pseudo reflection'' or ''unitary reflection'') of a finite-dimensional complex vector space ''V'' is an element r \in GL(V) of finite order that fixes a complex hyperplane pointwise, that is, the ''fixed-space'' \operatorname(r) := \operatorname(r-\operatorname_V) has codimension 1. A (finite) complex reflectio ... [...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] |
