1.
Cuboctahedron
–
In geometry, a cuboctahedron is a polyhedron with 8 triangular faces and 6 square faces. A cuboctahedron has 12 identical vertices, with 2 triangles and 2 squares meeting at each, as such, it is a quasiregular polyhedron, i. e. an Archimedean solid that is not only vertex-transitive but also edge-transitive. Its dual polyhedron is the rhombic dodecahedron, the cuboctahedron was probably known to Plato, Herons Definitiones quotes Archimedes as saying that Plato knew of a solid made of 8 triangles and 6 squares. Heptaparallelohedron Fuller applied the name Dymaxion to this shape, used in a version of the Dymaxion map. He also called it the Vector Equilibrium and he called a cuboctahedron consisting of rigid struts connected by flexible vertices a jitterbug. With Oh symmetry, order 48, it is a cube or rectified octahedron With Td symmetry, order 24. With D3d symmetry, order 12, it is a triangular gyrobicupola. The area A and the volume V of the cuboctahedron of edge length a are, the cuboctahedron has four special orthogonal projections, centered on a vertex, an edge, and the two types of faces, triangular and square. The last two correspond to the B2 and A2 Coxeter planes, the skew projections show a square and hexagon passing through the center of the cuboctahedron. The cuboctahedron can also be represented as a tiling. This projection is conformal, preserving angles but not areas or lengths, straight lines on the sphere are projected as circular arcs on the plane. The cuboctahedrons 12 vertices can represent the vectors of the simple Lie group A3. With the addition of 6 vertices of the octahedron, these represent the 18 root vectors of the simple Lie group B3. The cuboctahedron can be dissected into two triangular cupolas by a common hexagon passing through the center of the cuboctahedron, if these two triangular cupolas are twisted so triangles and squares line up, Johnson solid J27, the triangular orthobicupola, is created. The cuboctahedron can also be dissected into 6 square pyramids and 8 tetrahedra meeting at a central point and this dissection is expressed in the alternated cubic honeycomb where pairs of square pyramids are combined into octahedra. A cuboctahedron can be obtained by taking a cross section of a four-dimensional 16-cell. Its first stellation is the compound of a cube and its dual octahedron, the cuboctahedron is a rectified cube and also a rectified octahedron. It is also a cantellated tetrahedron, with this construction it is given the Wythoff symbol,33 |2
2.
Rectified cubic honeycomb
–
The cubic honeycomb or cubic cellulation is the only regular space-filling tessellation in Euclidean 3-space, made up of cubic cells. It has 4 cubes around every edge, and 8 cubes around each vertex and its vertex figure is a regular octahedron. It is a tessellation with Schläfli symbol. John Horton Conway calls this honeycomb a cubille, a geometric honeycomb is a space-filling of polyhedral or higher-dimensional cells, so that there are no gaps. It is an example of the general mathematical tiling or tessellation in any number of dimensions. Honeycombs are usually constructed in ordinary Euclidean space, like the uniform honeycombs. They may also be constructed in non-Euclidean spaces, such as hyperbolic uniform honeycombs, any finite uniform polytope can be projected to its circumsphere to form a uniform honeycomb in spherical space. The Cartesian coordinates of the vertices are, for all values, i, j, k, with edges parallel to the axes. It is part of a family of hypercube honeycombs, with Schläfli symbols of the form, starting with the square tiling. It is one of 28 uniform honeycombs using convex uniform polyhedral cells, simple cubic lattices can be distorted into lower symmetries, represented by lower crystal systems, There is a large number of uniform colorings, derived from different symmetries. These include, It is related to the regular 4-polytope tesseract, Schläfli symbol, which exists in 4-space and its also related to the order-5 cubic honeycomb, Schläfli symbol, of hyperbolic space with 5 cubes around each edge. It is in a sequence of polychora and honeycomb with octahedral vertex figures and it in a sequence of regular polytopes and honeycombs with cubic cells. The, Coxeter group generates 15 permutations of uniform tessellations,9 with distinct geometry including the cubic honeycomb. The expanded cubic honeycomb is geometrically identical to the cubic honeycomb, the, Coxeter group generates 9 permutations of uniform tessellations,4 with distinct geometry including the alternated cubic honeycomb. This honeycomb is one of five distinct uniform honeycombs constructed by the A ~3 Coxeter group and it is composed of octahedra and cuboctahedra in a ratio of 1,1. John Horton Conway calls this honeycomb a cuboctahedrille, and its dual oblate octahedrille, There are four uniform colorings for the cells of this honeycomb with reflective symmetry, listed by their Coxeter group, and Wythoff construction name, and the Coxeter diagram below. This honeycomb can be divided on trihexagonal tiling planes, using the hexagon centers of the cuboctahedra and this scaliform honeycomb is represented by Coxeter diagram, and symbol s3, with coxeter notation symmetry. The truncated cubic honeycomb or truncated cubic cellulation is a uniform space-filling tessellation in Euclidean 3-space and it is composed of truncated cubes and octahedra in a ratio of 1,1
3.
Euclidean geometry
–
Euclidean geometry is a mathematical system attributed to the Alexandrian Greek mathematician Euclid, which he described in his textbook on geometry, the Elements. Euclids method consists in assuming a set of intuitively appealing axioms. Although many of Euclids results had been stated by earlier mathematicians, Euclid was the first to show how these propositions could fit into a comprehensive deductive and logical system. The Elements begins with plane geometry, still taught in school as the first axiomatic system. It goes on to the geometry of three dimensions. Much of the Elements states results of what are now called algebra and number theory, for more than two thousand years, the adjective Euclidean was unnecessary because no other sort of geometry had been conceived. Euclids axioms seemed so obvious that any theorem proved from them was deemed true in an absolute, often metaphysical. Today, however, many other self-consistent non-Euclidean geometries are known, Euclidean geometry is an example of synthetic geometry, in that it proceeds logically from axioms to propositions without the use of coordinates. This is in contrast to analytic geometry, which uses coordinates, the Elements is mainly a systematization of earlier knowledge of geometry. Its improvement over earlier treatments was recognized, with the result that there was little interest in preserving the earlier ones. There are 13 total books in the Elements, Books I–IV, Books V and VII–X deal with number theory, with numbers treated geometrically via their representation as line segments with various lengths. Notions such as numbers and rational and irrational numbers are introduced. The infinitude of prime numbers is proved, a typical result is the 1,3 ratio between the volume of a cone and a cylinder with the same height and base. Euclidean geometry is a system, in which all theorems are derived from a small number of axioms. To produce a straight line continuously in a straight line. To describe a circle with any centre and distance and that all right angles are equal to one another. Although Euclids statement of the only explicitly asserts the existence of the constructions. The Elements also include the five common notions, Things that are equal to the same thing are also equal to one another
4.
Polytope
–
In elementary geometry, a polytope is a geometric object with flat sides, and may exist in any general number of dimensions n as an n-dimensional polytope or n-polytope. For example, a polygon is a 2-polytope and a three-dimensional polyhedron is a 3-polytope. Polytopes in more than three dimensions were first discovered by Ludwig Schläfli, the German term polytop was coined by the mathematician Reinhold Hoppe, and was introduced to English mathematicians as polytope by Alicia Boole Stott. The term polytope is nowadays a broad term that covers a class of objects. Many of these definitions are not equivalent, resulting in different sets of objects being called polytopes and they represent different approaches to generalizing the convex polytopes to include other objects with similar properties. In this approach, a polytope may be regarded as a tessellation or decomposition of some given manifold, an example of this approach defines a polytope as a set of points that admits a simplicial decomposition. However this definition does not allow star polytopes with interior structures, the discovery of star polyhedra and other unusual constructions led to the idea of a polyhedron as a bounding surface, ignoring its interior. A polyhedron is understood as a surface whose faces are polygons, a 4-polytope as a hypersurface whose facets are polyhedra and this approach is used for example in the theory of abstract polytopes. In certain fields of mathematics, the terms polytope and polyhedron are used in a different sense and this terminology is typically confined to polytopes and polyhedra that are convex. A polytope comprises elements of different dimensionality such as vertices, edges, faces, cells, terminology for these is not fully consistent across different authors. For example, some authors use face to refer to an -dimensional element while others use face to denote a 2-face specifically, authors may use j-face or j-facet to indicate an element of j dimensions. Some use edge to refer to a ridge, while H. S. M. Coxeter uses cell to denote an -dimensional element, the terms adopted in this article are given in the table below, An n-dimensional polytope is bounded by a number of -dimensional facets. These facets are themselves polytopes, whose facets are -dimensional ridges of the original polytope, Every ridge arises as the intersection of two facets. Ridges are once again polytopes whose facets give rise to -dimensional boundaries of the original polytope and these bounding sub-polytopes may be referred to as faces, or specifically j-dimensional faces or j-faces. A 0-dimensional face is called a vertex, and consists of a single point, a 1-dimensional face is called an edge, and consists of a line segment. A 2-dimensional face consists of a polygon, and a 3-dimensional face, sometimes called a cell, the convex polytopes are the simplest kind of polytopes, and form the basis for several different generalizations of the concept of polytopes. A convex polytope is defined as the intersection of a set of half-spaces. This definition allows a polytope to be neither bounded nor finite, Polytopes are defined in this way, e. g. in linear programming
5.
Vertex figure
–
In geometry, a vertex figure, broadly speaking, is the figure exposed when a corner of a polyhedron or polytope is sliced off. Take some vertex of a polyhedron, mark a point somewhere along each connected edge. Draw lines across the faces, joining adjacent points. When done, these form a complete circuit, i. e. a polygon. This polygon is the vertex figure, more precise formal definitions can vary quite widely, according to circumstance. For example Coxeter 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 tilings, or space-filling tessellation with polytope cells. Make a slice through the corner of the polyhedron, cutting all the edges connected to the vertex. The cut surface is the vertex figure and this is perhaps the most common approach, and the most easily understood. Different authors make the slice in different places, Wenninger cuts each edge a unit distance from the vertex, as does Coxeter. For uniform polyhedra the Dorman Luke construction cuts each connected edge at its midpoint, other authors make the cut through the vertex at the other end of each edge. For irregular polyhedra, these approaches may produce a figure that does not lie in a plane. A more general approach, valid for convex polyhedra, is to make the cut along any plane which separates the given vertex from all the other vertices. Cromwell makes a cut or scoop, centered on the vertex. The cut surface or vertex figure is thus a spherical polygon marked on this sphere, many combinatorial and computational approaches treat a vertex figure as the ordered set of points of all the neighboring vertices to the given vertex. In the theory of polytopes, the vertex figure at a given vertex V comprises all the elements which are incident on the vertex, edges, faces. More formally it is the -section Fn/V, where Fn is the greatest face and this set of elements is elsewhere known as a vertex star. A vertex figure for an n-polytope is an -polytope, for example, a vertex figure for a polyhedron is a polygon figure, and the vertex figure for a 4-polytope is a polyhedron. Each edge of the vertex figure exists on or inside of a face of the original polytope connecting two vertices from an original face
6.
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. The cube is the only regular hexahedron and is one of the five Platonic solids and it has 6 faces,12 edges, and 8 vertices. The cube is also a square parallelepiped, an equilateral cuboid and it is a regular square prism in three orientations, and a trigonal trapezohedron in four orientations. The cube is dual to the octahedron and it has cubical or octahedral symmetry. The cube has four special orthogonal projections, centered, on a vertex, edges, face, the first and third correspond to the A2 and B2 Coxeter planes. The cube can also be represented as a tiling. This projection is conformal, preserving angles but not areas or lengths, straight lines on the sphere are projected as circular arcs on the plane. In analytic geometry, a surface with center and edge length of 2a is the locus of all points such that max = a. For a cube of length a, As the volume of a cube is the third power of its sides a × a × a, third powers are called cubes, by analogy with squares. A cube has the largest volume among cuboids with a surface area. Also, a cube has the largest volume among cuboids with the same linear size. They were unable to solve this problem, and in 1837 Pierre Wantzel proved it to be impossible because the root of 2 is not a constructible number. The cube has three uniform colorings, named by the colors of the faces around each vertex,111,112,123. The cube has three classes of symmetry, which can be represented by coloring the faces. The highest octahedral symmetry Oh has all the faces the same color, the dihedral symmetry D4h comes from the cube being a prism, with all four sides being the same color. The lowest symmetry D2h is also a symmetry, with sides alternating colors. Each symmetry form has a different Wythoff symbol, a cube has eleven nets, that is, there are eleven ways to flatten a hollow cube by cutting seven edges. To color the cube so that no two adjacent faces have the color, one would need at least three colors
7.
Rhombicuboctahedron
–
In geometry, the rhombicuboctahedron, or small rhombicuboctahedron, is an Archimedean solid with eight triangular and eighteen square faces. There are 24 identical vertices, with one triangle and three meeting at each. The polyhedron has octahedral symmetry, like the cube and octahedron and its dual is called the deltoidal icositetrahedron or trapezoidal icositetrahedron, although its faces are not really true trapezoids. Johannes Kepler in Harmonices Mundi named this polyhedron a rhombicuboctahedron, being short for truncated cuboctahedral rhombus and this truncation creates new vertices mid-edge to the rhombic dodecahedron, creating rectangular faces inside the original rhombic faces, and new square and triangle faces at the original vertices. The semiregular form here requires the geometry be adjusted so the rectangles become squares and it can also be called an expanded cube or cantellated cube or a cantellated octahedron from truncation operations of the uniform polyhedron. There are distortions of the rhombicuboctahedron that, while some of the faces are not regular polygons, are still vertex-uniform. Some of these can be made by taking a cube or octahedron and cutting off the edges, then trimming the corners, so the resulting polyhedron has six square and twelve rectangular faces. The lines along which a Rubiks Cube can be turned are, projected onto a sphere, similar, topologically identical, in fact, variants using the Rubiks Cube mechanism have been produced which closely resemble the rhombicuboctahedron. The rhombicuboctahedron is used in three uniform space-filling tessellations, the cubic honeycomb, the runcitruncated cubic honeycomb, and the runcinated alternated cubic honeycomb. The rhombicuboctahedron can be dissected into two square cupolae and an octagonal prism. A rotation of one cupola by 45 degrees creates the pseudorhombicuboctahedron, both of these polyhedra have the same vertex figure,3.4.4.4. There are three pairs of parallel planes that each intersect the rhombicuboctahedron in a regular octagon and these pieces can be reassembled to give a new solid called the elongated square gyrobicupola or pseudorhombicuboctahedron, with the symmetry of a square antiprism. The rhombicuboctahedron has six special orthogonal projections, centered, on a vertex, the last two correspond to the B2 and A2 Coxeter planes. The rhombicuboctahedron can also be represented as a tiling. This projection is conformal, preserving angles but not areas or lengths, straight lines on the sphere are projected as circular arcs on the plane. A half symmetry form of the rhombicuboctahedron, exists with pyritohedral symmetry, as Coxeter diagram, Schläfli symbol s2 and this form can be visualized by alternatingly coloring the edges of the 6 squares. These squares can then be distorted into rectangles, while the 8 triangles remain equilateral, the 12 diagonal square faces will become isosceles trapezoids. Cartesian coordinates for the vertices of a rhombicuboctahedron centred at the origin, if the original rhombicuboctahedron has unit edge length, its dual strombic icositetrahedron has edge lengths 2710 −2 and 4 −22
8.
Conway polyhedron notation
–
In geometry, Conway polyhedron notation, invented by John Horton Conway and promoted by George W. Hart, is used to describe polyhedra based on a seed polyhedron modified by various prefix operations. Conway and Hart extended the idea of using operators, like truncation defined by Kepler, the basic descriptive operators can generate all the Archimedean solids and Catalan solids from regular seeds. For example tC represents a cube, and taC, parsed as t, is a truncated cuboctahedron. The simplest operator dual swaps vertex and face elements, like a cube is an octahedron. Applied in a series, these allow many higher order polyhedra to be generated. A resulting polyhedron will have a fixed topology, while exact geometry is not constrained, the seed polyhedra are the Platonic solids, represented by the first letter of their name, the prisms for n-gonal forms, antiprisms, cupolae and pyramids. Any polyhedron can serve as a seed, as long as the operations can be executed on it, for example regular-faced Johnson solids can be referenced as Jn, for n=1.92. In general, it is difficult to predict the appearance of the composite of two or more operations from a given seed polyhedron. For instance ambo applied twice becomes the same as the operation, aa=e, while a truncation after ambo produces bevel. There has been no general theory describing what polyhedra can be generated in by any set of operators, instead all results have been discovered empirically. Elements are given from the seed to the new forms, assuming seed is a polyhedron, An example image is given for each operation. The basic operations are sufficient to generate the reflective uniform polyhedra, some basic operations can be made as composites of others. Special forms The kis operator has a variation, kn, which only adds pyramids to n-sided faces, the truncate operator has a variation, tn, which only truncates order-n vertices. The operators are applied like functions from right to left, for example, a cuboctahedron is an ambo cube, i. e. t = aC, and a truncated cuboctahedron is t = t = taC. Chirality operator r – reflect – makes the image of the seed. Alternately an overline can be used for picking the other chiral form, the operations are visualized here on cube seed examples, drawn on the surface of the cube, with blue faces that cross original edges, and pink faces that center at original vertices. The first row generates the Archimedean solids and the row the Catalan solids. Comparing each new polyhedron with the cube, each operation can be visually understood, the truncated icosahedron, tI or zD, which is Goldberg polyhedron G, creates more polyhedra which are neither vertex nor face-transitive
9.
Graph theory
–
In mathematics graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices, nodes, or points which are connected by edges, arcs, Graphs are one of the prime objects of study in discrete mathematics. Refer to the glossary of graph theory for basic definitions in graph theory, the following are some of the more basic ways of defining graphs and related mathematical structures. To avoid ambiguity, this type of graph may be described precisely as undirected, other senses of graph stem from different conceptions of the edge set. In one more generalized notion, V is a set together with a relation of incidence that associates with each two vertices. In another generalized notion, E is a multiset of unordered pairs of vertices, Many authors call this type of object a multigraph or pseudograph. All of these variants and others are described more fully below, the vertices belonging to an edge are called the ends or end vertices of the edge. A vertex may exist in a graph and not belong to an edge, V and E are usually taken to be finite, and many of the well-known results are not true for infinite graphs because many of the arguments fail in the infinite case. The order of a graph is |V|, its number of vertices, the size of a graph is |E|, its number of edges. The degree or valency of a vertex is the number of edges that connect to it, for an edge, graph theorists usually use the somewhat shorter notation xy. Graphs can be used to model many types of relations and processes in physical, biological, social, Many practical problems can be represented by graphs. Emphasizing their application to real-world systems, the network is sometimes defined to mean a graph in which attributes are associated with the nodes and/or edges. In computer science, graphs are used to represent networks of communication, data organization, computational devices, the flow of computation, etc. For instance, the structure of a website can be represented by a directed graph, in which the vertices represent web pages. A similar approach can be taken to problems in media, travel, biology, computer chip design. The development of algorithms to handle graphs is therefore of major interest in computer science, the transformation of graphs is often formalized and represented by graph rewrite systems. Graph-theoretic methods, in forms, have proven particularly useful in linguistics. Traditionally, syntax and compositional semantics follow tree-based structures, whose power lies in the principle of compositionality