This tool displays on the screen the Hasse diagram of a ranked poset defined by its covering relation. The relation itself should be encoded in a file located on your computer. The encoding instructions are below. In order to display the poset just upload the file with its encoding to the server. The program will validate the encoding and report problems, if there are any. It will also check whether or not the poset is ranked. With the current version of the tool one can display Hasse diagrams of ranked posets only.
The poset file is a text (ASCII) file with the number of lines equal to the number of poset elements, that is one line per element. For each element p of P the corresponding line must contain the following information on p:
Here:
Moreover, the file must satisfy the following claims:
Poset | Encoding | Comments |
---|---|---|
![]() |
000 # the bottom vertex 001 000 # first level 010 000 100 000 011 001 010 # second level 101 001 100 110 010 100 111 011 101 110 # the top level |
000 is the label empty line, ignored vertex 001 covers 000 vertex 010 covers 000 vertex 100 covers 000 vertex 011 covers 001 and 010 vertex 101 covers 001 and 100 vertex 110 covers 010 and 100 the top vertex covering 3 other vertices |
Check Gallery of Posets for more examples.
The encoding in this case is similar to the one above. The only difference is that every line of text must contain information on the weight of the corresponsing poset element.
The poset file is a text (ASCII) file with the number of lines equal to the number of poset elements, that is one line per element. For each element p of P the corresponding line must contain the following information on p:
Here:
Moreover, the file must satisfy the following claims:
Poset | Encoding | Comments |
---|---|---|
![]() |
000 1 # the bottom vertex 001 1 000 # first level 010 2 000 100 -1 000 011 3 001 010 # second level 101 3 001 100 110 2 010 100 111 1 011 101 110 # the top level |
000 is the label, 1 is the weight empty line, ignored vertex 001 covers 000 vertex 010 covers 000 vertex 100 covers 000 and has negative weight vertex 011 covers 001 and 010 vertex 101 covers 001 and 100 vertex 110 covers 010 and 100 the top vertex covering 3 other vertices |
Last modified: Mon, Jan 23, 2023.