✳flâneur — a map of the web's best reading

Hasse diagram

en.wikipedia.org · 1,747 words · saved by 1 readers

In order theory, a Hasse diagram (; German: [ˈhasə]) is a type of mathematical diagram used to represent a finite partially ordered set, in the form of a drawing of its transitive reduction. Concretely, for a partially ordered set (S, ≤) one represents each element of S as a vertex in the plane and draws a line segment or curve that goes upward from x to y whenever y ≠ x and y covers x (that is, whenever x ≤ y and there is no z such that x ≤ z ≤ y).

Hasse diagram - Wikipedia Jump to content From Wikipedia, the free encyclopedia Visual depiction of a partially ordered set Not to be confused with Hess diagram . A Hasse diagram of the factors of 60 ordered by the is-a- divisor -of relation In order theory , a Hasse diagram ( / ˈ h æ s ə / ; German: [ ˈhasə ] ) is a type of mathematical diagram used to represent a finite partially ordered set , in the form of a drawing of its transitive reduction . Concretely, for a partially ordered set ( S , ≤ ) {\displaystyle (S,\leq )} one represents each element of S {\displaystyle S} as a vertex in the

Explore this link on the map →

related reading