coveringRelations -- computes the minimal list of generating relations of a poset

Synopsis

Usage:

R = coveringRelations P
Inputs:
- P, an instance of the type Poset,
Outputs:
- R, a list, the minimal list of generating relations of $P$

Description

A relation $a < b$ of elements in $P$ is a covering relation if there exists no $c$ in $P$ such that $a < c < b$. The set of covering relations is the minimal list of relations in $P$ that describes all relations of $P$.

i1 : coveringRelations divisorPoset 12

o1 = {{1, 2}, {1, 3}, {2, 4}, {2, 6}, {3, 6}, {4, 12}, {6, 12}}

o1 : List

Ways to use coveringRelations :

coveringRelations(Poset)

For the programmer

The object coveringRelations is a method function.

coveringRelations -- computes the minimal list of generating relations of a poset

Synopsis

Description

See also

Ways to use coveringRelations :

For the programmer