Solution to Goldberg variations challenge

Meija, Juris
October 2006
Analytical & Bioanalytical Chemistry;Oct2006, Vol. 386 Issue 1, p4
Academic Journal
This section deals with solution to the variations challenge proposed by scientist Michael Goldberg. The article states that Goldberg proved the mathematical possibility of converting fullerene polyhedron to polyhedra with n atoms. The theory of Goldberg was later supported by researches done by Gr�nbaum and Motzkin who observed that a planar 3-connected multi-k-gon with only one face being different from the other k-gons is not possible.


Related Articles

  • pol·y·he·dron.  // American Heritage Student Science Dictionary;2009, p273 

    A definition of the term "polyhedron" is presented. It refers to a three-dimensional geometric figure whose sides are polygons like the tetrahedron.

  • On nonrational divisors over non-Gorenstein terminal singularities. Stepanov, D. // Journal of Mathematical Sciences;Apr2007, Vol. 142 Issue 2, p1977 

    Let ( X, o) be a germ of a 3-dimensional terminal singularity of index m = 2. If ( X, o) has type cAx/4, cD/3-3, cD/2-2, or cE/2, then we assume that the standard equation of X in C4/Z m is nondegenerate with respect to its Newton diagram. Let p: Y ? X be a resolution. We show that there are at...

  • Higher-Order Newton-Cotes Formulas. Magalhaes Junior, Pedro Americo Almeida; Cristina Almeida Magalhaes // Journal of Mathematics & Statistics;2010, Vol. 6 Issue 2, p193 

    Problem statement: The present work offers equations of Newton-Cotes Integration until twenty segments. Approach: It shows Newton-Cotes closed and open integration formulas. The new type Newton-Cotes semi-closed or semi-open was proposed. Results: An analysis of error in the technique was made....

  • Singular Points of Real Sextic Curves I. Weinberg, David A.; Willis, Nicholas J. // Acta Applicandae Mathematica;May2010, Vol. 110 Issue 2, p805 

    A complete classification of the individual types of singular points is given for irreducible real sextic curves. This classification is derived by using the computer algebra system Maple. There are 191 types of singular points for real irreducible sextic curves. We clarify that the...

  • ON THE NUMBER OF CREPANT VALUATIONS OF CANONICAL SINGULARITIES. MIREL CAIBĂR // Journal of the London Mathematical Society;Oct2003, Vol. 68 Issue 2, p307 

    The number of crepant valuations of an isolated canonical singularity $0\in X:(f\,{=}\,0)\,{\subset}\,\mathbb{C}^{n}$, which is assumed to be nondegenerate with respect to its Newton polyhedron, is calculated in terms of weightings and the Newton polyhedron of $f$.

  • Automated Derivation of Geometry Theorems. Pech, Pavel // Electronic Journal of Mathematics & Technology;Feb2012, Vol. 6 Issue 1, p54 

    Derivation of geometry theorems belongs to mighty tools of automated geometry theorem proving. By elimination of suitable variables in the system of algebraic equations describing a geometric situation we get required formulas. The power of derivation is presented on computation of the area of...

  • How Many SIDES and FACES Do They Have?  // World Almanac for Kids;2006, p196 

    The article discusses two-dimensional and three-dimensional figures. A two-dimensional figure is a flat object, or plane figure. A three-dimensional object is also called a solid object and has several faces, or sides to them. There are also polygons, which are two-dimensional figures that have...

  • Irreducible System of Constraints for a General Polyhedron of Arrangements. Emets', O. O.; Roskladka, O. V.; Nedobachii, S. I. // Ukrainian Mathematical Journal;Jan2003, Vol. 55 Issue 1, p1 

    We construct a system of constraints for a general polyhedron of arrangements that does not contain superfluous inequalities. The derivation of an irreducible system enables one to substantially reduce the number of operations necessary for finding exact solutions of optimization problems on...

  • Parametric Integer Programming in Fixed Dimension. Eisenbrand, Friedrich; Shmonin, Gennady // Mathematics of Operations Research;Nov2008, Vol. 33 Issue 4, p839 

    Parametric integer programming deals with a family of integer programs that is defined by the same constraint matrix but where the right-hand sides are points of a given polyhedron. The question is whether all these integer programs are feasible. Kannan showed that this can be checked in...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics