next | previous | forward | backward | up | top | index | toc | Macaulay2 web site
Posets :: Poset

Poset -- a class for partially ordered sets (posets)

Description

This class is a type of HashTable which represents finite posets. It consists of a ground set, a list of relationships a,b where a ≤b, and a matrix encoding these relations.
i1 : G = {1,2,3,4};                  -- the ground set
i2 : R = {{1,2},{1,3},{2,4},{3,4}};  -- a list of relations "generating" all relations
i3 : P = poset(G, R)                 -- the poset with its relations matrix computed

o3 = Poset{cache => CacheTable{}                        }
           GroundSet => {1, 2, 3, 4}
           RelationMatrix => | 1 1 1 1 |
                             | 0 1 0 1 |
                             | 0 0 1 1 |
                             | 0 0 0 1 |
           Relations => {{1, 2}, {1, 3}, {2, 4}, {3, 4}}

o3 : Poset

See also

Functions and methods returning an object of class Poset :

Methods that use an object of class Poset :

For the programmer

The object Poset is a type, with ancestor classes HashTable < Thing.