maximalChains -- computes all maximal chains of a poset

Usage:

M = maximalChains P
Inputs:
- P, an instance of the type Poset,
Outputs:
- M, a list, all maximal chains of $P$

Description

A set of elements of $P$ is called a chain if every pair of elements of the set are comparable. A chain is maximal if it is not properly contained in any other chain of $P$.

i1 : maximalChains divisorPoset 30

o1 = {{1, 2, 6, 30}, {1, 2, 10, 30}, {1, 3, 6, 30}, {1, 3, 15, 30}, {1, 5,
     ------------------------------------------------------------------------
     10, 30}, {1, 5, 15, 30}}

o1 : List

Ways to use maximalChains:

maximalChains(Poset)

For the programmer

The object maximalChains is a method function.

The source of this document is in Posets.m2:4902:0.

maximalChains -- computes all maximal chains of a poset

Description

See also

Ways to use maximalChains:

For the programmer