Le lundi 15 janvier 2018 03:13:53 UTC+1, Victor Porton a écrit :
>
>
> http://localhost:/nbconvert/script/home/porton/math/namespaces/Comparison%20of%20counter-example%20algorithms.ipynb?download=true
>
> 500 : Internal Server Error
> The error was:
>
> Could not import nbconvert: No module na
On Monday, January 15, 2018 at 9:51:05 AM UTC+2, Jori Mäntysalo wrote:
>
> 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
I need to enumerate all labeled (that is NOT up-to-isomorphism) posets of N
elements.
The algorithm is here: https://stackoverflow.com/a/48270680/856090
I would like to write a patch to include this algorithm into Sage.
But Posets(3) is already taken to mean unlabeled (up-to-isomorphism) posets
On Mon, 15 Jan 2018, Victor Porton wrote:
I need to enumerate all labeled (that is NOT up-to-isomorphism) posets of N
elements.
The algorithm is here: https://stackoverflow.com/a/48270680/856090
No, that paper gives "method to construct pairwise non-isomorphic posets",
i.e. up-to-isomorphism.
On Mon, 2018-01-15 at 23:28 +0200, Jori Mäntysalo wrote:
> On Mon, 15 Jan 2018, Victor Porton wrote:
>
> > I need to enumerate all labeled (that is NOT up-to-isomorphism)
> posets of N
> > elements.
> > The algorithm is here: https://stackoverflow.com/a/48270680/856090
>
> No, that paper gives "m
On Mon, 15 Jan 2018, Victor Porton wrote:
Are you sure? I think I need non-automorphism permutations. Automorphism
by definition maps a Hasse diagram into itself, while I need to map it
into other diagrams, not into itself.
True, but I think that the converse should be doable by automorphism
