pith. sign in

arxiv: 2105.00711 · v1 · pith:77RFTFXLnew · submitted 2021-05-03 · 🧮 math.CO

A generalization of a theorem of Ern\'{e}

classification 🧮 math.CO
keywords numberpointsposetsmaximalcontainingequalsexactlygeneralization
0
0 comments X
read the original abstract

Let $X$ be a finite set, $Z \subseteq X$ and $y \notin X$. Marcel Ern\'{e} showed in 1981, that the number of posets on $X$ containing $Z$ as an antichain equals the number of posets $R$ on $X \cup \{ y \}$ in which the points of $Z \cup \{ y \}$ are exactly the maximal points of $R$. We prove the following generalization: For every poset $Q$ with carrier $Z$, the number of posets on $X$ containing $Q$ as an induced sub-poset equals the number of posets $R$ on $X \cup \{ y \}$ which contain $Q^d + A_y$ as an induced sub-poset and in which the maximal points of $Q^d + A_y$ are exactly the maximal points of $R$. Here, $Q^d$ is the dual of $Q$, $A_y$ is the singleton-poset on $y$, and $Q^d + A_y$ denotes the direct sum of $Q^d$ and $A_y$.

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.