ASKSAGE: Sage Q&A Forum - Latest question feedhttp://ask.sagemath.org/questions/Q&A Forum for SageenCopyright Sage, 2010. Some rights reserved under creative commons license.Mon, 15 Jun 2020 14:38:04 -0500Obtaining the free distributive lattice in sagehttp://ask.sagemath.org/question/49518/obtaining-the-free-distributive-lattice-in-sage/ Is there a way to obtain the free distributive lattice on $n$ generators with sage( empty joins and empty meets are disallowed would be preferable, but the other case is also fine)? See https://en.wikipedia.org/wiki/Distributive_lattice#Free_distributive_lattices .
Im especially interested in the case n=4, where this lattice would have 166 points.
klaaaSun, 12 Jan 2020 10:46:24 -0600http://ask.sagemath.org/question/49518/Automorphisms of distributive lattices via sagehttp://ask.sagemath.org/question/52023/automorphisms-of-distributive-lattices-via-sage/ Let L be a finite distributive lattice.
Is it possible to calculate the automorphism group G of L via SAGE? Can one display all the elements of G and their orders?klaaaMon, 15 Jun 2020 14:38:04 -0500http://ask.sagemath.org/question/52023/Obtaining the rowmotion bijection on distributive lattices via sagehttp://ask.sagemath.org/question/51669/obtaining-the-rowmotion-bijection-on-distributive-lattices-via-sage/ In the article https://arxiv.org/abs/1108.1172 a bijection F on finite distributive lattices called rowmotion is introduced.
Given a poset P and let L(P) denote the distributive lattice of order ideals of P, the bijection F: L(P) -> L(P) is defined as F(I)=the order ideal generated by the minimal elements of P not in I for a given order ideal I.
Is there a way to obtain this bijection F and its inverse for an explictly given distributive lattice in SAGE?
So the input in sage is a distributive lattice such as
B4=posets.BooleanLattice(4)
display(B4)
and the output should be the bijection F (and its inverse) as a map on the points of the distributive lattice.klaaaMon, 01 Jun 2020 04:00:06 -0500http://ask.sagemath.org/question/51669/Lattice of antichains in SAGEhttp://ask.sagemath.org/question/49553/lattice-of-antichains-in-sage/ Given a finite poset P in SAGE. Can one obtain the lattice of antichains or the lattice of order ideals of P as a lattice in SAGE? I just saw how to obtain those things as sets but not as posets.klaaaTue, 14 Jan 2020 14:40:09 -0600http://ask.sagemath.org/question/49553/Lattices via sagehttp://ask.sagemath.org/question/49380/lattices-via-sage/ I have three questions on lattices:
-Is there a way to obtain the minimal number of generators of a lattices with sage?
-Is there a way to obtain the lattice of all subspaces of a vector space over a finite field with q elements in sage?
-Is there a quick way to obtain all distributive lattices on n points in sage (that is, without filtering them from the set of all posets on n points).
klaaaSun, 05 Jan 2020 13:01:53 -0600http://ask.sagemath.org/question/49380/Obtaining lattices quickly in SAGEhttp://ask.sagemath.org/question/38936/obtaining-lattices-quickly-in-sage/At the moment I use
posets = [p for p in Posets(n) if p.is_connected() and p.is_lattice()]
to obtain all connected lattices via SAGE.
But this takes terrible long for n>=8. Is there a quicker way? It would somehow be natural when the connected lattices (or just connected posets) are saved in SAGE for some small n so that one does not have to filter trough the very large set of all posets. For example there are 53 connected lattices with 7 points , while there are 2045 posets on 7 points.sagequstionsThu, 21 Sep 2017 15:52:33 -0500http://ask.sagemath.org/question/38936/bond lattice of a graphhttp://ask.sagemath.org/question/26392/bond-lattice-of-a-graph/ I want to know whether bond lattice of a graph has been implemented in sage or not. If it is implemented what is the sage code for implementing bond lattice. Kindly tell related packages also in this case.
Thanks for your valuable time.GA316Mon, 30 Mar 2015 21:23:07 -0500http://ask.sagemath.org/question/26392/