enow.com Web Search

  1. Ads

    related to: define poset with example pdf file converter i love pdf

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. Poset topology - Wikipedia

    en.wikipedia.org/wiki/Poset_topology

    In mathematics, the poset topology associated to a poset (S, ≤) is the Alexandrov topology (open sets are upper sets) on the poset of finite chains of (S, ≤), ordered by inclusion. Let V be a set of vertices. An abstract simplicial complex Δ is a set of finite sets of vertices, known as faces , such that

  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. Graded poset - Wikipedia

    en.wikipedia.org/wiki/Graded_poset

    A power set, partially ordered by inclusion, with rank defined as number of elements, forms a graded poset. In mathematics, in the branch of combinatorics, a graded poset is a partially-ordered set (poset) P equipped with a rank function ρ from P to the set N of all natural numbers. ρ must satisfy the following two properties:

  6. Dedekind–MacNeille completion - Wikipedia

    en.wikipedia.org/wiki/Dedekind–MacNeille...

    A given partially ordered set may have several different completions. For instance, one completion of any partially ordered set S is the set of its downwardly closed subsets ordered by inclusion. S is embedded in this (complete) lattice by mapping each element x to the lower set of elements that are less than or equal to x.

  7. Ideal (order theory) - Wikipedia

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

    For example, the ideal completion of a given partial order P is the set of all ideals of P ordered by subset inclusion. This construction yields the free dcpo generated by P . An ideal is principal if and only if it is compact in the ideal completion, so the original poset can be recovered as the sub-poset consisting of compact elements.

  1. Ads

    related to: define poset with example pdf file converter i love pdf