Hasse diagram - Wikipedia, the free encyclopedia - The Diigo Meta page

• 21 Nov 12
  

  rocketshooter
  • used to represent a finite partially ordered set
  • 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 covers x (that is, whenever x < y and there is no z such that x < z < y)
  • curves may cross each other but must not touch any vertices other than their endpoints

  1 more annotation...

• 30 Mar 12
  

  Doug Breitbart

  set mathematics graph Hasse diagram

• 19 Aug 08
  

  David Soergel

  graph layout theory

• 09 Jun 08
  

  clementi1832

  hasse diagram algebra set theory math mathematics graph

• 03 Mar 08
  

  Jay Dugger

  In the mathematical discipline known as order theory, a Hasse diagram (pronounced /ˈhɑːsə/ HAHS uh), named after Helmut Hasse (1898–1979)) is a simple picture of a finite partially ordered set, forming a drawing of the transitive reduction of the pa

  distributed graph mathematics wikipedia visualization wiki order set

• 30 May 07
  

  Todd Clegg

  Wikipedia Programming

• 29 May 07
  

  Andrew Gilmartin

  to-read

Would you like to comment?

Join Diigo for a free account, or sign in if you are already a member.