Search results
Results from the WOW.Com Content Network
A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra.It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper bound or join) and a unique infimum (also called a greatest lower bound or meet).
Unit cell definition using parallelepiped with lengths a, b, c and angles between the sides given by α, β, γ [1]. A lattice constant or lattice parameter is one of the physical dimensions and angles that determine the geometry of the unit cells in a crystal lattice, and is proportional to the distance between atoms in the crystal.
Example valuation function on the cube lattice which makes it a metric lattice. In the mathematical study of order , a metric lattice L is a lattice that admits a positive valuation : a function v ∈ L → ℝ satisfying, for any a , b ∈ L , [ 1 ] v ( a ) + v ( b ) = v ( a ∧ b ) + v ( a ∨ b ) {\displaystyle v(a)+v(b)=v(a\wedge b)+v(a\vee ...
An example is the Knaster–Tarski theorem, which states that the set of fixed points of a monotone function on a complete lattice is again a complete lattice. This is easily seen to be a generalization of the above observation about the images of increasing and idempotent functions.
Cheung (1974) defines the adjoint of a geometric lattice (or of the matroid defined from it) to be a minimal geometric lattice into which the dual lattice of is order-embedded. Some matroids do not have adjoints; an example is the Vámos matroid. [6]
A modular lattice of order dimension 2. As with all finite 2-dimensional lattices, its Hasse diagram is an st-planar graph. In the branch of mathematics called order theory, a modular lattice is a lattice that satisfies the following self-dual condition, Modular law a ≤ b implies a ∨ (x ∧ b) = (a ∨ x) ∧ b
Two well-formed words v and w in W(X) denote the same value in every bounded lattice if and only if w ≤ ~ v and v ≤ ~ w; the latter conditions can be effectively decided using the above inductive definition. The table shows an example computation to show that the words x∧z and x∧z∧(x∨y) denote the same value in every bounded lattice ...
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 ...