enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Lattice (order) - Wikipedia

    en.wikipedia.org/wiki/Lattice_(order)

    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).

  3. Lattice graph - Wikipedia

    en.wikipedia.org/wiki/Lattice_graph

    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.

  4. Map of lattices - Wikipedia

    en.wikipedia.org/wiki/Map_of_lattices

    A totally ordered set is a distributive lattice. 21. A metric lattice is modular. [6] 22. A modular lattice is semi-modular. [7] 23. A projective lattice is modular. [8] 24. A projective lattice is geometric. (def) 25. A geometric lattice is semi-modular. [9] 26. A semi-modular lattice is atomic. [10] [disputed – discuss] 27. An atomic ...

  5. Complete lattice - Wikipedia

    en.wikipedia.org/wiki/Complete_lattice

    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.

  6. Distributive lattice - Wikipedia

    en.wikipedia.org/wiki/Distributive_lattice

    A lattice is distributive if and only if none of its sublattices is isomorphic to M 3 or N 5; a sublattice is a subset that is closed under the meet and join operations of the original lattice. Note that this is not the same as being a subset that is a lattice under the original order (but possibly with different join and meet operations).

  7. Crystal structure - Wikipedia

    en.wikipedia.org/wiki/Crystal_structure

    Vectors and planes in a crystal lattice are described by the three-value Miller index notation. This syntax uses the indices h, k, and â„“ as directional parameters. [4] By definition, the syntax (hkâ„“) denotes a plane that intercepts the three points a 1 /h, a 2 /k, and a 3 /â„“, or some multiple thereof. That is, the Miller indices are ...

  8. Bravais lattice - Wikipedia

    en.wikipedia.org/wiki/Bravais_lattice

    For example, a crystal, viewed as a lattice with a single kind of atom located at every lattice point (the simplest basis form), may also be viewed as a lattice with a basis of two atoms. In this case, a primitive unit cell is a unit cell having only one lattice point in the first way of describing the crystal in order to ensure the smallest ...

  9. Distributivity (order theory) - Wikipedia

    en.wikipedia.org/wiki/Distributivity_(order_theory)

    These definitions are justified by the fact that given any lattice L, the following statements are all equivalent: L is distributive as a meet-semilattice; L is distributive as a join-semilattice; L is a distributive lattice. Thus any distributive meet-semilattice in which binary joins exist is a distributive lattice.