Order theory
Page 1 of 1 • Share
Order theory
Might be worth a read since it has applicability to Charge Field modeling. Been offline for a bit after installing Linux.

Order theory
Order theory is a branch of mathematics which investigates the intuitive notion of order using binary relations. It provides a formal framework for describing statements such as "this is less than that" or "this precedes that". This article introduces the field and provides basic definitions. A list of ordertheoretic terms can be found in the order theory glossary.
https://en.wikipedia.org/wiki/Order_theory
http://www.personal.soton.ac.uk/gan/Roller.pdf
A "good" Hasse diagram
Although Hasse diagrams are simple as well as intuitive tools for dealing with finite posets, it turns out to be rather difficult to draw "good" diagrams. The reason is that there will in general be many possible ways to draw a Hasse diagram for a given poset. The simple technique of just starting with the minimal elements of an order and then drawing greater elements incrementally often produces quite poor results: symmetries and internal structure of the order are easily lost.
The following example demonstrates the issue. Consider the power set of a 4element set ordered by inclusion ⊆ {\displaystyle \subseteq } \subseteq . Below are four different Hasse diagrams for this partial order. Each subset has a node labelled with a binary encoding that shows whether a certain element is in the subset (1) or not (0):
Upward planarity
Main article: Upward planar drawing
This Hasse diagram of the lattice of subgroups of the dihedral group Dih4 has no crossing edges.
This Hasse diagram of the lattice of subgroups of the dihedral group Dih4 has no crossing edges.
If a partial order can be drawn as a Hasse diagram in which no two edges cross, its covering graph is said to be upward planar. A number of results on upward planarity and on crossingfree Hasse diagram construction are known:
If the partial order to be drawn is a lattice, then it can be drawn without crossings if and only if it has order dimension at most two.[5] In this case, a noncrossing drawing may be found by deriving Cartesian coordinates for the elements from their positions in the two linear orders realizing the order dimension, and then rotating the drawing counterclockwise by a 45degree angle.
If the partial order has at most one minimal element, or it has at most one maximal element, then it may be tested in linear time whether it has a noncrossing Hasse diagram.[6]
It is NPcomplete to determine whether a partial order with multiple sources and sinks can be drawn as a crossingfree Hasse diagram.[7] However, finding a crossingfree Hasse diagram is fixedparameter tractable when parametrized by the number of articulation points and triconnected components of the transitive reduction of the partial order.[8]
If the ycoordinates of the elements of a partial order are specified, then a crossingfree Hasse diagram respecting those coordinate assignments can be found in linear time, if such a diagram exists.[9] In particular, if the input poset is a graded poset, it is possible to determine in linear time whether there is a crossingfree Hasse diagram in which the height of each vertex is proportional to its rank.
https://en.wikipedia.org/wiki/Hasse_diagram

Order theory
Order theory is a branch of mathematics which investigates the intuitive notion of order using binary relations. It provides a formal framework for describing statements such as "this is less than that" or "this precedes that". This article introduces the field and provides basic definitions. A list of ordertheoretic terms can be found in the order theory glossary.
https://en.wikipedia.org/wiki/Order_theory
http://www.personal.soton.ac.uk/gan/Roller.pdf
A "good" Hasse diagram
Although Hasse diagrams are simple as well as intuitive tools for dealing with finite posets, it turns out to be rather difficult to draw "good" diagrams. The reason is that there will in general be many possible ways to draw a Hasse diagram for a given poset. The simple technique of just starting with the minimal elements of an order and then drawing greater elements incrementally often produces quite poor results: symmetries and internal structure of the order are easily lost.
The following example demonstrates the issue. Consider the power set of a 4element set ordered by inclusion ⊆ {\displaystyle \subseteq } \subseteq . Below are four different Hasse diagrams for this partial order. Each subset has a node labelled with a binary encoding that shows whether a certain element is in the subset (1) or not (0):
Upward planarity
Main article: Upward planar drawing
This Hasse diagram of the lattice of subgroups of the dihedral group Dih4 has no crossing edges.
This Hasse diagram of the lattice of subgroups of the dihedral group Dih4 has no crossing edges.
If a partial order can be drawn as a Hasse diagram in which no two edges cross, its covering graph is said to be upward planar. A number of results on upward planarity and on crossingfree Hasse diagram construction are known:
If the partial order to be drawn is a lattice, then it can be drawn without crossings if and only if it has order dimension at most two.[5] In this case, a noncrossing drawing may be found by deriving Cartesian coordinates for the elements from their positions in the two linear orders realizing the order dimension, and then rotating the drawing counterclockwise by a 45degree angle.
If the partial order has at most one minimal element, or it has at most one maximal element, then it may be tested in linear time whether it has a noncrossing Hasse diagram.[6]
It is NPcomplete to determine whether a partial order with multiple sources and sinks can be drawn as a crossingfree Hasse diagram.[7] However, finding a crossingfree Hasse diagram is fixedparameter tractable when parametrized by the number of articulation points and triconnected components of the transitive reduction of the partial order.[8]
If the ycoordinates of the elements of a partial order are specified, then a crossingfree Hasse diagram respecting those coordinate assignments can be found in linear time, if such a diagram exists.[9] In particular, if the input poset is a graded poset, it is possible to determine in linear time whether there is a crossingfree Hasse diagram in which the height of each vertex is proportional to its rank.
https://en.wikipedia.org/wiki/Hasse_diagram
Cr6 Admin
 Posts : 1151
Join date : 20140809
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum

