Atmiya Institute of Technology & Science

Slides:



Advertisements
Similar presentations
Partial Orderings Section 8.6.
Advertisements

Relations Relations on a Set. Properties of Relations.
8.6 Partial Orderings. Definition Partial ordering– a relation R on a set S that is Reflexive, Antisymmetric, and Transitive Examples? R={(a,b)| a is.
Discrete Mathematics Lecture # 16 Inverse of Relations.
Discrete Structures Chapter 5 Relations Nurul Amelina Nasharuddin Multimedia Department.
CSE115/ENGR160 Discrete Mathematics 05/03/11 Ming-Hsuan Yang UC Merced 1.
Relations binary relations xRy on sets x  X y  Y R  X  Y Example: “less than” relation from A={0,1,2} to B={1,2,3} use traditional notation 0 < 1,
Discrete Mathematics Lecture#11.
Partially Ordered Sets Basic Concepts
1 Partial Orderings Based on Slides by Chuck Allison from Rosen, Chapter 8.6 Modified by.
Partially Ordered Sets (POSets)
Relations Chapter 9.
Chapter 9 1. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing.
Sets, POSets, and Lattice © Marcelo d’Amorim 2010.
1 Partial Orderings Aaron Bloomfield CS 202 Rosen, section 7.6.
Discrete Structures – CNS2300
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Discrete Math for CS Binary Relation: A binary relation between sets A and B is a subset of the Cartesian Product A x B. If A = B we say that the relation.
2.6 Equivalence Relation §1.Equivalence relation §Definition 2.18: A relation R on a set A is called an equivalence relation if it is reflexive, symmetric,
Chapter 9. Section 9.1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R ⊆ A × B. Example: Let A = { 0, 1,2 } and.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
Relations, Functions, and Countability
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Relations and their Properties
Sets, Relations, and Lattices
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
Sets and Subsets Set A set is a collection of well-defined objects (elements/members). The elements of the set are said to belong to (or be contained in)
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
Discrete Mathematics Lecture # 15 Types of Relations (contd.)
1 Partial Orderings Aaron Bloomfield CS 202 Epp, section ???
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Unit II Discrete Structures Relations and Functions SE (Comp.Engg.)
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
1 Equivalence relations Binary relations: –Let S1 and S2 be two sets, and R be a (binary relation) from S1 to S2 –Not every x in S1 and y in S2 have such.
Chap. 7 Relations: The Second Time Around
1 Partial Orderings Based on Slides by Chuck Allison from Rosen, Chapter 8.6 Modified by.
Advanced Digital Designs Jung H. Kim. Chapter 1. Sets, Relations, and Lattices.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 41 May 7, 2008.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
1 Partial Orderings Epp, section Introduction An equivalence relation is a relation that is reflexive, symmetric, and transitive A partial ordering.
Binary Relation: A binary relation between sets A and B is a subset of the Cartesian Product A x B. If A = B we say that the relation is a relation on.
Chapter 5 Relations and Operations
CSE 2813 Discrete Structures
Partial Orders.
Partial Orderings CSE 2813 Discrete Structures.
Partial Orders (POSETs)
CSE15 Discrete Mathematics 05/03/17
Introduction to Relations
Learn about relations and their basic properties
Equivalence Relations
6.1 Partially Ordered Sets
Relations Chapter 9.
Partial Orderings.
Relations and Digraphs
Cartesian product Given two sets A, B we define their Cartesian product is the set of all the pairs whose first element is in A and second in B. Note that.
Aaron Bloomfield CS 202 Epp, section ???
CS2210 Discrete Structures Relations
Equivalence Relations
Discrete Math (2) Haiming Chen Associate Professor, PhD
Formal Definition and Examples
CSE 321 Discrete Structures
Discrete Math (2) Haiming Chen Associate Professor, PhD
Background material.
9.5 Equivalence Relations
Relations.
교환 학생 프로그램 내년 1월 중순부터 6월 초 현재 학부 2,3 학년?
Background material.
Foundations of Discrete Mathematics
Lecture # 16 Inverse of Relations
Ø Let the universe set U={1,2,3,...,10}.
Presentation transcript:

Atmiya Institute of Technology & Science Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham Gurukul Rajkot

Question Bank of POSET

Consider the relation of divisibility ‘|’ of the set Z of integers Consider the relation of divisibility ‘|’ of the set Z of integers. Is the relation an ordering of Z? Consider P(S) as the power set, i.e. the set of all subsets of a given set S.then investigate (P(S),) as a partially order set ,in which the symbol  denotes the relation of set inclusion Give an example of R which is both a partial ordering relation and equivalence relation

Let R be a binary relation on the set of all positive integers such that R = {(a,b) : a-b is an odd integer}. Investigate the relation R for reflexive , symmetric , antisymmetric ,transitive and also R is partial ordering relation? If a relation R is transitive , then prove that its inverse relation R-1 is also transitive. Let A={1,2,3,4} and consider the relation R={(1,1),(1,2),(1,3),(2,2),(2,4),(3,3),(3,4),(1, 4),(4,4)}.show that R is partial ordering and draw its Hasse diagram.

Draw the Hasse Diagram of the following POSETs <{1,2,3,4,6,9},|> <{3,6,12,36,72},|> <{2,3,4,9,12,18},|> <{2,3,5,30,60,120,180,360},|> Let A = {1,2,3,4,12} be defined by the partial order of divisibility on A, that is if a and b  A , a ≤ b iff a | b. draw the Hasse diagram of the POSET <A, ≤> Let S = {1,2,3} and A = P(S). Draw the Hasse diagram of the POSET with the partial order  (Inclusion)

Consider N = {1,2,3,……} be ordered by divisibility Consider N = {1,2,3,……} be ordered by divisibility. State whether each of the following subsets of N is linearly ordered {16,4,2} {3,2,15} {2,4,8,12} {6} {5,15,30} Let dm denote the set of divisor of m ordered by divisibility. Draw the Hasse diagrams of d15 d16 d17

Find two incomparable elements in the following POSETs <{1,2,4,6,8},|> Let D100 = {1,2,4,5,10,20,25,50,100} whose all the elements are divisors of 100. Let the relation ≤ be the relation | (divides) be a partial ordering on D100 Determine the GLB of B where B = {10,20} Determine the LUB of B where B = {10,20} Determine the GLB of B where B = {5,10,20,25} Determine the LUB of B where B = {5,10,20,25}

Draw the Hasse diagram for divisibility on the following Sets Draw the Hasse diagram for the “Less than or equal to” relation on the set A = {0,2,5,10,11,15} Draw the Hasse diagram for divisibility on the following Sets {1,2,3,4,5,6,7,8} {1,2,3,5,7,11,13} {1,2,3,6,12,24,36,48} {1,2,4,8,16,32,64}