About: Crystallographic restriction theorem     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Theorem106752293, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FCrystallographic_restriction_theorem

The crystallographic restriction theorem in its basic form was based on the observation that the rotational symmetries of a crystal are usually limited to 2-fold, 3-fold, 4-fold, and 6-fold. However, quasicrystals can occur with other diffraction pattern symmetries, such as 5-fold; these were not discovered until 1982 by Dan Shechtman.

AttributesValues
rdf:type
rdfs:label
  • Teorema de restricción cristalográfica (es)
  • Crystallographic restriction theorem (en)
  • Théorème de restriction cristallographique (fr)
  • 晶体学限制定理 (zh)
rdfs:comment
  • 晶体学限制定理的基本形式是基于对晶体的旋转对称性通常被限制为2重,3重,4重,6重的观察后得出的。然而,准晶体中可能存在着其他种类的衍射对称性,例如5重对称;这种晶体是由丹·谢赫特曼于1984年发现的,他也凭此获得了2011年诺贝尔化学奖。 晶体模型是由离散的晶格通过一系列独立有限的平移建立的。因为离散性要求格点间的间距有一个下限值,所以该晶格对于空间中任意一点的旋转对称群必须是有限群。这个理论的重点在于,并不是所有的有限群都能兼容一个离散的晶格;在任何一个维度上,可兼容群的数量都是有限的。 (zh)
  • The crystallographic restriction theorem in its basic form was based on the observation that the rotational symmetries of a crystal are usually limited to 2-fold, 3-fold, 4-fold, and 6-fold. However, quasicrystals can occur with other diffraction pattern symmetries, such as 5-fold; these were not discovered until 1982 by Dan Shechtman. (en)
  • El teorema de restricción cristalográfica, en su forma básica, se basa en la observación de que las simetrías rotacionales de un cristal se limitan generalmente a los órdenes 2, 3, 4 y 6.​ Sin embargo, en los cuasicristales se pueden presentar otras simetrías, como la de orden 5, las cuales no fueron descubiertas hasta 1984 por el premio Nobel de Química 2011, Dan Shechtman.​ (es)
  • Le théorème de restriction cristallographique est fondé sur l'observation du fait que les opérations de symétrie rotationnelles d'un cristal sont limitées à des opérations d'ordre 1, 2, 3, 4 et 6. Cependant, les quasi-cristaux, découverts en 1984, peuvent posséder d'autres symétries, comme la rotation d'ordre 5. (fr)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/Crystallographic_restriction.png
  • http://commons.wikimedia.org/wiki/Special:FilePath/Crystallographic_restriction_2.png
  • http://commons.wikimedia.org/wiki/Special:FilePath/Crystallographic_restriction_polygons.png
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
thumbnail
has abstract
  • The crystallographic restriction theorem in its basic form was based on the observation that the rotational symmetries of a crystal are usually limited to 2-fold, 3-fold, 4-fold, and 6-fold. However, quasicrystals can occur with other diffraction pattern symmetries, such as 5-fold; these were not discovered until 1982 by Dan Shechtman. Crystals are modeled as discrete lattices, generated by a list of independent finite translations. Because discreteness requires that the spacings between lattice points have a lower bound, the group of rotational symmetries of the lattice at any point must be a finite group (alternatively, the point is the only system allowing for infinite rotational symmetry). The strength of the theorem is that not all finite groups are compatible with a discrete lattice; in any dimension, we will have only a finite number of compatible groups. (en)
  • El teorema de restricción cristalográfica, en su forma básica, se basa en la observación de que las simetrías rotacionales de un cristal se limitan generalmente a los órdenes 2, 3, 4 y 6.​ Sin embargo, en los cuasicristales se pueden presentar otras simetrías, como la de orden 5, las cuales no fueron descubiertas hasta 1984 por el premio Nobel de Química 2011, Dan Shechtman.​ Antes del descubrimiento de los cuasicristales, los cristales se modelaban como redes discretas de puntos, que se podían generar por una secuencia finita de traslaciones independientes. La naturaleza discreta de los puntos de la red requiere que las distancias entre dichos puntos tengan un límite inferior, y por tanto, el grupo de las simetrías de rotación de la red en cualquier punto debe ser un grupo finito. La fuerza del teorema radica en que no todos los grupos finitos son compatibles con una red discreta. Por ello, en cualquier dimensión, vamos a tener solamente un número finito de grupos compatibles. (es)
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software