When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. OctaDist - Wikipedia

    en.wikipedia.org/wiki/OctaDist

    OctaDist is computer software for crystallography and inorganic chemistry program. It is mainly used for computing distortion parameters of coordination complex such as spin crossover complex (SCO), magnetic metal complex and metal–organic framework (MOF).

  3. Angular defect - Wikipedia

    en.wikipedia.org/wiki/Angular_defect

    The defect of any of the vertices of a regular dodecahedron (in which three regular pentagons meet at each vertex) is 36°, or π/5 radians, or 1/10 of a circle. Each of the angles measures 108°; three of these meet at each vertex, so the defect is 360° − (108° + 108° + 108°) = 36°.

  4. Hyperoctahedral group - Wikipedia

    en.wikipedia.org/wiki/Hyperoctahedral_group

    There is a notable index two subgroup, corresponding to the Coxeter group D n and the symmetries of the demihypercube.Viewed as a wreath product, there are two natural maps from the hyperoctahedral group to the cyclic group of order 2: one map coming from "multiply the signs of all the elements" (in the n copies of {}), and one map coming from the parity of the permutation.

  5. List of Wenninger polyhedron models - Wikipedia

    en.wikipedia.org/wiki/List_of_Wenninger...

    This is an indexed list of the uniform and stellated polyhedra from the book Polyhedron Models, by Magnus Wenninger.. The book was written as a guide book to building polyhedra as physical models.

  6. Jahn–Teller effect - Wikipedia

    en.wikipedia.org/wiki/Jahn–Teller_effect

    The Jahn–Teller effect (JT effect or JTE) is an important mechanism of spontaneous symmetry breaking in molecular and solid-state systems which has far-reaching consequences in different fields, and is responsible for a variety of phenomena in spectroscopy, stereochemistry, crystal chemistry, molecular and solid-state physics, and materials science.

  7. Goldberg polyhedron - Wikipedia

    en.wikipedia.org/wiki/Goldberg_polyhedron

    The number of vertices, edges, and faces of GP(m,n) can be computed from m and n, with T = m 2 + mn + n 2 = (m + n) 2 − mn, depending on one of three symmetry systems: [1] The number of non-hexagonal faces can be determined using the Euler characteristic, as demonstrated here.

  8. Cross-polytope - Wikipedia

    en.wikipedia.org/wiki/Cross-polytope

    In geometry, a cross-polytope, [1] hyperoctahedron, orthoplex, [2] staurotope, [3] or cocube is a regular, convex polytope that exists in n-dimensional Euclidean space.A 2-dimensional cross-polytope is a square, a 3-dimensional cross-polytope is a regular octahedron, and a 4-dimensional cross-polytope is a 16-cell.

  9. Snub polyhedron - Wikipedia

    en.wikipedia.org/wiki/Snub_polyhedron

    Snub polyhedra have Wythoff symbol | p q r and by extension, vertex configuration 3.p.3.q.3.r.Retrosnub polyhedra (a subset of the snub polyhedron, containing the great icosahedron, small retrosnub icosicosidodecahedron, and great retrosnub icosidodecahedron) still have this form of Wythoff symbol, but their vertex configurations are instead ⁠ (..).