The mathematical conditions for the origin of long‐range order or crystallinity in ideal crystals are one of the very fundamental problems of modern crystallography. It is widely believed that the (global) regularity of crystals is a consequence of `local order', in particular the repetition of local fragments, but the exact mathematical theory of this phenomenon is poorly known. In particular, most mathematical models for quasicrystals, for example Penrose tiling, have repetitive local fragments, but are not (globally) regular. The universal abstract models of any atomic arrangements are Delone sets, which are uniformly distributed discrete point sets in Euclidean d space. An ideal crystal is a regular or multi‐regular system, that is, a Delone set, which is the orbit of a single point or finitely many points under a crystallographic group of isometries. The local theory of regular or multi‐regular systems aims at finding sufficient local conditions for a Delone set X to be a regular or multi‐regular system. One of the main goals is to estimate the regularity radius for Delone sets X in terms of the radius R of the largest `empty ball' for X. The celebrated `local criterion for regular systems' provides an upper bound for for any d. Better upper bounds are known for d ≤ 3. The present article establishes the lower bound for all d, which is linear in d. The best previously known lower bound had been for d ≥ 2. The proof of the new lower bound is accomplished through explicit constructions of Delone sets with mutually equivalent (2dR − ϵ)‐clusters, which are not regular systems. The two‐ and three‐dimensional constructions are illustrated by examples. In addition to its fundamental importance, the obtained result is also relevant for the understanding of geometrical conditions of the formation of ordered and disordered arrangements in polytypic materials.
We study the well-known problem of combinatorial classification of fullerenes. By a (mathematical) fullerene we mean a convex simple three dimensional polytope with all facets pentagons and hexagons. We analyse approaches of construction of arbitrary fullerene from the dodecahedron (a fullerene C 20 ). A growth operation is a combinatorial operation that substitutes the patch with more facets and the same boundary for the patch on the surface of a simple polytope to produce a new simple polytope. It is known that an infinite set of different growth operations transforming fullerenes into fullerenes is needed to construct any fullerene from the dodecahedron. We prove that if we allow a polytope to contain one exceptional facet, which is a quadrangle or a heptagon, then a finite set of growth operation is sufficient. We analyze pairs of objects: a finite set of operations, and a family of acceptable polytopes containing fullerenes such that any polytope of the family can be obtained from the dodecahedron by a sequence of operations from the corresponding set. We describe explicitly three such pairs. First two pairs contain seven operations, and the last -eleven operations. Each of these operations corresponds to a finite set of growth operations and is a composition of edge-and two edges-truncations.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.