Download presentation

Presentation is loading. Please wait.

Published bySebastian McManus Modified over 4 years ago

1
CSE 211- Discrete Structures1 Relations Ch 2 schaums, Ch 7 Rosen

2
Hasse Diagram 2CSE 211- Discrete Structures

3
Hasse Diagram Example 3CSE 211- Discrete Structures

4
4 Hasse Diagrams Consider the graph for a finite poset ({1,2,3,4},) When we KNOW its a poset, we can simplify the graph 43214321 43214321 Called the Hassediagram CSE 211- Discrete Structures

5
5 Hasse Diagram For the poset ({1,2,3,4,6,8,12}, |) CSE 211- Discrete Structures

6
6

7
7 Greatest Element Least Element Maximal Element Minimal Element Upper Bound Lower Bound Greatest lower bound Least Upper bound

8
CSE 211- Discrete Structures8 Find the lower and upper bounds of the subsets {a, b, c}, {j, h}, and {a, c, d, f}. The upper bounds of {a, b, c} are e, f, j, h and its lower bound is a. There is no upper bounds of {j, h}. And its lower bounds are a, b, c, d, e, f. The upper bounds of {a, c, d, f} are f, h and j. and its lower bound is a. Find the greatest lower bound and the least upper bound of {b, d, g}

9
9 Lattices A partially ordered set in which every pair of elements has both a least upper bound and a greatest lower bound is called a lattice.

10
10

Similar presentations

Presentation is loading. Please wait....

OK

CSE 231 : Advanced Compilers Building Program Analyzers.

CSE 231 : Advanced Compilers Building Program Analyzers.

© 2019 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google