On Mon, 15 Jan 2018, Victor Porton wrote:
So I have no tool to enumerate not up-to-isomorphism :-(
At least you can re-compute OEIS serie A001035 by
[sum(sum(factorial(i)/P.hasse_diagram().automorphism_group(return_group=False,
order=True)) for P in Posets(i)) for i in range(6)]
so I guess the right direction is to use automorphism group of the Hasse
diagram. A digraph d can be translated to poset just by Poset(d).
Another issue: I need only posets greater than a certain fixed poset
Please give an example. What would be a poset "greater" than, say,
posets.DiamondPoset(5)?
By the way, can anyone give me CPU power of a supercomputer for free?
Try to make a paper together with someone in Finland... 1000 CPU hours is
automatically available here for any researcher in any university, more by
asking.
--
Jori Mäntysalo
