enow.com Web Search

Search results

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

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

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

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

  4. Lattice (discrete subgroup) - Wikipedia

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

    Let be a locally compact group and a discrete subgroup (this means that there exists a neighbourhood of the identity element of such that = {}).Then is called a lattice in if in addition there exists a Borel measure on the quotient space / which is finite (i.e. (/) < +) and -invariant (meaning that for any and any open subset / the equality () = is satisfied).

  5. Outline of algebraic structures - Wikipedia

    en.wikipedia.org/wiki/Outline_of_algebraic...

    Modular lattice: a lattice whose elements satisfy the additional modular identity. Distributive lattice: a lattice in which each of meet and join distributes over the other. Distributive lattices are modular, but the converse does not hold. Boolean algebra: a complemented distributive lattice. Either of meet or join can be defined in terms of ...

  6. Map of lattices - Wikipedia

    en.wikipedia.org/wiki/Map_of_lattices

    An algebraic lattice is complete. (def) 10. A complete lattice is bounded. 11. A heyting algebra is bounded. (def) 12. A bounded lattice is a lattice. (def) 13. A heyting algebra is residuated. 14. A residuated lattice is a lattice. (def) 15. A distributive lattice is modular. [3] 16. A modular complemented lattice is relatively complemented ...

  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. Residuated lattice - Wikipedia

    en.wikipedia.org/wiki/Residuated_lattice

    In abstract algebra, a residuated lattice is an algebraic structure that is simultaneously a lattice x ≤ y and a monoid x•y which admits operations x\z and z/y, loosely analogous to division or implication, when x•y is viewed as multiplication or conjunction, respectively. Called respectively right and left residuals, these operations ...

  9. Supersolvable lattice - Wikipedia

    en.wikipedia.org/wiki/Supersolvable_lattice

    Hasse diagram of the noncrossing partition lattice on a 4 element set. The leftmost maximal chain is a chief chain. A group is supersolvable if and only if its lattice of subgroups is supersolvable. A chief series of subgroups forms a chief chain in the lattice of subgroups. [3] The partition lattice of a finite set is supersolvable.