I want to filter the set of all connected posets with n points using sage. I want to filter out the posets whose underlying undirected graph of its Hasse diagram is not a tree (equivalently, the incidence algebra is not hereditary) and such that there is no element x in the poset P such that any other element of P is comparable to y. Is there an easy method to do this with sage?
Maybe something like this
sage: def banana(n):
....: for P in posets(n):
....: if not P.is_connected():
....: continue
....: H = P.hasse_diagram()
....: if H.to_undirected().is_tree():
....: continue
....: dg = H.transitive_closure()
....: if any(dg.degree(x) == n - 1 for x in dg):
....: continue
....: yield P
Asked: 2020-11-29 11:17:39 +0100
Seen: 210 times
Last updated: Nov 29 '20
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
