1.
Archimedean solid
–
In geometry, an Archimedean solid is one of the 13 solids first enumerated by Archimedes. They are the semi-regular convex polyhedrons composed of regular meeting in identical vertices, excluding the 5 Platonic solids. They differ from the Johnson solids, whose regular polygonal faces do not meet in identical vertices, identical vertices means that for any two vertices, there is a global isometry of the entire solid that takes one vertex to the other. Excluding these two families, there are 13 Archimedean solids. All the Archimedan solids can be made via Wythoff constructions from the Platonic solids with tetrahedral, octahedral and icosahedral symmetry, the Archimedean solids take their name from Archimedes, who discussed them in a now-lost work. Pappus refers to it, stating that Archimedes listed 13 polyhedra, kepler may have also found the elongated square gyrobicupola, at least, he once stated that there were 14 Archimedean solids. However, his published enumeration only includes the 13 uniform polyhedra, here the vertex configuration refers to the type of regular polygons that meet at any given vertex. For example, a configuration of means that a square, hexagon. Some definitions of semiregular polyhedron include one more figure, the square gyrobicupola or pseudo-rhombicuboctahedron. The number of vertices is 720° divided by the angle defect. The cuboctahedron and icosidodecahedron are edge-uniform and are called quasi-regular, the duals of the Archimedean solids are called the Catalan solids. Together with the bipyramids and trapezohedra, these are the face-uniform solids with regular vertices, the snub cube and snub dodecahedron are known as chiral, as they come in a left-handed form and right-handed form. When something comes in forms which are each others three-dimensional mirror image. The different Archimedean and Platonic solids can be related to each other using a handful of general constructions, starting with a Platonic solid, truncation involves cutting away of corners. To preserve symmetry, the cut is in a perpendicular to the line joining a corner to the center of the polyhedron and is the same for all corners. Depending on how much is truncated, different Platonic and Archimedean solids can be created, expansion or cantellation involves moving each face away from the center and taking the convex hull. Expansion with twisting also involves rotating the faces, thus breaking the rectangles corresponding to edges into triangles, the last construction we use here is truncation of both corners and edges. Ignoring scaling, expansion can also be viewed as truncation of corners and edges, note the duality between the cube and the octahedron, and between the dodecahedron and the icosahedron
2.
Uniform polyhedron
–
A uniform polyhedron is a polyhedron which has regular polygons as faces and is vertex-transitive. It follows that all vertices are congruent, Uniform polyhedra may be regular, quasi-regular or semi-regular. The faces and vertices need not be convex, so many of the uniform polyhedra are also star polyhedra, there are two infinite classes of uniform polyhedra together with 75 others. Dual polyhedra to uniform polyhedra are face-transitive and have regular vertex figures, the dual of a regular polyhedron is regular, while the dual of an Archimedean solid is a Catalan solid. The concept of uniform polyhedron is a case of the concept of uniform polytope. Coxeter, Longuet-Higgins & Miller define uniform polyhedra to be vertex-transitive polyhedra with regular faces, by a polygon they implicitly mean a polygon in 3-dimensional Euclidean space, these are allowed to be non-convex and to intersect each other. There are some generalizations of the concept of a uniform polyhedron, if the connectedness assumption is dropped, then we get uniform compounds, which can be split as a union of polyhedra, such as the compound of 5 cubes. If we drop the condition that the realization of the polyhedron is non-degenerate and these require a more general definition of polyhedra. Some of the ways they can be degenerate are as follows, some polyhedra have faces that are hidden, in the sense that no points of their interior can be seen from the outside. These are usually not counted as uniform polyhedra, some polyhedra have multiple edges and their faces are the faces of two or more polyhedra, though these are not compounds in the previous sense since the polyhedra share edges. There are some non-orientable polyhedra that have double covers satisfying the definition of a uniform polyhedron, there double covers have doubled faces, edges and vertices. They are usually not counted as uniform polyhedra, there are several polyhedra with doubled faces produced by Wythoffs construction. Most authors do not allow doubled faces and remove them as part of the construction, skillings figure has the property that it has double edges but its faces cannot be written as a union of two uniform polyhedra. Regular convex polyhedra, The Platonic solids date back to the classical Greeks and were studied by the Pythagoreans, Plato, Theaetetus, Timaeus of Locri, the Etruscans discovered the regular dodecahedron before 500 BC. Nonregular uniform convex polyhedra, The cuboctahedron was known by Plato, Archimedes discovered all of the 13 Archimedean solids. His original book on the subject was lost, but Pappus of Alexandria mentioned Archimedes listed 13 polyhedra, piero della Francesca rediscovered the five truncation of the Platonic solids, truncated tetrahedron, truncated octahedron, truncated cube, truncated dodecahedron, and truncated icosahedron. Luca Pacioli republished Francescas work in De divina proportione in 1509, adding the rhombicuboctahedron, calling it a icosihexahedron for its 26 faces, which was drawn by Leonardo da Vinci. Johannes Kepler was the first to publish the complete list of Archimedean solids, in 1619, regular star polyhedra, Kepler discovered two of the regular Kepler–Poinsot polyhedra and Louis Poinsot discovered the other two
3.
Euler characteristic
–
It is commonly denoted by χ. The Euler characteristic was originally defined for polyhedra and used to prove theorems about them. Leonhard Euler, for whom the concept is named, was responsible for much of early work. In modern mathematics, the Euler characteristic arises from homology and, more abstractly, any convex polyhedrons surface has Euler characteristic V − E + F =2. This equation is known as Eulers polyhedron formula and it corresponds to the Euler characteristic of the sphere, and applies identically to spherical polyhedra. An illustration of the formula on some polyhedra is given below and this version holds both for convex polyhedra and the non-convex Kepler-Poinsot polyhedra. Projective polyhedra all have Euler characteristic 1, like the real plane, while the surfaces of toroidal polyhedra all have Euler characteristic 0. The Euler characteristic can be defined for connected plane graphs by the same V − E + F formula as for polyhedral surfaces, the Euler characteristic of any plane connected graph G is 2. This is easily proved by induction on the number of determined by G. For trees, E = V −1 and F =1, if G has C components, the same argument by induction on F shows that V − E + F − C =1. One of the few graph theory papers of Cauchy also proves this result, via stereographic projection the plane maps to the two-dimensional sphere, such that a connected graph maps to a polygonal decomposition of the sphere, which has Euler characteristic 2. This viewpoint is implicit in Cauchys proof of Eulers formula given below, there are many proofs of Eulers formula. One was given by Cauchy in 1811, as follows and it applies to any convex polyhedron, and more generally to any polyhedron whose boundary is topologically equivalent to a sphere and whose faces are topologically equivalent to disks. Remove one face of the polyhedral surface, after this deformation, the regular faces are generally not regular anymore. The number of vertices and edges has remained the same, therefore, proving Eulers formula for the polyhedron reduces to proving V − E + F =1 for this deformed, planar object. If there is a face more than three sides, draw a diagonal—that is, a curve through the face connecting two vertices that arent connected yet. This adds one edge and one face and does not change the number of vertices, continue adding edges in this manner until all of the faces are triangular. This decreases the number of edges and faces by one each and does not change the number of vertices, remove a triangle with two edges shared by the exterior of the network, as illustrated by the third graph
4.
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
5.
Wythoff symbol
–
In geometry, the Wythoff symbol represents a Wythoff construction of a uniform polyhedron or plane tiling, from a Schwarz triangle. It was first used by Coxeter, Longuet-Higgins and Miller in their enumeration of the uniform polyhedra, a Wythoff symbol consists of three numbers and a vertical bar. It represents one uniform polyhedron or tiling, although the same tiling/polyhedron can have different Wythoff symbols from different symmetry generators, with a slight extension, Wythoffs symbol can be applied to all uniform polyhedra. However, the methods do not lead to all uniform tilings in euclidean or hyperbolic space. In three dimensions, Wythoffs construction begins by choosing a point on the triangle. If the distance of this point from each of the sides is non-zero, a perpendicular line is then dropped between the generator point and every face that it does not lie on. The three numbers in Wythoffs symbol, p, q and r, represent the corners of the Schwarz triangle used in the construction, the triangle is also represented with the same numbers, written. In this notation the mirrors are labeled by the reflection-order of the opposite vertex, the p, q, r values are listed before the bar if the corresponding mirror is active. The one impossible symbol | p q r implies the point is on all mirrors. This unused symbol is therefore arbitrarily reassigned to represent the case where all mirrors are active, the resulting figure has rotational symmetry only. The generator point can either be on or off each mirror and this distinction creates 8 possible forms, neglecting one where the generator point is on all the mirrors. A node is circled if the point is not on the mirror. There are seven generator points with each set of p, q, r, | p q r – Snub forms are given by this otherwise unused symbol. | p q r s – A unique snub form for U75 that isnt Wythoff-constructible, There are 4 symmetry classes of reflection on the sphere, and two in the Euclidean plane. A few of the many such patterns in the hyperbolic plane are also listed. The list of Schwarz triangles includes rational numbers, and determine the set of solutions of nonconvex uniform polyhedra. In the tilings above, each triangle is a domain, colored by even. Selected tilings created by the Wythoff construction are given below, for a more complete list, including cases where r ≠2, see List of uniform polyhedra by Schwarz triangle
6.
Tetrahedral symmetry
–
A regular tetrahedron has 12 rotational symmetries, and a symmetry order of 24 including transformations that combine a reflection and a rotation. The set of orientation-preserving symmetries forms a group referred to as the alternating subgroup A4 of S4, chiral and full are discrete point symmetries. They are among the point groups of the cubic crystal system. Seen in stereographic projection the edges of the tetrakis hexahedron form 6 circles in the plane, each of these 6 circles represent a mirror line in tetrahedral symmetry. The intersection of these meet at order 2 and 3 gyration points. T,332, +, or 23, of order 12 – chiral or rotational tetrahedral symmetry, there are three orthogonal 2-fold rotation axes, like chiral dihedral symmetry D2 or 222, with in addition four 3-fold axes, centered between the three orthogonal directions. This group is isomorphic to A4, the group on 4 elements, in fact it is the group of even permutations of the four 3-fold axes. The three elements of the latter are the identity, clockwise rotation, and anti-clockwise rotation, corresponding to permutations of the three orthogonal 2-fold axes, preserving orientation. Td, *332, or 43m, of order 24 – achiral or full tetrahedral symmetry and this group has the same rotation axes as T, but with six mirror planes, each through two 3-fold axes. The 2-fold axes are now S4 axes, td and O are isomorphic as abstract groups, they both correspond to S4, the symmetric group on 4 objects. Td is the union of T and the set obtained by combining each element of O \ T with inversion, see also the isometries of the regular tetrahedron. This group has the same axes as T, with mirror planes through two of the orthogonal directions. The 3-fold axes are now S6 axes, and there is an inversion symmetry. Th is isomorphic to T × Z2, every element of Th is either an element of T, apart from these two normal subgroups, there is also a normal subgroup D2h, of type Dih2 × Z2 = Z2 × Z2 × Z2. It is the product of the normal subgroup of T with Ci. The quotient group is the same as above, of type Z3, the three elements of the latter are the identity, clockwise rotation, and anti-clockwise rotation, corresponding to permutations of the three orthogonal 2-fold axes, preserving orientation. It is the symmetry of a cube with on each face a line segment dividing the face into two rectangles, such that the line segments of adjacent faces do not meet at the edge. The symmetries correspond to the permutations of the body diagonals
7.
Point groups in three dimensions
–
In geometry, a point group in three dimensions is an isometry group in three dimensions that leaves the origin fixed, or correspondingly, an isometry group of a sphere. It is a subgroup of the orthogonal group O, the group of all isometries that leave the origin fixed, or correspondingly, O itself is a subgroup of the Euclidean group E of all isometries. Symmetry groups of objects are isometry groups, accordingly, analysis of isometry groups is analysis of possible symmetries. All isometries of a bounded 3D object have one or more fixed points. We choose the origin as one of them, the rotation group of an object is equal to its full symmetry group if and only if the object is chiral. Finite Coxeter groups are a set of point groups generated purely by a set of reflectional mirrors passing through the same point. A rank n Coxeter group has n mirrors and is represented by a Coxeter–Dynkin diagram, Coxeter notation offers a bracketed notation equivalent to the Coxeter diagram, with markup symbols for rotational and other subsymmetry point groups. SO is a subgroup of E+, which consists of direct isometries, i. e. isometries preserving orientation, it contains those that leave the origin fixed. O is the product of SO and the group generated by inversion. An example would be C4 for H and S4 for M, Thus M is obtained from H by inverting the isometries in H ∖ L. This is clarifying when categorizing isometry groups, see below, in 2D the cyclic group of k-fold rotations Ck is for every positive integer k a normal subgroup of O and SO. Accordingly, in 3D, for every axis the cyclic group of rotations about that axis is a normal subgroup of the group of all rotations about that axis. e. See also the similar overview including translations, when comparing the symmetry type of two objects, the origin is chosen for each separately, i. e. they need not have the same center. Moreover, two objects are considered to be of the symmetry type if their symmetry groups are conjugate subgroups of O. The conjugacy definition would allow a mirror image of the structure, but this is not needed. For example, if a symmetry group contains a 3-fold axis of rotation, there are many infinite isometry groups, for example, the cyclic group generated by a rotation by an irrational number of turns about an axis. We may create non-cyclical abelian groups by adding more rotations around the same axis, there are also non-abelian groups generated by rotations around different axes. They will be infinite unless the rotations are specially chosen, all the infinite groups mentioned so far are not closed as topological subgroups of O
8.
Dihedral angle
–
A dihedral angle is the angle between two intersecting planes. In chemistry it is the angle between planes through two sets of three atoms, having two atoms in common, in solid geometry it is defined as the union of a line and two half-planes that have this line as a common edge. In higher dimension, a dihedral angle represents the angle between two hyperplanes, a dihedral angle is an angle between two intersecting planes on a third plane perpendicular to the line of intersection. A torsion angle is an example of a dihedral angle. In stereochemistry every set of three atoms of a molecule defines a plane, when two such planes intersect, the angle between them is a dihedral angle. Dihedral angles are used to specify the molecular conformation, stereochemical arrangements corresponding to angles between 0° and ±90° are called syn, those corresponding to angles between ±90° and 180° anti. Similarly, arrangements corresponding to angles between 30° and 150° or between −30° and −150° are called clinal and those between 0° and ±30° or ±150° and 180° are called periplanar. The synperiplanar conformation is also known as the syn- or cis-conformation, antiperiplanar as anti or trans, for example, with n-butane two planes can be specified in terms of the two central carbon atoms and either of the methyl carbon atoms. The syn-conformation shown above, with an angle of 60° is less stable than the anti-configuration with a dihedral angle of 180°. For macromolecular usage the symbols T, C, G+, G−, A+, a Ramachandran plot, originally developed in 1963 by G. N. Ramachandran, C. Ramakrishnan, and V. Sasisekharan, is a way to visualize energetically allowed regions for backbone dihedral angles ψ against φ of amino acid residues in protein structure, the figure at right illustrates the definition of the φ and ψ backbone dihedral angles. In a protein chain three dihedral angles are defined as φ, ψ and ω, as shown in the diagram, the planarity of the peptide bond usually restricts ω to be 180° or 0°. The distance between the Cα atoms in the trans and cis isomers is approximately 3.8 and 2.9 Å, the cis isomer is mainly observed in Xaa–Pro peptide bonds. The sidechain dihedral angles tend to cluster near 180°, 60°, and −60°, which are called the trans, gauche+, the stability of certain sidechain dihedral angles is affected by the values φ and ψ. For instance, there are steric interactions between the Cγ of the side chain in the gauche+ rotamer and the backbone nitrogen of the next residue when ψ is near -60°. An alternative method is to calculate the angle between the vectors, nA and nB, which are normal to the planes. Cos φ = − n A ⋅ n B | n A | | n B | where nA · nB is the dot product of the vectors and |nA| |nB| is the product of their lengths. Any plane can also be described by two non-collinear vectors lying in that plane, taking their cross product yields a vector to the plane
9.
Harold Scott MacDonald Coxeter
–
Harold Scott MacDonald Donald Coxeter, FRS, FRSC, CC was a British-born Canadian geometer. Coxeter is regarded as one of the greatest geometers of the 20th century and he was born in London but spent most of his adult life in Canada. He was always called Donald, from his third name MacDonald, in his youth, Coxeter composed music and was an accomplished pianist at the age of 10. He felt that mathematics and music were intimately related, outlining his ideas in a 1962 article on Mathematics and he worked for 60 years at the University of Toronto and published twelve books. He was most noted for his work on regular polytopes and higher-dimensional geometries and he was a champion of the classical approach to geometry, in a period when the tendency was to approach geometry more and more via algebra. Coxeter went up to Trinity College, Cambridge in 1926 to read mathematics, there he earned his BA in 1928, and his doctorate in 1931. In 1932 he went to Princeton University for a year as a Rockefeller Fellow, where he worked with Hermann Weyl, Oswald Veblen, returning to Trinity for a year, he attended Ludwig Wittgensteins seminars on the philosophy of mathematics. In 1934 he spent a year at Princeton as a Procter Fellow. In 1936 Coxeter moved to the University of Toronto, flather, and John Flinders Petrie published The Fifty-Nine Icosahedra with University of Toronto Press. In 1940 Coxeter edited the eleventh edition of Mathematical Recreations and Essays and he was elevated to professor in 1948. Coxeter was elected a Fellow of the Royal Society of Canada in 1948 and he also inspired some of the innovations of Buckminster Fuller. Coxeter, M. S. Longuet-Higgins and J. C. P. Miller were the first to publish the full list of uniform polyhedra, since 1978, the Canadian Mathematical Society have awarded the Coxeter–James Prize in his honor. He was made a Fellow of the Royal Society in 1950, in 1990, he became a Foreign Member of the American Academy of Arts and Sciences and in 1997 was made a Companion of the Order of Canada. In 1973 he got the Jeffery–Williams Prize,1940, Regular and Semi-Regular Polytopes I, Mathematische Zeitschrift 46, 380-407, MR2,10 doi,10. 1007/BF011814491942, Non-Euclidean Geometry, University of Toronto Press, MAA. 1954, Uniform Polyhedra, Philosophical Transactions of the Royal Society A246, arthur Sherk, Peter McMullen, Anthony C. Thompson and Asia Ivić Weiss, editors, Kaleidoscopes — Selected Writings of H. S. M. John Wiley and Sons ISBN 0-471-01003-01999, The Beauty of Geometry, Twelve Essays, Dover Publications, LCCN 99-35678, ISBN 0-486-40919-8 Davis, Chandler, Ellers, Erich W, the Coxeter Legacy, Reflections and Projections. King of Infinite Space, Donald Coxeter, the Man Who Saved Geometry, www. donaldcoxeter. com www. math. yorku. ca/dcoxeter webpages dedicated to him Jarons World, Shapes in Other Dimensions, Discover mag. Apr 2007 The Mathematics in the Art of M. C, escher video of a lecture by H. S. M
10.
Convex polyhedron
–
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n-dimensional space Rn. Some authors use the terms polytope and convex polyhedron interchangeably. In addition, some require a polytope to be a bounded set. The terms bounded/unbounded convex polytope will be used whenever the boundedness is critical to the discussed issue. Yet other texts treat a convex n-polytope as a surface or -manifold, Convex polytopes play an important role both in various branches of mathematics and in applied areas, most notably in linear programming. A comprehensive and influential book in the subject, called Convex Polytopes, was published in 1967 by Branko Grünbaum, in 2003 the 2nd edition of the book was published, with significant additional material contributed by new writers. In Grünbaums book, and in other texts in discrete geometry. Grünbaum points out that this is solely to avoid the repetition of the word convex. A polytope is called if it is an n-dimensional object in Rn. Many examples of bounded convex polytopes can be found in the article polyhedron, a convex polytope may be defined in a number of ways, depending on what is more suitable for the problem at hand. Grünbaums definition is in terms of a set of points in space. Other important definitions are, as the intersection of half-spaces and as the hull of a set of points. This is equivalent to defining a bounded convex polytope as the hull of a finite set of points. Such a definition is called a vertex representation, for a compact convex polytope, the minimal V-description is unique and it is given by the set of the vertices of the polytope. A convex polytope may be defined as an intersection of a number of half-spaces. Such definition is called a half-space representation, there exist infinitely many H-descriptions of a convex polytope. However, for a convex polytope, the minimal H-description is in fact unique and is given by the set of the facet-defining halfspaces. A closed half-space can be written as an inequality, a 1 x 1 + a 2 x 2 + ⋯ + a n x n ≤ b where n is the dimension of the space containing the polytope under consideration
11.
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
12.
Triakis tetrahedron
–
In geometry, a triakis tetrahedron is an Archimedean dual solid, or a Catalan solid. Its dual is the truncated tetrahedron and it can be seen as a tetrahedron with triangular pyramids added to each face, that is, it is the Kleetope of the tetrahedron. This interpretation is expressed in the name, the length of the shorter edges is 3/5 that of the longer edges. If the triakis tetrahedron has shorter edge length 1, it has area 5/3√11, a triakis tetrahedron with equilateral triangle faces represents a net of the four-dimensional regular polytope known as the 5-cell. If the triangles are right-angled isosceles, the faces will be coplanar and this can be seen by adding the 6 edges of tetrahedron inside of a cube. This chiral figure is one of thirteen stellations allowed by Millers rules, the triakis tetrahedron is a part of a sequence of polyhedra and tilings, extending into the hyperbolic plane. These face-transitive figures have reflectional symmetry, the Geometrical Foundation of Natural Structure, A Source Book of Design
13.
Dual polyhedron
–
Such dual figures remain combinatorial or abstract polyhedra, but not all are also geometric polyhedra. Starting with any given polyhedron, the dual of its dual is the original polyhedron, duality preserves the symmetries of a polyhedron. Therefore, for classes of polyhedra defined by their symmetries. Thus, the regular polyhedra – the Platonic solids and Kepler-Poinsot polyhedra – form dual pairs, the dual of an isogonal polyhedron, having equivalent vertices, is one which is isohedral, having equivalent faces. The dual of a polyhedron is also isotoxal. Duality is closely related to reciprocity or polarity, a transformation that. There are many kinds of duality, the kinds most relevant to elementary polyhedra are polar reciprocity and topological or abstract duality. The duality of polyhedra is often defined in terms of polar reciprocation about a concentric sphere. In coordinates, for reciprocation about the sphere x 2 + y 2 + z 2 = r 2, the vertex is associated with the plane x 0 x + y 0 y + z 0 z = r 2. The vertices of the dual are the reciprocal to the face planes of the original. Also, any two adjacent vertices define an edge, and these will reciprocate to two adjacent faces which intersect to define an edge of the dual and this dual pair of edges are always orthogonal to each other. If r 0 is the radius of the sphere, and r 1 and r 2 respectively the distances from its centre to the pole and its polar, then, r 1. R2 = r 02 For the more symmetrical polyhedra having an obvious centroid, it is common to make the polyhedron and sphere concentric, the choice of center for the sphere is sufficient to define the dual up to similarity. If multiple symmetry axes are present, they will intersect at a single point. Failing that, a sphere, inscribed sphere, or midsphere is commonly used. If a polyhedron in Euclidean space has an element passing through the center of the sphere, since Euclidean space never reaches infinity, the projective equivalent, called extended Euclidean space, may be formed by adding the required plane at infinity. Some theorists prefer to stick to Euclidean space and say there is no dual. Meanwhile, Wenninger found a way to represent these infinite duals, the concept of duality here is closely related to the duality in projective geometry, where lines and edges are interchanged
14.
Net (polyhedron)
–
In geometry the net of a polyhedron is an arrangement of edge-joined polygons in the plane which can be folded to become the faces of the polyhedron. Polyhedral nets are an aid to the study of polyhedra and solid geometry in general. Many different nets can exist for a polyhedron, depending on the choices of which edges are joined. Conversely, a given net may fold into more than one different convex polyhedron, depending on the angles at which its edges are folded, additionally, the same net may have multiple valid gluing patterns, leading to different folded polyhedra. Shephard asked whether every convex polyhedron has at least one net and this question, which is also known as Dürers conjecture, or Dürers unfolding problem, remains unanswered. There exist non-convex polyhedra that do not have nets, and it is possible to subdivide the faces of every convex polyhedron so that the set of subdivided faces has a net, in 2014 Mohammad Ghomi showed that every convex polyhedron admits a net after an affine transformation. The shortest path over the surface between two points on the surface of a polyhedron corresponds to a line on a suitable net for the subset of faces touched by the path. The net has to be such that the line is fully within it. Other candidates for the shortest path are through the surface of a third face adjacent to both, and corresponding nets can be used to find the shortest path in each category, the geometric concept of a net can be extended to higher dimensions. The above net of the tesseract, the hypercube, is used prominently in a painting by Salvador Dalí. However, it is known to be possible for every convex uniform 4-polytope, Paper model Cardboard modeling UV mapping Weisstein, Eric W. Net. Regular 4d Polytope Foldouts Editable Printable Polyhedral Nets with an Interactive 3D View Paper Models of Polyhedra Unfolder for Blender Unfolding package for Mathematica
15.
Geometry
–
Geometry is a branch of mathematics concerned with questions of shape, size, relative position of figures, and the properties of space. A mathematician who works in the field of geometry is called a geometer, Geometry arose independently in a number of early cultures as a practical way for dealing with lengths, areas, and volumes. Geometry began to see elements of mathematical science emerging in the West as early as the 6th century BC. By the 3rd century BC, geometry was put into a form by Euclid, whose treatment, Euclids Elements. Geometry arose independently in India, with texts providing rules for geometric constructions appearing as early as the 3rd century BC, islamic scientists preserved Greek ideas and expanded on them during the Middle Ages. By the early 17th century, geometry had been put on a solid footing by mathematicians such as René Descartes. Since then, and into modern times, geometry has expanded into non-Euclidean geometry and manifolds, while geometry has evolved significantly throughout the years, there are some general concepts that are more or less fundamental to geometry. These include the concepts of points, lines, planes, surfaces, angles, contemporary geometry has many subfields, Euclidean geometry is geometry in its classical sense. The mandatory educational curriculum of the majority of nations includes the study of points, lines, planes, angles, triangles, congruence, similarity, solid figures, circles, Euclidean geometry also has applications in computer science, crystallography, and various branches of modern mathematics. Differential geometry uses techniques of calculus and linear algebra to problems in geometry. It has applications in physics, including in general relativity, topology is the field concerned with the properties of geometric objects that are unchanged by continuous mappings. In practice, this often means dealing with large-scale properties of spaces, convex geometry investigates convex shapes in the Euclidean space and its more abstract analogues, often using techniques of real analysis. It has close connections to convex analysis, optimization and functional analysis, algebraic geometry studies geometry through the use of multivariate polynomials and other algebraic techniques. It has applications in areas, including cryptography and string theory. Discrete geometry is concerned mainly with questions of relative position of simple objects, such as points. It shares many methods and principles with combinatorics, Geometry has applications to many fields, including art, architecture, physics, as well as to other branches of mathematics. The earliest recorded beginnings of geometry can be traced to ancient Mesopotamia, the earliest known texts on geometry are the Egyptian Rhind Papyrus and Moscow Papyrus, the Babylonian clay tablets such as Plimpton 322. For example, the Moscow Papyrus gives a formula for calculating the volume of a truncated pyramid, later clay tablets demonstrate that Babylonian astronomers implemented trapezoid procedures for computing Jupiters position and motion within time-velocity space
16.
Hexagon
–
In geometry, a hexagon is a six sided polygon or 6-gon. The total of the angles of any hexagon is 720°. A regular hexagon has Schläfli symbol and can also be constructed as an equilateral triangle, t. A regular hexagon is defined as a hexagon that is both equilateral and equiangular and it is bicentric, meaning that it is both cyclic and tangential. The common length of the sides equals the radius of the circumscribed circle, all internal angles are 120 degrees. A regular hexagon has 6 rotational symmetries and 6 reflection symmetries, the longest diagonals of a regular hexagon, connecting diametrically opposite vertices, are twice the length of one side. Like squares and equilateral triangles, regular hexagons fit together without any gaps to tile the plane, the cells of a beehive honeycomb are hexagonal for this reason and because the shape makes efficient use of space and building materials. The Voronoi diagram of a triangular lattice is the honeycomb tessellation of hexagons. It is not usually considered a triambus, although it is equilateral, the maximal diameter, D is twice the maximal radius or circumradius, R, which equals the side length, t. The minimal diameter or the diameter of the circle, d, is twice the minimal radius or inradius. If a regular hexagon has successive vertices A, B, C, D, E, F, the regular hexagon has Dih6 symmetry, order 12. There are 3 dihedral subgroups, Dih3, Dih2, and Dih1, and 4 cyclic subgroups, Z6, Z3, Z2 and these symmetries express 9 distinct symmetries of a regular hexagon. John Conway labels these by a letter and group order, r12 is full symmetry, and a1 is no symmetry. These two forms are duals of each other and have half the order of the regular hexagon. The i4 forms are regular hexagons flattened or stretched along one symmetry direction and it can be seen as an elongated rhombus, while d2 and p2 can be seen as horizontally and vertically elongated kites. G2 hexagons, with sides parallel are also called hexagonal parallelogons. Each subgroup symmetry allows one or more degrees of freedom for irregular forms, only the g6 subgroup has no degrees of freedom but can seen as directed edges. Hexagons of symmetry g2, i4, and r12, as parallelogons can tessellate the Euclidean plane by translation, other hexagon shapes can tile the plane with different orientations
17.
Equilateral triangle
–
In geometry, an equilateral triangle is a triangle in which all three sides are equal. In the familiar Euclidean geometry, equilateral triangles are also equiangular and they are regular polygons, and can therefore also be referred to as regular triangles. Thus these are properties that are unique to equilateral triangles, the three medians have equal lengths. The three angle bisectors have equal lengths, every triangle center of an equilateral triangle coincides with its centroid, which implies that the equilateral triangle is the only triangle with no Euler line connecting some of the centers. For some pairs of triangle centers, the fact that they coincide is enough to ensure that the triangle is equilateral, in particular, A triangle is equilateral if any two of the circumcenter, incenter, centroid, or orthocenter coincide. It is also equilateral if its circumcenter coincides with the Nagel point, for any triangle, the three medians partition the triangle into six smaller triangles. A triangle is equilateral if and only if any three of the triangles have either the same perimeter or the same inradius. A triangle is equilateral if and only if the circumcenters of any three of the triangles have the same distance from the centroid. Morleys trisector theorem states that, in any triangle, the three points of intersection of the adjacent angle trisectors form an equilateral triangle, a version of the isoperimetric inequality for triangles states that the triangle of greatest area among all those with a given perimeter is equilateral. That is, PA, PB, and PC satisfy the inequality that any two of them sum to at least as great as the third. By Eulers inequality, the triangle has the smallest ratio R/r of the circumradius to the inradius of any triangle, specifically. The triangle of largest area of all those inscribed in a circle is equilateral. The ratio of the area of the incircle to the area of an equilateral triangle, the ratio of the area to the square of the perimeter of an equilateral triangle,1123, is larger than that for any other triangle. If a segment splits an equilateral triangle into two regions with equal perimeters and with areas A1 and A2, then 79 ≤ A1 A2 ≤97, in no other triangle is there a point for which this ratio is as small as 2. For any point P in the plane, with p, q, and t from the vertices A, B. For any point P on the circle of an equilateral triangle, with distances p, q. There are numerous triangle inequalities that hold with equality if and only if the triangle is equilateral, an equilateral triangle is the most symmetrical triangle, having 3 lines of reflection and rotational symmetry of order 3 about its center. Its symmetry group is the group of order 6 D3
18.
Truncation (geometry)
–
In geometry, a truncation is an operation in any dimension that cuts polytope vertices, creating a new facet in place of each vertex. The term originates from Keplers names for the Archimedean solids, in general any polyhedron can also be truncated with a degree of freedom as to how deep the cut is, as shown in Conway polyhedron notation truncation operation. A special kind of truncation, usually implied, is a uniform truncation, there are no degrees of freedom, and it represents a fixed geometric, just like the regular polyhedra. In general all single ringed uniform polytopes have a uniform truncation, for example, the icosidodecahedron, represented as Schläfli symbols r or, and Coxeter-Dynkin diagram or has a uniform truncation, the truncated icosidodecahedron, represented as tr or t. In the Coxeter-Dynkin diagram, the effect of a truncation is to ring all the adjacent to the ringed node. A truncated n-sided polygon will have 2n sides, a regular polygon uniformly truncated will become another regular polygon, t is. A complete truncation, r, is another regular polygon in its dual position, a regular polygon can also be represented by its Coxeter-Dynkin diagram, and its uniform truncation, and its complete truncation. Star polygons can also be truncated, a truncated pentagram will look like a pentagon, but is actually a double-covered decagon with two sets of overlapping vertices and edges. A truncated great heptagram gives a tetradecagram and this sequence shows an example of the truncation of a cube, using four steps of a continuous truncating process between a full cube and a rectified cube. The final polyhedron is a cuboctahedron, the middle image is the uniform truncated cube. It is represented by a Schläfli symbol t, a bitruncation is a deeper truncation, removing all the original edges, but leaving an interior part of the original faces. The truncated octahedron is a cube, 2t is an example. A complete bitruncation is called a birectification that reduces original faces to points, for polyhedra, this becomes the dual polyhedron. An octahedron is a birectification of the cube, = 2r is an example, another type of truncation is called cantellation, cuts edge and vertices, removing original edges and replacing them with rectangles. Higher dimensional polytopes have higher truncations, runcination cuts faces, edges, in 5-dimensions sterication cuts cells, faces, and edges. Edge-truncation is a beveling or chamfer for polyhedra, similar to cantellation but retains original vertices, in 4-polytopes edge-truncation replaces edges with elongated bipyramid cells. Alternation or partial truncation only removes some of the original vertices, a partial truncation or alternation - Half of the vertices and connecting edges are completely removed. The operation only applies to polytopes with even-sided faces, faces are reduced to half as many sides, and square faces degenerate into edges
19.
Tetrahedron
–
In geometry, a tetrahedron, also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertex corners. The tetrahedron is the simplest of all the ordinary convex polyhedra, the tetrahedron is the three-dimensional case of the more general concept of a Euclidean simplex. The tetrahedron is one kind of pyramid, which is a polyhedron with a polygon base. In the case of a tetrahedron the base is a triangle, like all convex polyhedra, a tetrahedron can be folded from a single sheet of paper. For any tetrahedron there exists a sphere on which all four vertices lie, a regular tetrahedron is one in which all four faces are equilateral triangles. It is one of the five regular Platonic solids, which have known since antiquity. In a regular tetrahedron, not only are all its faces the same size and shape, regular tetrahedra alone do not tessellate, but if alternated with regular octahedra they form the alternated cubic honeycomb, which is a tessellation. The regular tetrahedron is self-dual, which means that its dual is another regular tetrahedron, the compound figure comprising two such dual tetrahedra form a stellated octahedron or stella octangula. This form has Coxeter diagram and Schläfli symbol h, the tetrahedron in this case has edge length 2√2. Inverting these coordinates generates the dual tetrahedron, and the together form the stellated octahedron. In other words, if C is the centroid of the base and this follows from the fact that the medians of a triangle intersect at its centroid, and this point divides each of them in two segments, one of which is twice as long as the other. The vertices of a cube can be grouped into two groups of four, each forming a regular tetrahedron, the symmetries of a regular tetrahedron correspond to half of those of a cube, those that map the tetrahedra to themselves, and not to each other. The tetrahedron is the only Platonic solid that is not mapped to itself by point inversion, the regular tetrahedron has 24 isometries, forming the symmetry group Td, isomorphic to the symmetric group, S4. The first corresponds to the A2 Coxeter plane, the two skew perpendicular opposite edges of a regular tetrahedron define a set of parallel planes. When one of these intersects the tetrahedron the resulting cross section is a rectangle. When the intersecting plane is one of the edges the rectangle is long. When halfway between the two edges the intersection is a square, the aspect ratio of the rectangle reverses as you pass this halfway point. For the midpoint square intersection the resulting boundary line traverses every face of the tetrahedron similarly, if the tetrahedron is bisected on this plane, both halves become wedges
20.
Rectification (geometry)
–
In Euclidean geometry, rectification or complete-truncation is the process of truncating a polytope by marking the midpoints of all its edges, and cutting off its vertices at those points. The resulting polytope will be bounded by vertex figure facets and the facets of the original polytope. A rectification operator is denoted by the symbol r, for example, r is the rectified cube. Conway polyhedron notation uses ambo for this operator, in graph theory this operation creates a medial graph. Rectification is the point of a truncation process. The highest degree of rectification creates the dual polytope, a rectification truncates edges to points. A birectification truncates faces to points, a trirectification truncates cells to points, and so on. New vertices are placed at the center of the edges of the original polygon, each platonic solid and its dual have the same rectified polyhedron. The rectified polyhedron turns out to be expressible as the intersection of the original platonic solid with an appropriated scaled concentric version of its dual, the rectified octahedron, whose dual is the cube, is the cuboctahedron. The rectified icosahedron, whose dual is the dodecahedron, is the icosidodecahedron, a rectified square tiling is a square tiling. A rectified triangular tiling or hexagonal tiling is a trihexagonal tiling, examples If a polyhedron is not regular, the edge midpoints surrounding a vertex may not be coplanar. The resulting medial graph remains polyhedral, so by Steinitzs theorem it can be represented as a polyhedron, the Conway polyhedron notation equivalent to rectification is ambo, represented by a. Applying twice aa, is Conways expand operation, e, which is the same as Johnsons cantellation operation, t0,2 generated from regular polyhedral, each Convex regular 4-polytope has a rectified form as a uniform 4-polytope. Its rectification will have two types, a rectified polyhedron left from the original cells and polyhedron as new cells formed by each truncated vertex. A rectified is not the same as a rectified, however, a further truncation, called bitruncation, is symmetric between a 4-polytope and its dual. Examples A first rectification truncates edges down to points, If a polytope is regular, this form is represented by an extended Schläfli symbol notation t1 or r. A second rectification, or birectification, truncates faces down to points, If regular it has notation t2 or 2r. For polyhedra, a birectification creates a dual polyhedron, higher degree rectifications can be constructed for higher dimensional polytopes
21.
Octahedron
–
In geometry, an octahedron is a polyhedron with eight faces, twelve edges, and six vertices. A regular octahedron is a Platonic solid composed of eight equilateral triangles, a regular octahedron is the dual polyhedron of a cube. It is a square bipyramid in any of three orthogonal orientations and it is also a triangular antiprism in any of four orientations. An octahedron is the case of the more general concept of a cross polytope. A regular octahedron is a 3-ball in the Manhattan metric, the second and third correspond to the B2 and A2 Coxeter planes. The octahedron 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. An octahedron with edge length √2 can be placed with its center at the origin and its vertices on the coordinate axes, the Cartesian coordinates of the vertices are then. In an x–y–z Cartesian coordinate system, the octahedron with center coordinates, additionally the inertia tensor of the stretched octahedron is I =. These reduce to the equations for the regular octahedron when x m = y m = z m = a 22, the interior of the compound of two dual tetrahedra is an octahedron, and this compound, called the stella octangula, is its first and only stellation. Correspondingly, an octahedron is the result of cutting off from a regular tetrahedron. One can also divide the edges of an octahedron in the ratio of the mean to define the vertices of an icosahedron. There are five octahedra that define any given icosahedron in this fashion, octahedra and tetrahedra can be alternated to form a vertex, edge, and face-uniform tessellation of space, called the octet truss by Buckminster Fuller. This is the only such tiling save the regular tessellation of cubes, another is a tessellation of octahedra and cuboctahedra. The octahedron is unique among the Platonic solids in having a number of faces meeting at each vertex. Consequently, it is the member of that group to possess mirror planes that do not pass through any of the faces. Using the standard nomenclature for Johnson solids, an octahedron would be called a square bipyramid, truncation of two opposite vertices results in a square bifrustum. The octahedron is 4-connected, meaning that it takes the removal of four vertices to disconnect the remaining vertices and it is one of only four 4-connected simplicial well-covered polyhedra, meaning that all of the maximal independent sets of its vertices have the same size
22.
Goldberg polyhedron
–
A Goldberg polyhedron is a convex polyhedron made from hexagons and pentagons. They were first described by Michael Goldberg in 1937 and they are defined by three properties, each face is either a pentagon or hexagon, exactly three faces meet at each vertex, they have rotational icosahedral symmetry. They are not necessarily mirror-symmetric, e. g. GP and GP are enantiomorphs of each other, a consequence of Eulers polyhedron formula is that there will be exactly twelve pentagons. Icosahedral symmetry ensures that the pentagons are always regular, although many of the hexagons may not be, typically all of the vertices lie on a sphere, but they can also be computed as equilateral. It is a polyhedron of a geodesic sphere, with all triangle faces and 6 triangles per vertex. Simple examples of Goldberg polyhedra include the dodecahedron and truncated icosahedron, other forms can be described by taking a chess knight move from one pentagon to the next, first take m steps in one direction, then turn 60° to the left and take n steps. Such a polyhedron is denoted GP, a dodecahedron is GP and a truncated icosahedron is GP. A similar technique can be applied to polyhedra with tetrahedral symmetry. These polyhedra will have triangles or squares rather than pentagons and these variations are given Roman numeral subscripts, GPIII, GPIV, and GPV. The chamfer operator, c, replaces all edges by hexagons, transforming GP to GP, the truncated kis operator, y=tk, generates GP, transforming GP to GP, with a T multiplier of 9. For class 2 forms, the dual kis operator, z=dk, transforms GP into GP, for class 3 forms, the whirl operator, w, generates GP, with a T multiplier of 7. A clockwise and counterclockwise whirl generator, ww=wrw generates GP in class 1, in general, a whirl can transform a GP into GP for a>b and the same chiral direction. If chiral directions are reversed, GP becomes GP if a>=2b, capsid Geodesic sphere Fullerene#Other buckyballs Conway polyhedron notation Goldberg, Michael. Joseph D. Clinton, Clinton’s Equal Central Angle Conjecture Hart, George
23.
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
24.
Volume
–
Volume is the quantity of three-dimensional space enclosed by a closed surface, for example, the space that a substance or shape occupies or contains. Volume is often quantified numerically using the SI derived unit, the cubic metre, three dimensional mathematical shapes are also assigned volumes. Volumes of some simple shapes, such as regular, straight-edged, Volumes of a complicated shape can be calculated by integral calculus if a formula exists for the shapes boundary. Where a variance in shape and volume occurs, such as those that exist between different human beings, these can be calculated using techniques such as the Body Volume Index. One-dimensional figures and two-dimensional shapes are assigned zero volume in the three-dimensional space, the volume of a solid can be determined by fluid displacement. Displacement of liquid can also be used to determine the volume of a gas, the combined volume of two substances is usually greater than the volume of one of the substances. However, sometimes one substance dissolves in the other and the volume is not additive. In differential geometry, volume is expressed by means of the volume form, in thermodynamics, volume is a fundamental parameter, and is a conjugate variable to pressure. Any unit of length gives a unit of volume, the volume of a cube whose sides have the given length. For example, a cubic centimetre is the volume of a cube whose sides are one centimetre in length, in the International System of Units, the standard unit of volume is the cubic metre. The metric system also includes the litre as a unit of volume, thus 1 litre =3 =1000 cubic centimetres =0.001 cubic metres, so 1 cubic metre =1000 litres. Small amounts of liquid are often measured in millilitres, where 1 millilitre =0.001 litres =1 cubic centimetre. Capacity is defined by the Oxford English Dictionary as the applied to the content of a vessel, and to liquids, grain, or the like. Capacity is not identical in meaning to volume, though closely related, Units of capacity are the SI litre and its derived units, and Imperial units such as gill, pint, gallon, and others. Units of volume are the cubes of units of length, in SI the units of volume and capacity are closely related, one litre is exactly 1 cubic decimetre, the capacity of a cube with a 10 cm side. In other systems the conversion is not trivial, the capacity of a fuel tank is rarely stated in cubic feet, for example. The density of an object is defined as the ratio of the mass to the volume, the inverse of density is specific volume which is defined as volume divided by mass. Specific volume is an important in thermodynamics where the volume of a working fluid is often an important parameter of a system being studied
25.
Monte Carlo method
–
Monte Carlo methods are a broad class of computational algorithms that rely on repeated random sampling to obtain numerical results. Their essential idea is using randomness to solve problems that might be deterministic in principle and they are often used in physical and mathematical problems and are most useful when it is difficult or impossible to use other approaches. Monte Carlo methods are used in three distinct problem classes, optimization, numerical integration, and generating draws from a probability distribution. In principle, Monte Carlo methods can be used to any problem having a probabilistic interpretation. By the law of numbers, integrals described by the expected value of some random variable can be approximated by taking the empirical mean of independent samples of the variable. When the probability distribution of the variable is parametrized, mathematicians often use a Markov Chain Monte Carlo sampler, the central idea is to design a judicious Markov chain model with a prescribed stationary probability distribution. That is, in the limit, the samples being generated by the MCMC method will be samples from the desired distribution, by the ergodic theorem, the stationary distribution is approximated by the empirical measures of the random states of the MCMC sampler. In other problems, the objective is generating draws from a sequence of probability distributions satisfying a nonlinear evolution equation, in other instances we are given a flow of probability distributions with an increasing level of sampling complexity. These models can also be seen as the evolution of the law of the states of a nonlinear Markov chain. In contrast with traditional Monte Carlo and Markov chain Monte Carlo methodologies these mean field particle techniques rely on sequential interacting samples, the terminology mean field reflects the fact that each of the samples interacts with the empirical measures of the process. Monte Carlo methods vary, but tend to follow a particular pattern, generate inputs randomly from a probability distribution over the domain. Perform a deterministic computation on the inputs, for example, consider a circle inscribed in a unit square. Given that the circle and the square have a ratio of areas that is π/4, uniformly scatter objects of uniform size over the square. Count the number of objects inside the circle and the number of objects. The ratio of the two counts is an estimate of the ratio of the two areas, which is π/4, multiply the result by 4 to estimate π. In this procedure the domain of inputs is the square that circumscribes our circle and we generate random inputs by scattering grains over the square then perform a computation on each input. Finally, we aggregate the results to obtain our final result, there are two important points to consider here, Firstly, if the grains are not uniformly distributed, then our approximation will be poor. Secondly, there should be a number of inputs
26.
Cartesian coordinates
–
Each reference line is called a coordinate axis or just axis of the system, and the point where they meet is its origin, usually at ordered pair. The coordinates can also be defined as the positions of the projections of the point onto the two axis, expressed as signed distances from the origin. One can use the principle to specify the position of any point in three-dimensional space by three Cartesian coordinates, its signed distances to three mutually perpendicular planes. In general, n Cartesian coordinates specify the point in an n-dimensional Euclidean space for any dimension n and these coordinates are equal, up to sign, to distances from the point to n mutually perpendicular hyperplanes. The invention of Cartesian coordinates in the 17th century by René Descartes revolutionized mathematics by providing the first systematic link between Euclidean geometry and algebra. Using the Cartesian coordinate system, geometric shapes can be described by Cartesian equations, algebraic equations involving the coordinates of the points lying on the shape. For example, a circle of radius 2, centered at the origin of the plane, a familiar example is the concept of the graph of a function. Cartesian coordinates are also tools for most applied disciplines that deal with geometry, including astronomy, physics, engineering. They are the most common system used in computer graphics, computer-aided geometric design. Nicole Oresme, a French cleric and friend of the Dauphin of the 14th Century, used similar to Cartesian coordinates well before the time of Descartes. The adjective Cartesian refers to the French mathematician and philosopher René Descartes who published this idea in 1637 and it was independently discovered by Pierre de Fermat, who also worked in three dimensions, although Fermat did not publish the discovery. Both authors used a single axis in their treatments and have a length measured in reference to this axis. The concept of using a pair of axes was introduced later, after Descartes La Géométrie was translated into Latin in 1649 by Frans van Schooten and these commentators introduced several concepts while trying to clarify the ideas contained in Descartes work. Many other coordinate systems have developed since Descartes, such as the polar coordinates for the plane. The development of the Cartesian coordinate system would play a role in the development of the Calculus by Isaac Newton. The two-coordinate description of the plane was later generalized into the concept of vector spaces. Choosing a Cartesian coordinate system for a one-dimensional space – that is, for a straight line—involves choosing a point O of the line, a unit of length, and an orientation for the line. An orientation chooses which of the two half-lines determined by O is the positive, and which is negative, we say that the line is oriented from the negative half towards the positive half
27.
Projection (linear algebra)
–
In linear algebra and functional analysis, a projection is a linear transformation P from a vector space to itself such that P2 = P. That is, whenever P is applied twice to any value, though abstract, this definition of projection formalizes and generalizes the idea of graphical projection. One can also consider the effect of a projection on an object by examining the effect of the projection on points in the object. For example, the function maps the point in three-dimensional space R3 to the point is an orthogonal projection onto the x–y plane. This function is represented by the matrix P =, the action of this matrix on an arbitrary vector is P =. To see that P is indeed a projection, i. e. P = P2, a simple example of a non-orthogonal projection is P =. Via matrix multiplication, one sees that P2 = = = P. proving that P is indeed a projection, the projection P is orthogonal if and only if α =0. Let W be a finite dimensional space and P be a projection on W. Suppose the subspaces U and V are the range and kernel of P respectively, then P has the following properties, By definition, P is idempotent. P is the identity operator I on U ∀ x ∈ U, P x = x and we have a direct sum W = U ⊕ V. Every vector x ∈ W may be decomposed uniquely as x = u + v with u = P x and v = x − P x = x, the range and kernel of a projection are complementary, as are P and Q = I − P. The operator Q is also a projection and the range and kernel of P become the kernel and range of Q and we say P is a projection along V onto U and Q is a projection along U onto V. In infinite dimensional spaces, the spectrum of a projection is contained in as −1 =1 λ I +1 λ P. Only 0 or 1 can be an eigenvalue of a projection, the corresponding eigenspaces are the kernel and range of the projection. Decomposition of a space into direct sums is not unique in general. Therefore, given a subspace V, there may be many projections whose range is V, if a projection is nontrivial it has minimal polynomial x 2 − x = x, which factors into distinct roots, and thus P is diagonalizable. The product of projections is not, in general, a projection, if projections commute, then their product is a projection. When the vector space W has a product and is complete the concept of orthogonality can be used
28.
Minimum bounding box
–
In geometry, the minimum or smallest bounding or enclosing box for a point set in N dimensions is the box with the smallest measure within which all the points lie. When other kinds of measure are used, the box is usually called accordingly. The minimum bounding box of a point set is the same as the bounding box of its convex hull. The term box/hyperrectangle comes from its usage in the Cartesian coordinate system, in the two-dimensional case it is called the minimum bounding rectangle. The axis-aligned minimum bounding box for a point set is its minimum bounding box subject to the constraint that the edges of the box are parallel to the coordinate axes. For example, in geometry and its applications when it is required to find intersections in the set of objects. Since it is usually a less expensive operation than the check of the actual intersection. The arbitrarily oriented minimum bounding box is the minimum bounding box, a three-dimensional rotating calipers algorithm can find the minimum-volume arbitrarily-oriented bounding box of a three-dimensional point set in cubic time. Bounding sphere Bounding volume Minimum bounding rectangle
29.
Polytope compound
–
A polyhedral compound is a figure that is composed of several polyhedra sharing a common centre. They are the analogs of polygonal compounds such as the hexagram. The outer vertices of a compound can be connected to form a convex polyhedron called the convex hull, the compound is a facetting of the convex hull. Another convex polyhedron is formed by the central space common to all members of the compound. This polyhedron can be used as the core for a set of stellations, a regular polyhedron compound can be defined as a compound which, like a regular polyhedron, is vertex-transitive, edge-transitive, and face-transitive. There are five regular compounds of polyhedra, best known is the compound of two tetrahedra, often called the stella octangula, a name given to it by Kepler. The vertices of the two tetrahedra define a cube and the intersection of the two an octahedron, which shares the same face-planes as the compound, thus it is a stellation of the octahedron, and in fact, the only finite stellation thereof. The stella octangula can also be regarded as a dual-regular compound, the compound of five tetrahedra comes in two enantiomorphic versions, which together make up the compound of 10 tetrahedra. Each of the compounds is self-dual, and the compound of 5 cubes is dual to the compound of 5 octahedra. There are five such compounds of the regular polyhedra, the tetrahedron is self-dual, so the dual compound of a tetrahedron with its dual polyhedron is also the regular Stella octangula. The cube-octahedron and dodecahedron-icosahedron dual compounds are the first stellations of the cuboctahedron and icosidodecahedron, the compound of the small stellated dodecahedron and great dodecahedron looks outwardly the same as the small stellated dodecahedron, because the great dodecahedron is completely contained inside. For this reason, the image shown above shows the small stellated dodecahedron in wireframe, in 1976 John Skilling published Uniform Compounds of Uniform Polyhedra which enumerated 75 compounds made from uniform polyhedra with rotational symmetry. This list includes the five regular compounds above, the 75 uniform compounds are listed in the Table below. Most are shown singularly colored by each polyhedron element, some chiral pairs of face groups are colored by symmetry of the faces within each polyhedron. If the definition of a polyhedron is generalised they are uniform. The section for entianomorphic pairs in Skillings list does not contain the compound of two great snub dodecicosidodecahedra, as the faces would coincide. Removing the coincident faces results in the compound of twenty octahedra, in 4-dimensions, there are a large number of regular compounds of regular polytopes. There are eighteen two-parameter families of regular tessellations of the Euclidean plane
30.
Truncated 16-cell
–
In geometry, a truncated tesseract is a uniform 4-polytope formed as the truncation of the regular tesseract. There are three truncations, including a bitruncation, and a tritruncation, which creates the truncated 16-cell, the truncated tesseract is bounded by 24 cells,8 truncated cubes, and 16 tetrahedra. Truncated tesseract Truncated tesseract The truncated tesseract may be constructed by truncating the vertices of the tesseract at 1 / of the edge length, a regular tetrahedron is formed at each truncated vertex. Two of the cube cells project onto a truncated cube inscribed in the cubical envelope. The other 6 truncated cubes project onto the faces of the envelope. The 8 tetrahedral volumes between the envelope and the faces of the central truncated cube are the images of the 16 tetrahedra. It can also be called a runcicantic tesseract with half the vertices of a runcicantellated tesseract with a construction, Bitruncated tesseract/Runcicantic tesseract Bitruncated tesseract A tesseract is bitruncated by truncating its cells beyond their midpoints, turning the eight cubes into eight truncated octahedra. These still share their square faces, but the hexagonal faces form truncated tetrahedra which share their triangular faces with each other, the truncated tetrahedra are connected to each other via their triangular faces. The truncated-octahedron-first projection of the bitruncated tesseract into 3D space has a cubical envelope. Two of the octahedral cells project onto a truncated octahedron inscribed in this envelope. The 6 octahedral faces are the images of the remaining 6 truncated octahedral cells, the remaining gap between the inscribed truncated octahedron and the envelope are filled by 8 flattened truncated tetrahedra, each of which is the image of a pair of truncated tetrahedral cells. It has half the vertices of a cantellated tesseract with construction and it is related to, but not to be confused with, the 24-cell, which is a regular 4-polytope bounded by 24 regular octahedra. Truncated 16-cell/Cantic tesseract Truncated hexadecachoron The truncated 16-cell may be constructed from the 16-cell by truncating its vertices at 1/3 of the edge length and this results in the 16 truncated tetrahedral cells, and introduces the 8 octahedra. The truncated tetrahedra are joined to each other via their hexagonal faces, the octahedra are joined to the truncated tetrahedra via their triangular faces. The octahedron-first parallel projection of the truncated 16-cell into 3-dimensional space has the following structure, the 6 square faces of the envelope are the images of 6 of the octahedral cells. An octahedron lies at the center of the envelope, joined to the center of the 6 square faces by 6 edges and this is the image of the other 2 octahedral cells. The remaining space between the envelope and the octahedron is filled by 8 truncated tetrahedra. These are the images of the 16 truncated tetrahedral cells, a pair of cells to each image and this layout of cells in projection is analogous to the layout of faces in the projection of the truncated octahedron into 2-dimensional space
31.
Spherical tiling
–
In mathematics, a spherical polyhedron or spherical tiling is a tiling of the sphere in which the surface is divided or partitioned by great arcs into bounded regions called spherical polygons. Much of the theory of polyhedra is most conveniently derived in this way. The most familiar spherical polyhedron is the ball, thought of as a spherical truncated icosahedron. The next most popular spherical polyhedron is the ball, thought of as a hosohedron. Some improper polyhedra, such as the hosohedra and their duals the dihedra, in the examples below, is a hosohedron and is the dual dihedron. The first known man-made polyhedra are spherical polyhedra carved in stone, many have been found in Scotland, and appear to date from the neolithic period. During the European Dark Age, the Islamic scholar Abū al-Wafā Būzjānī wrote the first serious study of spherical polyhedra, two hundred years ago, at the start of the 19th Century, Poinsot used spherical polyhedra to discover the four regular star polyhedra. In the middle of the 20th Century, Coxeter used them to all but one of the uniform polyhedra. All the regular, semiregular polyhedra and their duals can be projected onto the sphere as tilings, given by their Schläfli symbol or vertex figure a. b. c. Spherical tilings allow cases that polyhedra do not, namely the hosohedra, regular figures as, and dihedra, regular figures as
32.
Stereographic projection
–
In geometry, the stereographic projection is a particular mapping that projects a sphere onto a plane. The projection is defined on the sphere, except at one point. Where it is defined, the mapping is smooth and bijective and it is conformal, meaning that it preserves angles. It is neither isometric nor area-preserving, that is, it preserves neither distances nor the areas of figures, intuitively, then, the stereographic projection is a way of picturing the sphere as the plane, with some inevitable compromises. In practice, the projection is carried out by computer or by using a special kind of graph paper called a stereographic net, shortened to stereonet. The stereographic projection was known to Hipparchus, Ptolemy and probably earlier to the Egyptians and it was originally known as the planisphere projection. Planisphaerium by Ptolemy is the oldest surviving document that describes it, one of its most important uses was the representation of celestial charts. The term planisphere is still used to refer to such charts, in the 16th and 17th century, the equatorial aspect of the stereographic projection was commonly used for maps of the Eastern and Western Hemispheres. It is believed that already the map created in 1507 by Gualterius Lud was in stereographic projection, as were later the maps of Jean Roze, Rumold Mercator, in star charts, even this equatorial aspect had been utilised already by the ancient astronomers like Ptolemy. François dAguilon gave the stereographic projection its current name in his 1613 work Opticorum libri sex philosophis juxta ac mathematicis utiles, in 1695, Edmond Halley, motivated by his interest in star charts, published the first mathematical proof that this map is conformal. He used the recently established tools of calculus, invented by his friend Isaac Newton and this section focuses on the projection of the unit sphere from the north pole onto the plane through the equator. Other formulations are treated in later sections, the unit sphere in three-dimensional space R3 is the set of points such that x2 + y2 + z2 =1. Let N = be the pole, and let M be the rest of the sphere. The plane z =0 runs through the center of the sphere, for any point P on M, there is a unique line through N and P, and this line intersects the plane z =0 in exactly one point P′. Define the stereographic projection of P to be this point P′ in the plane, in Cartesian coordinates on the sphere and on the plane, the projection and its inverse are given by the formulas =, =. In spherical coordinates on the sphere and polar coordinates on the plane, here, φ is understood to have value π when R =0. Also, there are ways to rewrite these formulas using trigonometric identities. In cylindrical coordinates on the sphere and polar coordinates on the plane, the projection is not defined at the projection point N =
33.
Conformal map
–
In mathematics, a conformal map is a function that preserves angles locally. In the most common case, the function has a domain, more formally, let U and V be subsets of C n. A function f, U → V is called conformal at a point u 0 ∈ U if it preserves oriented angles between curves through u 0 with respect to their orientation. Conformal maps preserve both angles and the shapes of small figures, but not necessarily their size or curvature. The conformal property may be described in terms of the Jacobian derivative matrix of a coordinate transformation, if the Jacobian matrix of the transformation is everywhere a scalar times a rotation matrix, then the transformation is conformal. Conformal maps can be defined between domains in higher-dimensional Euclidean spaces, and more generally on a Riemannian or semi-Riemannian manifold, an important family of examples of conformal maps comes from complex analysis. If U is a subset of the complex plane C, then a function f, U → C is conformal if and only if it is holomorphic. If f is antiholomorphic, it preserves angles, but it reverses their orientation. In the literature, there is another definition of conformal maps, since a one-to-one map defined on a non-empty open set cannot be constant, the open mapping theorem forces the inverse function to be holomorphic. Thus, under this definition, a map is conformal if, the two definitions for conformal maps are not equivalent. Being one-to-one and holomorphic implies having a non-zero derivative, however, the exponential function is a holomorphic function with a nonzero derivative, but is not one-to-one since it is periodic. A map of the complex plane onto itself is conformal if. Again, for the conjugate, angles are preserved, but orientation is reversed, an example of the latter is taking the reciprocal of the conjugate, which corresponds to circle inversion with respect to the unit circle. This can also be expressed as taking the reciprocal of the coordinate in circular coordinates. In Riemannian geometry, two Riemannian metrics g and h on smooth manifold M are called equivalent if g = u h for some positive function u on M. The function u is called the conformal factor, a diffeomorphism between two Riemannian manifolds is called a conformal map if the pulled back metric is conformally equivalent to the original one. For example, stereographic projection of a sphere onto the plane augmented with a point at infinity is a conformal map, one can also define a conformal structure on a smooth manifold, as a class of conformally equivalent Riemannian metrics. If a function is harmonic over a domain, and is transformed via a conformal map to another plane domain
34.
Triangle
–
A triangle is a polygon with three edges and three vertices. It is one of the shapes in geometry. A triangle with vertices A, B, and C is denoted △ A B C, in Euclidean geometry any three points, when non-collinear, determine a unique triangle and a unique plane. This article is about triangles in Euclidean geometry except where otherwise noted, triangles can be classified according to the lengths of their sides, An equilateral triangle has all sides the same length. An equilateral triangle is also a polygon with all angles measuring 60°. An isosceles triangle has two sides of equal length, some mathematicians define an isosceles triangle to have exactly two equal sides, whereas others define an isosceles triangle as one with at least two equal sides. The latter definition would make all equilateral triangles isosceles triangles, the 45–45–90 right triangle, which appears in the tetrakis square tiling, is isosceles. A scalene triangle has all its sides of different lengths, equivalently, it has all angles of different measure. Hatch marks, also called tick marks, are used in diagrams of triangles, a side can be marked with a pattern of ticks, short line segments in the form of tally marks, two sides have equal lengths if they are both marked with the same pattern. In a triangle, the pattern is no more than 3 ticks. Similarly, patterns of 1,2, or 3 concentric arcs inside the angles are used to indicate equal angles, triangles can also be classified according to their internal angles, measured here in degrees. A right triangle has one of its interior angles measuring 90°, the side opposite to the right angle is the hypotenuse, the longest side of the triangle. The other two sides are called the legs or catheti of the triangle, special right triangles are right triangles with additional properties that make calculations involving them easier. One of the two most famous is the 3–4–5 right triangle, where 32 +42 =52, in this situation,3,4, and 5 are a Pythagorean triple. The other one is a triangle that has 2 angles that each measure 45 degrees. Triangles that do not have an angle measuring 90° are called oblique triangles, a triangle with all interior angles measuring less than 90° is an acute triangle or acute-angled triangle. If c is the length of the longest side, then a2 + b2 > c2, a triangle with one interior angle measuring more than 90° is an obtuse triangle or obtuse-angled triangle. If c is the length of the longest side, then a2 + b2 < c2, a triangle with an interior angle of 180° is degenerate
35.
Disphenoid
–
In geometry, a disphenoid is a tetrahedron whose four faces are congruent acute-angled triangles. It can also be described as a tetrahedron in which two edges that are opposite each other have equal lengths. Other names for the shape are sphenoid, bisphenoid, isosceles tetrahedron, equifacial tetrahedron, almost regular tetrahedron. All the solid angles and vertex figures of a disphenoid are the same, however, a disphenoid is not a regular polyhedron, because, in general, its faces are not regular polygons, and its edges have three different lengths. If the faces of a disphenoid are equilateral triangles, it is a tetrahedron with Td tetrahedral symmetry. When the faces of a disphenoid are isosceles triangles, it is called a tetragonal disphenoid, in this case it has D2d dihedral symmetry. A sphenoid with scalene triangles as its faces is called a rhombic disphenoid, unlike the tetragonal disphenoid, the rhombic disphenoid has no reflection symmetry, so it is chiral. Both tetragonal disphenoids and rhombic disphenoids are isohedra, as well as being congruent to each other and it is not possible to construct a disphenoid with right triangle or obtuse triangle faces. When right triangles are glued together in the pattern of a disphenoid, two more types of tetrahedron generalize the disphenoid and have similar names. The digonal disphenoid has faces with two different shapes, both triangles, with two faces of each shape. The phyllic disphenoid similarly has faces with two shapes of scalene triangles, disphenoids can also be seen as digonal antiprisms or as alternated quadrilateral prisms. A tetrahedron is a if and only if its circumscribed parallelepiped is right-angled. We also have that a tetrahedron is a if and only if the center in the circumscribed sphere. The disphenoids are the polyhedra having infinitely many non-self-intersecting closed geodesics. On a disphenoid, all closed geodesics are non-self-intersecting and they are the polyhedra having a net in the shape of an acute triangle, divided into four similar triangles by segments connecting the edge midpoints. The volume of a disphenoid with opposite edges of length l, m and n is given by V =72. There is also the following interesting relation connecting the volume and the circumradius,16 T2 R2 = l 2 m 2 n 2 +9 V2, the squares of the lengths of the bimedians are 12,12,12. If the four faces of a tetrahedron have the same perimeter, if the four faces of a tetrahedron have the same area, then it is a disphenoid
36.
Expo 67
–
It is considered to be the most successful Worlds Fair of the 20th century with the most attendees to that date and 62 nations participating. It also set the attendance record for a worlds fair. Expo 67 was Canadas main celebration during its centennial year, the project was not well supported in Canada at first. It took the determination of Montreals mayor, Jean Drapeau, defying a computer analysis that said it could not be done, the fair opened on time. After Expo 67 ended in October 1967, the site and most of the continued on as an exhibition called Man and His World. By that time, most of the buildings — which had not been designed to last beyond the original exhibition — had deteriorated and were dismantled. Today, the islands hosted the world exhibition are mainly used as parkland and for recreational use. The exposition was offered first to Toronto but politicians there rejected the idea, however, Montreals mayor, Sarto Fournier, backed the proposal, allowing Canada to make a bid to the Bureau International des Expositions. At the BIEs May 5,1960 meeting in Paris, Moscow was awarded the fair after five rounds of voting that eliminated Austrias, in April 1962, the Soviets scrapped plans to host the fair because of financial constraints and security concerns. Montreals new mayor, Jean Drapeau, lobbied the Canadian government to try again for the fair, several sites were proposed as the main Expo grounds. One location that was considered was Mount Royal Park, to the north of the downtown core, but it was Drapeaus idea to create new islands in the St. Lawrence river, and to enlarge the existing Saint Helens Island. The choice overcame opposition from Montreals surrounding municipalities, and also prevented land speculation, Expo did not get off to a smooth start, in 1963, many top organizing committee officials resigned. Another more likely reason for the resignations was that on April 22,1963. Canadian diplomat Pierre Dupuy was named Commissioner General, after Diefenbaker appointee Paul Bienvenu resigned from the post in 1963, one of the main responsibilities of the Commissioner General was to attract other nations to build pavilions at Expo. Dupuy would spend most of 1964 and 1965 soliciting 125 countries, dupuys right-hand man was Robert Fletcher Shaw, the deputy commissioner general and vice-president of the corporation. He also replaced a Diefenbaker appointee, C. F, Shaw was a professional engineer and builder, and is widely credited for the total building of the Exhibition. Dupuy hired Andrew Kniewasser as the general manager, the management group became known as Les Durs - the tough guys - and they were in charge of creating, building and managing Expo. To this group the chief architect Édouard Fiset was added, all ten were honoured by the Canadian government as recipients of the Order of Canada, Companions for Dupuy and Shaw, Officers for the others
37.
Pyraminx
–
The Pyraminx is a regular tetrahedron puzzle in the style of Rubiks Cube. It was made and patented by Uwe Mèffert after the original 3 layered Rubiks Cube by Erno Rubik, the Pyraminx was first conceived by Mèffert in 1970. He did nothing with his design until 1981 when he first brought it to Hong Kong for production, Uwe is fond of saying had it not been for Erno Rubiks invention of the cube, his Pyraminx would have never been produced. The Pyraminx is a puzzle in the shape of a tetrahedron, divided into 4 axial pieces,6 edge pieces. It can be twisted along its cuts to permute its pieces, the axial pieces are octahedral in shape, although this is not immediately obvious, and can only rotate around the axis they are attached to. The 6 edge pieces can be freely permuted, the trivial tips are so called because they can be twisted independently of all other pieces, making them trivial to place in solved position. Meffert also produces a similar puzzle called the Tetraminx, which is the same as the Pyraminx except that the tips are removed. The purpose of the Pyraminx is to scramble the colors, and this leaves only the 6 edge pieces as a real challenge to the puzzle. They can be solved by applying two 4-twist sequences, which are mirror-image versions of each other. These sequences permute 3 edge pieces at a time, and change their orientation differently, however, more efficient solutions are generally available. The twist of any piece is independent of the other three, as is the case with the tips. The six edges can be placed in 6. /2 positions and flipped in 25 ways, multiplying this by the 38 factor for the axial pieces gives 75,582,720 possible positions. However, setting the trivial tips to the right positions reduces the possibilities to 933,120, setting the axial pieces as well reduces the figure to only 11,520, making this a rather simple puzzle to solve. The maximum number of required to solve the Pyraminx is 11. There are 933,120 different positions, a number that is small to allow a computer search for optimal solutions.32 seconds. He also holds the fastest average of 5 with 2.14 seconds at US Nationals 2016, there are many methods for solving a Pyraminx. They can be split up into two groups, 1) V first- In these methods, two or three edges, and not a side, is solved first, and a set of algorithms, also called LL algs, are given to solve the remaining puzzle. 2) Top first methods- In these methods a block on the top, b) L4E- L4E or last 4 edges is very similar to Layer by Layer
38.
Vertex (graph theory)
–
In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another. The two vertices forming an edge are said to be the endpoints of this edge, and the edge is said to be incident to the vertices, a vertex w is said to be adjacent to another vertex v if the graph contains an edge. The neighborhood of a v is an induced subgraph of the graph. The degree of a vertex, denoted
39.
Edge (graph theory)
–
This is a glossary of graph theory terms. Graph theory is the study of graphs, systems of nodes or vertices connected in pairs by edges, for instance, α is the independence number of a graph, α′ is the matching number of the graph, which equals the independence number of its line graph. Similarly, χ is the number of a graph, χ ′ is the chromatic index of the graph. Achromatic The achromatic number of a graph is the number of colors in a complete coloring. A graph is acyclic if it has no cycles, an acyclic undirected graph is the same thing as a forest. Acyclic directed graphs are often called directed acyclic graphs. An acyclic coloring of a graph is a proper coloring in which every two color classes induce a forest. Adjacent The relation between two vertices that are both endpoints of the same edge, α For a graph G, α is its independence number, and α′ is its matching number. Alternating In a graph with a matching, a path is a path whose edges alternate between matched and unmatched edges. An alternating cycle is, similarly, a cycle whose edges alternate between matched and unmatched edges, an augmenting path is an alternating path that starts and ends at unsaturated vertices. A larger matching can be found as the difference of the matching and the augmenting path. Anti-edge Synonym for non-edge, a pair of non-adjacent vertices, anti-triangle A three-vertex independent set, the complement of a triangle. An apex graph is a graph in which one vertex can be removed, the removed vertex is called the apex. A k-apex graph is a graph that can be made planar by the removal of k vertices, Synonym for universal vertex, a vertex adjacent to all other vertices. Arborescence Synonym for a rooted and directed tree, see tree, arrow An ordered pair of vertices, such as an edge in a directed graph. An arrow has a x, a head y. The arrow is the arrow of the arrow. Articulation point A vertex in a graph whose removal would disconnect the graph
40.
Girth (graph theory)
–
In graph theory, the girth of a graph is the length of a shortest cycle contained in the graph. If the graph does not contain any cycles, its girth is defined to be infinity, for example, a 4-cycle has girth 4. A grid has girth 4 as well, and a mesh has girth 3. A graph with four or more is triangle-free. A cubic graph of g that is as small as possible is known as a g-cage. The Petersen graph is the unique 5-cage, the Heawood graph is the unique 6-cage, the McGee graph is the unique 7-cage, there may exist multiple cages for a given girth. For instance there are three nonisomorphic 10-cages, each with 70 vertices, the Balaban 10-cage, the Harries graph, paul Erdős was the first to prove the general result, using the probabilistic method. The odd girth and even girth of a graph are the lengths of a shortest odd cycle, the circumference of a graph is the length of the longest cycle, rather than the shortest. Thought of as the least length of a cycle, the girth admits natural generalisations as the 1-systole or higher systoles in systolic geometry. Girth is the concept to edge connectivity, in the sense that the girth of a planar graph is the edge connectivity of its dual graph. These concepts are unified in matroid theory by the girth of a matroid, for a graphic matroid, the matroid girth equals the girth of the underlying graph, while for a co-graphic matroid it equals the edge connectivity
41.
Graph automorphism
–
In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge–vertex connectivity. Formally, an automorphism of a graph G = is a permutation σ of the vertex set V, such that the pair of vertices form an edge if and that is, it is a graph isomorphism from G to itself. Automorphisms may be defined in this way both for directed graphs and for undirected graphs, the composition of two automorphisms is another automorphism, and the set of automorphisms of a given graph, under the composition operation, forms a group, the automorphism group of the graph. In the opposite direction, by Fruchts theorem, all groups can be represented as the group of a connected graph – indeed. Constructing the automorphism group is at least as difficult as solving the graph isomorphism problem, for, G and H are isomorphic if and only if the disconnected graph formed by the disjoint union of graphs G and H has an automorphism that swaps the two components. In fact, just counting the automorphisms is polynomial-time equivalent to graph isomorphism The graph automorphism problem is the problem of testing whether a graph has a nontrivial automorphism and it belongs to the class NP of computational complexity. Similar to the isomorphism problem, it is unknown whether it has a polynomial time algorithm or it is NP-complete. There is a polynomial algorithm for solving the graph automorphism problem for graphs where vertex degrees are bounded by a constant. The graph automorphism problem is polynomial-time many-one reducible to the isomorphism problem. While no worst-case polynomial-time algorithms are known for the general Graph Automorphism problem, several open-source software tools are available for this task, including NAUTY, BLISS and SAUCY. SAUCY and BLISS are particularly efficient for sparse graphs, e. g. SAUCY processes some graphs with millions of vertices in mere seconds, however, BLISS and NAUTY can also produce Canonical Labeling, whereas SAUCY is currently optimized for solving Graph Automorphism. It also appears that the support of all generators is limited by a linear function of n. However, this has not been established for a fact, as of March 2012, molecular symmetry can predict or explain chemical properties. Several graph drawing researchers have investigated algorithms for drawing graphs in such a way that the automorphisms of the graph become visible as symmetries of the drawing. It is not always possible to display all symmetries of the graph simultaneously, so it may be necessary to choose which symmetries to display, several families of graphs are defined by having certain types of automorphisms, An asymmetric graph is an undirected graph without any nontrivial automorphisms. A vertex-transitive graph is a graph in which every vertex may be mapped by an automorphism into any other vertex. An edge-transitive graph is a graph in which every edge may be mapped by an automorphism into any other edge. A symmetric graph is a such that every pair of adjacent vertices may be mapped by an automorphism into any other pair of adjacent vertices
42.
Symmetric group
–
Since there are n. possible permutation operations that can be performed on a tuple composed of n symbols, it follows that the order of the symmetric group Sn is n. For the remainder of this article, symmetric group will mean a group on a finite set. The symmetric group is important to diverse areas of such as Galois theory, invariant theory, the representation theory of Lie groups. Cayleys theorem states that every group G is isomorphic to a subgroup of the group on G. The symmetric group on a finite set X is the group elements are all bijective functions from X to X. For finite sets, permutations and bijective functions refer to the same operation, the symmetric group of degree n is the symmetric group on the set X =. The symmetric group on a set X is denoted in various ways including SX,