Dedekind-MacNeil completion of finite posets

[nthiery]

The title says it all.

See also: http://en.wikipedia.org/wiki/Dedekind%E2%80%93MacNeille_completion

CC: @sagetrac-sage-combinat

Component: combinatorics

Keywords: poset, lattice

Author: Frédéric Chapoton

Branch/Commit: afbafea

Reviewer: Nathann Cohen

Issue created by migration from https://trac.sagemath.org/ticket/12916

[fchapoton]

comment:1

I have made a small patch, in the sage-combinat queue, just using the naive algorithm and therefore not very efficient. Is this useful ? Should I put it here ?

[nthiery]

comment:2

Replying to @fchapoton:

I have made a small patch, in the sage-combinat queue, just using the naive algorithm and therefore not very efficient. Is this useful ? Should I put it here ?

Yes; I would even tend to get it into Sage as a provocation: any expert reading the code will think "yikes, I can do sooo much better". And will do it :-)

[fchapoton]

Attachment: trac_12916_completion_by_cuts-fc.patch.gz

a naive implementation

[fchapoton]

Commit: 93cefff

[fchapoton]

New commits:

93cefff

trac #12916 : implements the Dedekind-MacNeil completion of posets

[fchapoton]

Branch: u/chapoton/12916

[fchapoton]

Author: Frédéric Chapoton

[fchapoton]

Changed keywords from none to poset, lattice