An Infinite Antichain of Permutations
classification
🧮 math.CO
keywords
antichaininfiniteorderedpermutationsconstructivelycontainsdeletionentries
read the original abstract
We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.