On Thu, 30 Nov 2017, Christian Stump wrote:
How big is your n?
not very big, I aim for the biggest n for which I can loop through all
permutations
of n and compute some numbers. I expect this to be between 10 and 14.
"Almost all" finite posets are connected, so uniform distribution of
all posets would work too for bigger n.
how would I get uniform distribution on all posets?
I meant that it won't help you to discard unconnected ones.
There is a code for generating posets, see attachment at
https://trac.sagemath.org/ticket/14110 , but unfortunately it has not been
integrated to Sage. I just tested and it takes about 2,2 seconds to
generate 11-element posets (there are 46749427 of those) and 38 seconds
for 12-element posets. I guess you could use that up to 14 elements.
--
Jori Mäntysalo
