Processing math: 100%
Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

asked 6 years ago

sagequstions gravatar image

Finding distributive lattices up to an identification

I want for a given natural number n obtain all connected distributive lattices on n points where two such distributive lattices L1 and L2 get identified in case they are isomorphic as posets or L1 is isomorphic to the opposite of L2.

I know how to obtain the distributive lattices as follows in sage:

n=3 posets = [p for p in Posets(n) if p.has_bottom() and p.has_top() and p.is_lattice()] lattices = [p for p in posets if LatticePoset(p).is_distributive()]

But I am not sure how to add the further condition as stated above.

So for n=3 the result should for example be that there are 2 distributive lattices up to the above identification.

Finding distributive lattices up to an identification

I want for a given natural number n obtain all connected distributive lattices on n points where two such distributive lattices L1 and L2 get identified in case they are isomorphic as posets or L1 is isomorphic to the opposite of L2.

I know how to obtain the distributive lattices as follows in sage:

n=3 n=3

posets = [p for p in Posets(n) if p.has_bottom() and p.has_top() and p.is_lattice()] p.is_lattice()]

lattices = [p for p in posets if LatticePoset(p).is_distributive()]

But I am not sure how to add the further condition as stated above.

So for n=3 the result should for example be that there are 2 distributive lattices up to the above identification.

Finding distributive lattices up to an identification

I want for a given natural number n obtain all connected distributive lattices on n points where two such distributive lattices L1 and L2 get identified in case they are isomorphic as posets or L1 is isomorphic to the opposite of L2.

I know how to obtain the distributive lattices as follows in sage:

n=3n=5

posets = [p for p in Posets(n) if p.has_bottom() and p.has_top() and p.is_lattice()]

lattices = [p for p in posets if LatticePoset(p).is_distributive()]

But I am not sure how to add the further condition as stated above.

So for n=3 n=5 the result should for example be that there are 2 distributive lattices up to the above identification.

Finding distributive lattices up to an identification

I want for a given natural number n obtain all connected distributive lattices on n points where two such distributive lattices L1 and L2 get identified in case they are isomorphic as posets or L1 is isomorphic to the opposite of L2.

I know how to obtain the distributive lattices as follows in sage:

n=5

posets = [p for p in Posets(n) if p.has_bottom() and p.has_top() and p.is_lattice()]

lattices = [p for p in posets if LatticePoset(p).is_distributive()]

But I am not sure how to add the further condition as stated above.

So for n=5 the result should for example be that there are 2 distributive lattices up to the above identification.