enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Partially ordered set - Wikipedia

    en.wikipedia.org/wiki/Partially_ordered_set

    A partially ordered set (poset for short) is an ordered pair = (,) consisting of a set (called the ground set of ) and a partial order on . When the meaning is clear from context and there is no ambiguity about the partial order, the set X {\displaystyle X} itself is sometimes called a poset.

  3. Lattice (order) - Wikipedia

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

    A continuous lattice is a complete lattice that is continuous as a poset. An algebraic lattice is a complete lattice that is algebraic as a poset. Both of these classes have interesting properties. For example, continuous lattices can be characterized as algebraic structures (with infinitary operations) satisfying certain identities.

  4. Differential poset - Wikipedia

    en.wikipedia.org/wiki/Differential_poset

    In mathematics, a differential poset is a partially ordered set (or poset for short) satisfying certain local properties. (The formal definition is given below.) This family of posets was introduced by Stanley (1988) as a generalization of Young's lattice (the poset of integer partitions ordered by inclusion), many of whose combinatorial properties are shared by all differential posets.

  5. Join and meet - Wikipedia

    en.wikipedia.org/wiki/Join_and_meet

    A partially ordered set that is both a join-semilattice and a meet-semilattice is a lattice. A lattice in which every subset, not just every pair, possesses a meet and a join is a complete lattice. It is also possible to define a partial lattice, in which not all pairs have a meet or join but the operations (when defined) satisfy certain axioms ...

  6. Glossary of order theory - Wikipedia

    en.wikipedia.org/wiki/Glossary_of_order_theory

    A poset D is said to be a directed complete poset, or dcpo, if every directed subset of D has a supremum. Distributive. A lattice L is called distributive if, for all x, y, and z in L, we find that x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z). This condition is known to be equivalent to its order dual.

  7. Lattice (group) - Wikipedia

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

    In geometry and group theory, a lattice in the real coordinate space is an infinite set of points in this space with the properties that coordinate-wise addition or subtraction of two points in the lattice produces another lattice point, that the lattice points are all separated by some minimum distance, and that every point in the space is within some maximum distance of a lattice point.

  8. Geometric lattice - Wikipedia

    en.wikipedia.org/wiki/Geometric_lattice

    A lattice is a poset in which any two elements and have both a least upper bound, called the join or supremum, denoted by , and a greatest lower bound, called ...

  9. Complete lattice - Wikipedia

    en.wikipedia.org/wiki/Complete_lattice

    If a complete lattice is freely generated from a given poset used in place of the set of generators considered above, then one speaks of a completion of the poset. The definition of the result of this operation is similar to the above definition of free objects, where "sets" and "functions" are replaced by "posets" and "monotone mappings".