Search Results for ""

An algebra <L; ^ , v > is called a lattice if L is a nonempty set, ^ and v are binary operations on L, both ^ and v are idempotent, commutative, and associative, and they ...

A bounded lattice is an algebraic structure L=(L, ^ , v ,0,1), such that (L, ^ , v ) is a lattice, and the constants 0,1 in L satisfy the following: 1. for all x in L, x ^ ...

A complemented lattice is an algebraic structure (L, ^ , v ,0,1,^') such that (L, ^ , v ,0,1) is a bounded lattice and for each element x in L, the element x^' in L is a ...

A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...

A lattice which satisfies the identities (x ^ y) v (x ^ z)=x ^ (y v z) (x v y) ^ (x v z)=x v (y ^ z) is said to be distributive.

A point lattice which can be constructed from an arbitrary parallelogram of unit area. For any such planar lattice, the minimum distance c between any two points is a ...

A polygon whose vertices are points of a point lattice. Regular lattice n-gons exists only for n=3, 4, and 6 (Schoenberg 1937, Klamkin and Chrestenson 1963, Maehara 1993). A ...

A 24-dimensional Euclidean lattice. An automorphism of the Leech lattice modulo a center of two leads to the Conway group Co_1. Stabilization of the one- and two-dimensional ...

A lattice which is built up of layers of n-dimensional lattices in (n+1)-dimensional space. The vectors specifying how layers are stacked are called glue vectors. The order ...

A lattice embedding is a one-to-one lattice homomorphism.