maximalAntichains -- computes all maximal antichains of a poset

Usage:

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

Description

A set of elements of $P$ is called an antichain if no two distinct elements of the set are comparable. An antichain is maximal if it is not properly contained in any other antichain of $P$.

i1 : maximalAntichains divisorPoset 30

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

o1 : List

Ways to use maximalAntichains:

maximalAntichains(Poset)

For the programmer

The object maximalAntichains is a method function.

The source of this document is in /build/macaulay2-88fgJW/macaulay2-1.25.11+ds/M2/Macaulay2/packages/Posets.m2:4875:0.

maximalAntichains -- computes all maximal antichains of a poset

Description

See also

Ways to use maximalAntichains:

For the programmer