Hasse diagrams of posets with up to 7 elements, and the number of posets with 10 elements, without the use of computer programs

arXiv1710.10343MaRDI QIDQ6293141FDOQ6293141

Authors: Luiz F. Monteiro, Sonia M. Savini, Ignacio D. Viglizzo 

Publication date: 27 October 2017

Abstract: Let $P(n)$ be the set of all posets with $n$ elements. Let $P^{(j)}(n)$, $1leqjleq{2}^n,$ be the number of all posets with $n$ elements possessing exactly $j$ antichains. We have determined the numbers $P^{(j)}(7),$ $1leqjleq128$, and using a result of M.~Ern'e [Ern'e, M., On the cardinalities of finite topologies and the number of antichains in partially ordered sets, Discrete Mathematics 35 (1981), 119-133.], we compute $|P(10)|$ without the aid of any computer program. We include the Hasse diagrams of all the non-isomorphic posets of $P(7)$. We also present formulas for the number of connected posets of certain forms, and use them to compute $|P(n)|$ with $1lenle8$ by a different method.

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07)

This page was built for publication: Hasse diagrams of posets with up to 7 elements, and the number of posets with 10 elements, without the use of computer programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6293141)