A generalization of a theorem of Ern\'{e}
Combinatorics
2021-05-04 v1
Abstract
Let be a finite set, and . Marcel Ern\'{e} showed in 1981, that the number of posets on containing as an antichain equals the number of posets on in which the points of are exactly the maximal points of . We prove the following generalization: For every poset with carrier , the number of posets on containing as an induced sub-poset equals the number of posets on which contain as an induced sub-poset and in which the maximal points of are exactly the maximal points of . Here, is the dual of , is the singleton-poset on , and denotes the direct sum of and .
Cite
@article{arxiv.2105.00711,
title = {A generalization of a theorem of Ern\'{e}},
author = {Frank a Campo},
journal= {arXiv preprint arXiv:2105.00711},
year = {2021}
}
Comments
15 pages, 4 figures