|
Crystallographic 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.Shechtman et al (1982) 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. Dimensions 2 and 3 The special cases of 2D (wallpaper groups) and 3D (space groups) are most ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rotational Symmetry
Rotational symmetry, also known as radial symmetry in geometry, is the property a shape has when it looks the same after some rotation by a partial turn. An object's degree of rotational symmetry is the number of distinct orientations in which it looks exactly the same for each rotation. Certain geometric objects are partially symmetrical when rotated at certain angles such as squares rotated 90°, however the only geometric objects that are fully rotationally symmetric at any angle are spheres, circles and other spheroids. Formal treatment Formally the rotational symmetry is symmetry with respect to some or all rotations in ''m''-dimensional Euclidean space. Rotations are direct isometries, i.e., isometries preserving orientation. Therefore, a symmetry group of rotational symmetry is a subgroup of ''E''+(''m'') (see Euclidean group). Symmetry with respect to all rotations about all points implies translational symmetry with respect to all translations, so space is homo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Crystallographic Restriction
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.Shechtman et al (1982) 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. Dimensions 2 and 3 The special cases of 2D (wallpaper groups) and 3D (space groups) are most ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aperiodic Tiling
An aperiodic tiling is a non-periodic tiling with the additional property that it does not contain arbitrarily large periodic regions or patches. A set of tile-types (or prototiles) is aperiodic if copies of these tiles can form only non- periodic tilings. The Penrose tilings are the best-known examples of aperiodic tilings. Aperiodic tilings serve as mathematical models for quasicrystals, physical solids that were discovered in 1982 by Dan Shechtman who subsequently won the Nobel prize in 2011. However, the specific local structure of these materials is still poorly understood. Several methods for constructing aperiodic tilings are known. Definition and illustration Consider a periodic tiling by unit squares (it looks like infinite graph paper). Now cut one square into two rectangles. The tiling obtained in this way is non-periodic: there is no non-zero shift that leaves this tiling fixed. But clearly this example is much less interesting than the Penrose tiling. In order t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hypercube
In geometry, a hypercube is an ''n''-dimensional analogue of a square () and a cube (). It is a closed, compact, convex figure whose 1- skeleton consists of groups of opposite parallel line segments aligned in each of the space's dimensions, perpendicular to each other and of the same length. A unit hypercube's longest diagonal in ''n'' dimensions is equal to \sqrt. An ''n''-dimensional hypercube is more commonly referred to as an ''n''-cube or sometimes as an ''n''-dimensional cube. The term measure polytope (originally from Elte, 1912) is also used, notably in the work of H. S. M. Coxeter who also labels the hypercubes the γn polytopes. The hypercube is the special case of a hyperrectangle (also called an ''n-orthotope''). A ''unit hypercube'' is a hypercube whose side has length one unit. Often, the hypercube whose corners (or ''vertices'') are the 2''n'' points in R''n'' with each coordinate equal to 0 or 1 is called ''the'' unit hypercube. Construction A hyp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hypercubic Lattice
In geometry, a hypercubic honeycomb is a family of regular honeycombs (tessellations) in -dimensional spaces with the Schläfli symbols and containing the symmetry of Coxeter group (or ) for . The tessellation is constructed from 4 - hypercubes per ridge. The vertex figure is a cross-polytope The hypercubic honeycombs are self-dual. Coxeter named this family as for an -dimensional honeycomb. Wythoff construction classes by dimension A Wythoff construction is a method for constructing a uniform polyhedron or plane tiling. The two general forms of the hypercube honeycombs are the ''regular'' form with identical hypercubic facets and one ''semiregular'', with alternating hypercube facets, like a checkerboard. A third form is generated by an expansion operation applied to the regular form, creating facets in place of all lower-dimensional elements. For example, an ''expanded cubic honeycomb'' has cubic cells centered on the original cubes, on the original faces, on t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Determinant
In mathematics, the determinant is a scalar value that is a function of the entries of a square matrix. It characterizes some properties of the matrix and the linear map represented by the matrix. In particular, the determinant is nonzero if and only if the matrix is invertible and the linear map represented by the matrix is an isomorphism. The determinant of a product of matrices is the product of their determinants (the preceding property is a corollary of this one). The determinant of a matrix is denoted , , or . The determinant of a matrix is :\begin a & b\\c & d \end=ad-bc, and the determinant of a matrix is : \begin a & b & c \\ d & e & f \\ g & h & i \end= aei + bfg + cdh - ceg - bdi - afh. The determinant of a matrix can be defined in several equivalent ways. Leibniz formula expresses the determinant as a sum of signed products of matrix entries such that each summand is the product of different entries, and the number of these summands is n!, the factorial of (t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tessellation
A tessellation or tiling is the covering of a surface, often a plane (mathematics), plane, using one or more geometric shapes, called ''tiles'', with no overlaps and no gaps. In mathematics, tessellation can be generalized to high-dimensional spaces, higher dimensions and a variety of geometries. A periodic tiling has a repeating pattern. Some special kinds include ''regular tilings'' with regular polygonal tiles all of the same shape, and ''semiregular tilings'' with regular tiles of more than one shape and with every corner identically arranged. The patterns formed by periodic tilings can be categorized into 17 wallpaper groups. A tiling that lacks a repeating pattern is called "non-periodic". An ''aperiodic tiling'' uses a small set of tile shapes that cannot form a repeating pattern. A ''tessellation of space'', also known as a space filling or honeycomb, can be defined in the geometry of higher dimensions. A real physical tessellation is a tiling made of materials such a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Similarity Invariance
In linear algebra, similarity invariance is a property exhibited by a function whose value is unchanged under similarities of its domain. That is, f is invariant under similarities if f(A) = f(B^AB) where B^AB is a matrix similar to ''A''. Examples of such functions include the trace, determinant, characteristic polynomial, and the minimal polynomial. A more colloquial phrase that means the same thing as similarity invariance is "basis independence", since a matrix can be regarded as a linear operator, written in a certain basis, and the same operator in a new basis is related to one in the old basis by the conjugation B^AB, where B is the transformation matrix to the new basis. See also * Invariant (mathematics) * Gauge invariance * Trace diagram In mathematics, trace diagrams are a graphical means of performing computations in linear and multilinear algebra. They can be represented as (slightly modified) graphs in which some edges are labeled by matrices. The simples ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Integer
An integer is the number zero (), a positive natural number (, , , etc.) or a negative integer with a minus sign (−1, −2, −3, etc.). The negative numbers are the additive inverses of the corresponding positive numbers. In the language of mathematics, the set of integers is often denoted by the boldface or blackboard bold \mathbb. The set of natural numbers \mathbb is a subset of \mathbb, which in turn is a subset of the set of all rational numbers \mathbb, itself a subset of the real numbers \mathbb. Like the natural numbers, \mathbb is countably infinite. An integer may be regarded as a real number that can be written without a fractional component. For example, 21, 4, 0, and −2048 are integers, while 9.75, , and are not. The integers form the smallest group and the smallest ring containing the natural numbers. In algebraic number theory, the integers are sometimes qualified as rational integers to distinguish them from the more general algebraic integers ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Orthonormal Basis
In mathematics, particularly linear algebra, an orthonormal basis for an inner product space ''V'' with finite dimension is a basis for V whose vectors are orthonormal, that is, they are all unit vectors and orthogonal to each other. For example, the standard basis for a Euclidean space \R^n is an orthonormal basis, where the relevant inner product is the dot product of vectors. The image of the standard basis under a rotation or reflection (or any orthogonal transformation) is also orthonormal, and every orthonormal basis for \R^n arises in this fashion. For a general inner product space V, an orthonormal basis can be used to define normalized orthogonal coordinates on V. Under these coordinates, the inner product becomes a dot product of vectors. Thus the presence of an orthonormal basis reduces the study of a finite-dimensional inner product space to the study of \R^n under dot product. Every finite-dimensional inner product space has an orthonormal basis, which may be ob ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rotation Matrix
In linear algebra, a rotation matrix is a transformation matrix that is used to perform a rotation in Euclidean space. For example, using the convention below, the matrix :R = \begin \cos \theta & -\sin \theta \\ \sin \theta & \cos \theta \end rotates points in the plane counterclockwise through an angle with respect to the positive axis about the origin of a two-dimensional Cartesian coordinate system. To perform the rotation on a plane point with standard coordinates , it should be written as a column vector, and multiplied by the matrix : : R\mathbf = \begin \cos \theta & -\sin \theta \\ \sin \theta & \cos \theta \end \begin x \\ y \end = \begin x\cos\theta-y\sin\theta \\ x\sin\theta+y\cos\theta \end. If and are the endpoint coordinates of a vector, where is cosine and is sine, then the above equations become the trigonometric summation angle formulae. Indeed, a rotation matrix can be seen as the trigonometric summation angle formulae in matrix form. One w ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
