In mathematics, the square lattice is a type of lattice in a two-dimensional Euclidean space. It is the two-dimensional version of the integer lattice, denoted as \mathbb{Z}^2. It is one of the five types of two-dimensional lattices as classified by their symmetry groups; its symmetry group in IUC notation as p4m, Coxeter notation as [4,4], and orbifold notation as *442.
Two orientations of an image of the lattice are by far the most common. They can conveniently be referred to as the upright square lattice and diagonal square lattice; the latter is also called the centered square lattice. They differ by an angle of 45°. This is related to the fact that a square lattice can be partitioned into two square sub-lattices, as is evident in the colouring of a checkerboard.
The square lattice's symmetry category is wallpaper group p4m. A pattern with this lattice of translational symmetry cannot have more, but may have less symmetry than the lattice itself.
An upright square lattice can be viewed as a diagonal square lattice with a mesh size that is √2 times as large, with the centers of the squares added. Correspondingly, after adding the centers of the squares of an upright square lattice one obtains a diagonal square lattice with a mesh size that is √2 times as small as that of the original lattice.
A pattern with 4-fold rotational symmetry has a square lattice of 4-fold rotocenters that is a factor √2 finer and diagonally oriented relative to the lattice of translational symmetry.
With respect to reflection axes there are three possibilities:
None. This is wallpaper group p4.
In four directions. This is wallpaper group p4m.
In two perpendicular directions. This is wallpaper group p4g. The points of intersection of the reflexion axes form a square grid which is as fine as, and oriented the same as, the square lattice of 4-fold rotocenters, with these rotocenters at the centers of the squares formed by the reflection axes.
The square lattice class names, Schönflies notation, Hermann-Mauguin notation, orbifold notation, Coxeter notation, and wallpaper groups are listed in the table below.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
In geometry and group theory, a lattice in the real coordinate space is an infinite set of points in this space with the properties that coordinate-wise addition or subtraction of two points in the lattice produces another lattice point, that the lattice points are all separated by some minimum distance, and that every point in the space is within some maximum distance of a lattice point.
A wallpaper is a mathematical object covering a whole Euclidean plane by repeating a motif indefinitely, in manner that certain isometries keep the drawing unchanged. To a given wallpaper there corresponds a group of such congruent transformations, with function composition as the group operation. Thus, a wallpaper group (or plane symmetry group or plane crystallographic group) is in a mathematical classification of a two‐dimensional repetitive pattern, based on the symmetries in the pattern.
In crystallography, a crystal system is a set of point groups (a group of geometric symmetries with at least one fixed point). A lattice system is a set of Bravais lattices. Space groups are classified into crystal systems according to their point groups, and into lattice systems according to their Bravais lattices. Crystal systems that have space groups assigned to a common lattice system are combined into a crystal family. The seven crystal systems are triclinic, monoclinic, orthorhombic, tetragonal, trigonal, hexagonal, and cubic.
Most perovskite oxides belong to the Pbnm space group, composed of an anisotropic unit cell, A-site antipolar displacements, and oxygen octahedral tilts. Mapping the orientation of the orthorhombic unit cell in epitaxial heterostructures that consist of at ...
Melville2024
Euclidean lattices are mathematical objects of increasing interest in the fields of cryptography and error-correcting codes. This doctoral thesis is a study on high-dimensional lattices with the motivation to understand how efficient they are in terms of b ...
EPFL2024
, , ,
The corner transfer matrix renormalization group (CTMRG) algorithm has been extensively used to investigate both classical and quantum two-dimensional (2D) lattice models. The convergence of the algorithm can strongly vary from model to model depending on ...