PartiallyOrderedSets
IsAntichain
checks whether a subset of the underlying set of a poset is an antichain of that poset
Calling Sequence
Parameters
Description
Examples
References
Compatibility
IsAntichain(P, L)
P
-
PartiallyOrderedSet
L
list of elements belonging to PartiallyOrderedSet P
The command IsAntichain(P, L) checks whether the elements in L represent an antichain in the partially ordered set P.
Remarks
IsAntichain will generate and store the transitive closure of P.
Terminology
A partially ordered set, or poset for short, is a pair (P, <=) where P is a set and <= is a partial order on P.
From now on, we fix a poset (P, <=). Two elements a and b of P are said comparable if either a <= b or b <= a holds, otherwise a and b are said incomparable.
A subset C of P is called a chain if any two elements of C are comparable. A chain C of P is said maximal if P does not admit another chain D of which C would be a proper subset.
A subset C of P is called an antichain if any two distinct elements of C are incomparable. An antichain C of P is said maximal if P does not admit another antichain D of which C would be a proper subset. We note that any singleton of P is both a chain and an antichain.
with⁡PartiallyOrderedSets:
T≔3,4,5,6,7,8,9:
Create a poset from a set and a non-strict partial order
V≔∅:leq≔`<=`:empty_poset≔PartiallyOrderedSet⁡V,leq
empty_poset≔< a poset with 0 elements >
Check whether a subset of the underlying set is an antichain
IsAntichain⁡empty_poset,0
true
S≔1,2,3,4,5:poset1≔PartiallyOrderedSet⁡S,leq
poset1≔< a poset with 5 elements >
Display this poset
DrawGraph⁡poset1
Check whether a subset (passed as a list) of the underlying set is an antichain
IsAntichain⁡poset1,1,3,5
false
IsAntichain⁡poset1,3
Create a poset from a set and an adjacency list of a partial order regarded as a directed graph
adjList5≔map2⁡map,`+`,Array⁡1,4,7,2,6,3,4,5,6,7,2
adjList5≔3,6,94,856789
poset5≔PartiallyOrderedSet⁡convert⁡T,list,adjList5
poset5≔< a poset with 7 elements >
DrawGraph⁡poset5
IsAntichain⁡poset5,5,3,7
IsAntichain⁡poset5,4,8
Richard P. Stanley: Enumerative Combinatorics 1. 1997, Cambridge Studies in Advanced Mathematics. Vol. 49. Cambridge University Press.
The PartiallyOrderedSets[IsAntichain] command was introduced in Maple 2025.
For more information on Maple 2025 changes, see Updates in Maple 2025.
See Also
PartiallyOrderedSets[Height]
PartiallyOrderedSets[IsChain]
PartiallyOrderedSets[LessEqual]
PartiallyOrderedSets[MaximalAntichains]
PartiallyOrderedSets[MaximalChains]
PartiallyOrderedSets[PartiallyOrderedSet]
PartiallyOrderedSets[Width]
Download Help Document