Skip to main content

Timeline for Proving that a poset is a lattice

Current License: CC BY-SA 4.0

14 events
when toggle format what by license comment
Jun 7 at 5:26 history edited Jukka Kohonen
tag fix (order lattices)
Feb 3, 2022 at 11:11 history edited Martin Sleziak CC BY-SA 4.0
added a Wayback Machine link for the dead link
Mar 17, 2013 at 6:36 vote accept Martin Rubey
Oct 10, 2010 at 10:07 comment added Martin Rubey @Bjorn: why the tag rings and algebras?
Oct 10, 2010 at 6:04 history edited Bjørn Kjos-Hanssen
edited tags
Sep 29, 2010 at 1:59 answer added Joel David Hamkins timeline score: 3
Sep 28, 2010 at 18:43 comment added Niemi I see. In this setting, finding out whether an element is smaller than another element basically becomes a well-known graph theory problem: You can interpret the pairs from the convering relation as a directed edge in a graph and look for a path from one element to another. There should be several techniques to solve this problem efficiently. In fact, the whole problems seems to me more like a problem that should be tackled with graph theory.
Sep 28, 2010 at 18:42 answer added David E Speyer timeline score: 15
Sep 28, 2010 at 18:32 history edited Martin Rubey CC BY-SA 2.5
yet more info
Sep 28, 2010 at 18:26 comment added JBL As Martin wrote, he understands the cover relations (i.e., when one element is larger than another and nothing lies between them), but this doesn't necessarily convey understanding of order relations among more widely separated elements.
Sep 28, 2010 at 18:08 comment added Niemi What do you mean by "it seems not so easy to find out whether one element is smaller than the other"? In what way is this information not directly provided by the order relation that comes with the poset? (this would normally be a comment and not an answer, but I cannot leave comments yet)
Sep 28, 2010 at 17:56 history edited Martin Rubey CC BY-SA 2.5
slightly more info
Sep 28, 2010 at 17:50 answer added Tony Huynh timeline score: 6
Sep 28, 2010 at 17:19 history asked Martin Rubey CC BY-SA 2.5