Search results
Results from the WOW.Com Content Network
The regular skew polyhedron onto which the Laves graph can be inscribed. The edges of the Laves graph are diagonals of some of the squares of this polyhedral surface. As Coxeter (1955) describes, the vertices of the Laves graph can be defined by selecting one out of every eight points in the three-dimensional integer lattice, and forming their nearest neighbor graph.
In geometry, the rhombille tiling, [1] also known as tumbling blocks, [2] reversible cubes, or the dice lattice, is a tessellation of identical 60° rhombi on the Euclidean plane. Each rhombus has two 60° and two 120° angles; rhombi with this shape are sometimes also called diamonds. Sets of three rhombi meet at their 120° angles, and sets ...
The more precise mathematical definition is that there is never translational symmetry in more than n – 1 linearly independent directions, where n is the dimension of the space filled, e.g., the three-dimensional tiling displayed in a quasicrystal may have translational symmetry in two directions.
The honeycomb point set is a special case of the hexagonal lattice with a two-atom basis. [1] The centers of the hexagons of a honeycomb form a hexagonal lattice, and the honeycomb point set can be seen as the union of two offset hexagonal lattices. In nature, carbon atoms of the two-dimensional material graphene are arranged in a honeycomb ...
Example of Wang tessellation with 13 tiles. In 1961, Wang conjectured that if a finite set of Wang tiles can tile the plane, then there also exists a periodic tiling, which, mathematically, is a tiling that is invariant under translations by vectors in a 2-dimensional lattice. This can be likened to the periodic tiling in a wallpaper pattern ...
A lattice in the sense of a 3-dimensional array of regularly spaced points coinciding with e.g. the atom or molecule positions in a crystal, or more generally, the orbit of a group action under translational symmetry, is a translation of the translation lattice: a coset, which need not contain the origin, and therefore need not be a lattice in ...
A common type of lattice graph (known under different names, such as grid graph or square grid graph) is the graph whose vertices correspond to the points in the plane with integer coordinates, x-coordinates being in the range 1, ..., n, y-coordinates being in the range 1, ..., m, and two vertices being connected by an edge whenever the corresponding points are at distance 1.
A type of quasiparticle that occurs only in two-dimensional systems, with properties much less restricted than fermions and bosons. Biexciton: A bound state of two free excitons: Bion: A bound state of solitons, named for Born–Infeld model: soliton Cooper pair: A bound pair of two electrons electron Bipolaron: A bound pair of two polarons