|
Goldberg–Coxeter Construction
The Goldberg–Coxeter construction or Goldberg–Coxeter operation (GC construction or GC operation) is a graph operation defined on regular polyhedral graphs with degree 3 or 4. It also applies to the dual graph of these graphs, i.e. graphs with triangular or quadrilateral "faces". The GC construction can be thought of as subdividing the faces of a polyhedron with a lattice of triangular, square, or hexagonal polygons, possibly skewed with regards to the original face: it is an extension of concepts introduced by the Goldberg polyhedra and geodesic polyhedra. The GC construction is primarily studied in organic chemistry for its application to fullerenes, but it has been applied to nanoparticles, computer-aided design, basket weaving, and the general study of graph theory and polyhedra. The Goldberg–Coxeter construction may be denoted as GC_(G_0), where G_0 is the graph being operated on, k and l are integers, k >0, and \ell \ge 0. History Michael Goldberg introduced the Gol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Operation
In the mathematical field of graph theory, graph operations are Operation (mathematics), operations which produce new Graph (discrete mathematics), graphs from initial ones. They include both Unary operation, unary (one input) and Binary operation, binary (two input) operations. Unary operations Unary operations create a new graph from a single initial graph. Elementary operations Elementary operations or editing operations, which are also known as graph edit operations, create a new graph from one initial one by a simple local change, such as addition or deletion of a vertex or of an edge, merging and splitting of vertices, edge contraction, etc. The graph edit distance between a pair of graphs is the minimum number of elementary operations required to transform one graph into the other. Advanced operations Advanced operations create a new graph from initial one by a complex changes, such as: * transpose graph; * complement graph; * line graph; * graph minor; * graph rewriting; ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geodesic Polyhedron
A geodesic polyhedron is a convex polyhedron made from triangles. They usually have icosahedral symmetry, such that they have 6 triangles at a vertex, except 12 vertices which have 5 triangles. They are the dual of corresponding Goldberg polyhedra with mostly hexagonal faces. Geodesic polyhedra are a good approximation to a sphere for many purposes, and appear in many different contexts. The most well-known may be the geodesic domes designed by Buckminster Fuller, which geodesic polyhedra are named after. Geodesic grids used in geodesy also have the geometry of geodesic polyhedra. The capsids of some viruses have the shape of geodesic polyhedra, and fullerene molecules have the shape of Goldberg polyhedra. Geodesic polyhedra are available as geometric primitives in the Blender 3D modeling software package, which calls them icospheres: they are an alternative to the UV sphere, having a more regular distribution of vertices than the UV sphere. The Goldberg–Coxeter construction ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Equivalence Class
In mathematics, when the elements of some set S have a notion of equivalence (formalized as an equivalence relation), then one may naturally split the set S into equivalence classes. These equivalence classes are constructed so that elements a and b belong to the same equivalence class if, and only if, they are equivalent. Formally, given a set S and an equivalence relation \,\sim\, on S, the of an element a in S, denoted by is the set \ of elements which are equivalent to a. It may be proven, from the defining properties of equivalence relations, that the equivalence classes form a partition of S. This partition—the set of equivalence classes—is sometimes called the quotient set or the quotient space of S by \,\sim\,, and is denoted by S / \sim. When the set S has some structure (such as a group operation or a topology) and the equivalence relation \,\sim\, is compatible with this structure, the quotient set often inherits a similar structure from its parent set. Examp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Integral Domain
In mathematics, specifically abstract algebra, an integral domain is a nonzero commutative ring in which the product of any two nonzero elements is nonzero. Integral domains are generalizations of the ring of integers and provide a natural setting for studying divisibility. In an integral domain, every nonzero element ''a'' has the cancellation property, that is, if , an equality implies . "Integral domain" is defined almost universally as above, but there is some variation. This article follows the convention that rings have a multiplicative identity, generally denoted 1, but some authors do not follow this, by not requiring integral domains to have a multiplicative identity. Noncommutative integral domains are sometimes admitted. This article, however, follows the much more usual convention of reserving the term "integral domain" for the commutative case and using "domain" for the general case including noncommutative rings. Some sources, notably Lang, use the term entir ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Capsid
A capsid is the protein shell of a virus, enclosing its genetic material. It consists of several oligomeric (repeating) structural subunits made of protein called protomers. The observable 3-dimensional morphological subunits, which may or may not correspond to individual proteins, are called capsomeres. The proteins making up the capsid are called capsid proteins or viral coat proteins (VCP). The capsid and inner genome is called the nucleocapsid. Capsids are broadly classified according to their structure. The majority of the viruses have capsids with either helical or icosahedral structure. Some viruses, such as bacteriophages, have developed more complicated structures due to constraints of elasticity and electrostatics. The icosahedral shape, which has 20 equilateral triangular faces, approximates a sphere, while the helical shape resembles the shape of a spring, taking the space of a cylinder but not being a cylinder itself. The capsid faces may consist of one or more ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Eisenstein Integers
In mathematics, the Eisenstein integers (named after Gotthold Eisenstein), occasionally also known as Eulerian integers (after Leonhard Euler), are the complex numbers of the form :z = a + b\omega , where and are integers and :\omega = \frac = e^ is a primitive (hence non-real) cube root of unity. The Eisenstein integers form a triangular lattice in the complex plane, in contrast with the Gaussian integers, which form a square lattice in the complex plane. The Eisenstein integers are a countably infinite set. Properties The Eisenstein integers form a commutative ring of algebraic integers in the algebraic number field \mathbb(\omega) — the third cyclotomic field. To see that the Eisenstein integers are algebraic integers note that each is a root of the monic polynomial :z^2 - (2a - b)\;\!z + \left(a^2 - ab + b^2\right)~. In particular, satisfies the equation :\omega^2 + \omega + 1 = 0~. The product of two Eisenstein integers and is given explicitly by :(a + b\;\! ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gaussian Integers
In number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as \mathbf /math> or \Z Gaussian integers share many properties with integers: they form a Euclidean domain, and have thus a Euclidean division and a Euclidean algorithm; this implies unique factorization and many related properties. However, Gaussian integers do not have a total ordering that respects arithmetic. Gaussian integers are algebraic integers and form the simplest ring of quadratic integers. Gaussian integers are named after the German mathematician Carl Friedrich Gauss. Basic definitions The Gaussian integers are the set :\mathbf \, \qquad \text i^2 = -1. In other words, a Gaussian integer is a complex number such that its real and imaginary parts are both integers. Since the Gaussian integers are closed under addition and multipl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complex Plane
In mathematics, the complex plane is the plane formed by the complex numbers, with a Cartesian coordinate system such that the -axis, called the real axis, is formed by the real numbers, and the -axis, called the imaginary axis, is formed by the imaginary numbers. The complex plane allows a geometric interpretation of complex numbers. Under addition, they add like vectors. The multiplication of two complex numbers can be expressed more easily in polar coordinates—the magnitude or ''modulus'' of the product is the product of the two absolute values, or moduli, and the angle or ''argument'' of the product is the sum of the two angles, or arguments. In particular, multiplication by a complex number of modulus 1 acts as a rotation. The complex plane is sometimes known as the Argand plane or Gauss plane. Notational conventions Complex numbers In complex analysis, the complex numbers are customarily represented by the symbol ''z'', which can be separated into its real (''x'') and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Domain
In mathematics, more specifically in ring theory, a Euclidean domain (also called a Euclidean ring) is an integral domain that can be endowed with a Euclidean function which allows a suitable generalization of the Euclidean division of integers. This generalized Euclidean algorithm can be put to many of the same uses as Euclid's original algorithm in the ring of integers: in any Euclidean domain, one can apply the Euclidean algorithm to compute the greatest common divisor of any two elements. In particular, the greatest common divisor of any two elements exists and can be written as a linear combination of them (Bézout's identity). Also every ideal in a Euclidean domain is principal, which implies a suitable generalization of the fundamental theorem of arithmetic: every Euclidean domain is a unique factorization domain. It is important to compare the class of Euclidean domains with the larger class of principal ideal domains (PIDs). An arbitrary PID has much the same "struct ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Michel Deza
Michel Marie Deza (27 April 1939. – 23 November 2016) was a Soviet and French mathematician, specializing in combinatorics, discrete geometry and graph theory. He was the retired director of research at the French National Centre for Scientific Research (CNRS), the vice president of the European Academy of Sciences, a research professor at the Japan Advanced Institute of Science and Technology, and one of the three founding editors-in-chief of the European Journal of Combinatorics. Deza graduated from Moscow University in 1961, after which he worked at the Soviet Academy of Sciences until emigrating to France in 1972. In France, he worked at CNRS from 1973 until his 2005 retirement. He has written eight books and about 280 academic papers with 75 different co-authors, including four papers with Paul Erdős, giving him an Erdős number of 1. [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Buckminsterfullerene
Buckminsterfullerene is a type of fullerene with the formula C60. It has a cage-like fused-ring structure (truncated icosahedron) made of twenty hexagons and twelve pentagons, and resembles a soccer ball. Each of its 60 carbon atoms is bonded to its three neighbors. Buckminsterfullerene is a black solid that dissolves in hydrocarbon solvents to produce a violet solution. The compound was discovered in 1985 and has received intense study, although few real world applications have been found. Occurrence Buckminsterfullerene is the most common naturally occurring fullerene. Small quantities of it can be found in soot. It also exists in space. Neutral C60 has been observed in planetary nebulae and several types of star. The ionised form, C60+, has been identified in the interstellar medium, where it is the cause of several absorption features known as diffuse interstellar bands in the near-infrared. History Theoretical predictions of buckyball molecules appeared in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stigler's Law Of Eponymy
Stigler's law of eponymy, proposed by University of Chicago statistics professor Stephen Stigler in his 1980 publication ''Stigler’s law of eponymy'', states that no scientific discovery is named after its original discoverer. Examples include Hubble's law, which was derived by Georges Lemaître two years before Edwin Hubble, the Pythagorean theorem, which was known to Babylonian mathematicians before Pythagoras, and Halley's Comet, which was observed by astronomers since at least 240 BC (although its official designation is due to the first ever mathematical prediction of such astronomical phenomenon in the sky, not to its discovery). Stigler himself named the sociologist Robert K. Merton as the discoverer of "Stigler's law" to show that it follows its own decree, though the phenomenon had previously been noted by others. Derivation Historical acclaim for discoveries is often assigned to persons of note who bring attention to an idea that is not yet widely known, whether or ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.gif "Click for more on -> Capsid")
