On Tue, 4 Apr 2017, Robin van der veer wrote:
Thanks for your reply.To me the essence of the definition of join and
meetsemilattice is about joins/meets existing for ALL
pairs, as opposed to some pairs.
As a slow code you can just say something like
Matrix([join2(L, a, b) for a in L] for b i
Thanks for your reply.
To me the essence of the definition of join and meetsemilattice is about
joins/meets existing for ALL pairs, as opposed to some pairs. Hence having
a join/meet operation on any poset is not that unnatural, because almost
all posets have at least some pairs of element for w
On Mon, 3 Apr 2017, Robin van der veer wrote:
I wonder if there is any way to use the join or meet operations in arbitrary
posets?
How fast that should be? The trivial implementation is just 4 lines long,
here with monkey patch:
def join2(self, a, b):
j = self.subposet([e for e in self
Hello,
I wonder if there is any way to use the join or meet operations in
arbitrary posets?
It seems that these methods are only exposed in the classes of join- resp.
meet semilattices.
However, it would be very convenient if these methods were available in
general posets somehow, and would ju
