1 The Foundations: Logic And Proofs 2 Basic Structures: Sets, Functions, Sequences, Sums, And Matrices 3 Algorithms 4 Number Theory And Cryptography 5 Induction And Recursion 6 Counting 7 Discrete Probability 8 Advanced Counting Techniques 9 Relations 10 Graphs 11 Trees 12 Boolean Algebra 13 Modeling Computation A Appendices expand_more
9.1 Relations And Their Properties 9.2 N-ary Relations And Their Applications 9.3 Representing Relations 9.4 Closures Of Relations 9.5 Equivalence Relations 9.6 Partial Orderings Chapter Questions expand_more
Problem 1RQ Problem 2RQ: a) What is a reflexive relation? b) What is a symmetric relation? c) What is an antisymmetric... Problem 3RQ: e an example of a relation on the set {1, 2,3,4} that is a) reflexive, symmetiic, and not... Problem 4RQ: a) How many reflexive relations are there on a set withnelements? b) How many symmetric relations... Problem 5RQ: a) Explain how ann-ary relation can be used to represent information about students at a university.... Problem 6RQ: a) Explain how to use a zero-one matrix to represent a relation on a finite set. b) Explain how to... Problem 7RQ: a) Explain how to use a directed graph to represent a relation on a finite set. b) Explain how to... Problem 8RQ: a) Define the reflexive closure and the symmetric closure of a relation. b) How can you construct... Problem 9RQ: a) Define the transitive closure of a relation. b) Can the transitive closure of a relation be... Problem 10RQ: a) Define an equivalence relation. b) Which relations on theset(a,b, c, d)are equivalence relations... Problem 11RQ: a) Show that congruence modulo in is an equivalence relation whenevermis a positive integer. b) Show... Problem 12RQ: a) What are the equivalence classes of an equivalence relation? b) What are the equivalence classes... Problem 13RQ: lain the relationship between equivalence relations on a set and partitions of this set. Problem 14RQ: a) Define a partial ordering. b) Show that the divisibility relation on the set of positive integers... Problem 15RQ: Explain how partial orderings on the setsA1andA2can be used to define a partial ordering on the... Problem 16RQ: a) Explain how to construct the Hasse diagram of a partial order on a finite set. b) Draw the Hasse... Problem 17RQ: a) Define a maximal element of a poset and the greatest element of a poset. b) Give an example of a... Problem 18RQ Problem 19RQ: a) Show that every finite subset of a lattice has a greatest lower bound and a least upper bound. b)... Problem 20RQ: a) Define a well-ordered set. b) Describe an algorithm for producing a totally ordered set... Problem 1SE: Let S be the set of all stings of English leers. Determine whether these relations are reflexive,... Problem 2SE: struct a relation on the set {a,b, c, d} that is a) reflexive, symmetric, but not transitive. b)... Problem 3SE: Show that the relationRonZZdefined by (a, b)R(c, d) if and only ifa+d=b+cis an equivalence relation. Problem 4SE: w that a subset of an antisymmetric relation is also antisymmetric. Problem 5SE: LetRbe a reflexive relation on a setA. Show thatRR2. Problem 6SE: Suppose thatR1andR2are reflexive relations on a set A. Show thatR1R2is irreflexive. Problem 7SE: pose thatR1andR2are reflexive relations on a setA.IsR1R2also reflexive? IsR1R2also reflexive? Problem 8SE: Suppose that R is a symmetric relation on a set A. Isalso symmetric? Problem 9SE: R1andR2be symmetric relations. IsR1R2also symmetric? IsR1R2also symmetric? Problem 10SE: A relationRis called circular ifaRbandbRcimply thatcRa.Show thatRis reflexive and circular if and... Problem 11SE: Show that a primary key in ann-ary relation is a primary key in any projection of this relation that... Problem 12SE: Is the primary key in ann-ary relation also a primary key in a larger relation obtained by taking... Problem 13SE: Show that the reflexive closure of the symmetric closure of a relation is the same as the symmetric... Problem 14SE: Rbe the relation on the set of all mathematicians that contains the ordered pair (a,b) if and only... Problem 15SE: a) Give an example to show that the transitive closure of the symmetric closure of a relation is not... Problem 16SE: a) LetSbe the set of subroutines of a computer program. Define the relationRbyPR Q if subroutine P... Problem 17SE: pose thatRandSare relations on a set A withRSsuch that the closures ofRandSwith respect to a... Problem 18SE: Show that the symmetric closure of the union of two relations is the union of their symmetric... Problem 19SE: Devise an algorithm, based on the concept of interior vertices, that finds the length of the longest... Problem 20SE: ch of these are equivalence relations on the set of all people? a) {(x,y) |xandyhave the same sign... Problem 21SE: How many different equivalence relations with exactly three different equivalence classes are there... Problem 22SE: Show that{(x,y)xyQ}is an equivalence relation on the set of real numbers, where Q denotes the set of... Problem 23SE: pose thatP1={A1,A2,....Am}andP2={B1,B2,....Bm}are both partitions of the setS. Show that the... Problem 24SE Problem 25SE Problem 26SE: Let P(S) be thesetof all partitions of the set S. Define the relationon P(S) byP1P2if P1is a... Problem 27SE: edule the tasks needed to cook a Chinese meal by specifying their order, if the Hasse diagram... Problem 28SE: Find all chains in the posets with the Hass diagrams shown in Exercises 25-27 in Section 9.6. Problem 29SE Problem 30SE: Find an antichain with the greatest number of elements in the poset with the Hasse diagram of... Problem 31SE: Show that every maximal chain in a finite poset (S,?)contains a minimal element of S, (A maximal... Problem 32SE Problem 33SE: w that in any group ofmn+1people there is either a list ofm+1people where a person in the list... Problem 34SE Problem 35SE Problem 36SE Problem 37SE Problem 38SE: LetRbe a quasi-ordering and let S be the relation on the set of equivalence classes ofRR1such that... Problem 39SE: w that the following properties hold for all elementsx,y, andzof a latticeL.... Problem 40SE: w that ifxandyare elements of a latticeL,thenxy=yif and only ifxy=x. A latticeLis bounded if it has... Problem 41SE: w that ifLis a bounded lattice with upper bound 1 and lower bound o then these properties hold for... Problem 42SE: w that every finite lattice is bounded. A lattice is called distributive... Problem 43SE: Give an example of a lattice that is not distributive. Problem 44SE: Show that the lattice(P(S),)whereP(S) is the power set of a finite setSis distributive. Problem 45SE: the lattice (Z+,)distributive? The complement of an elementaof a bounded latticeLwith upper bound 1... Problem 46SE: Give an example of a finite lattice where at least one element has more than one complement and at... Problem 47SE: w that the lattice(P(S))whereP(S)is the power set of a finite set S is complemented. Problem 48SE: Show that ifLis a finite distributive lattice, then an element ofLhas at most one complement. The... Problem 49SE: w that the game of Chomp with cookies arranged in an mnrectangular grid, described inExample... Problem 50SE: w that if(S,)has a greatest elementb,then a winning strategy for Chomp on this poset exists.... Problem 1CP Problem 2CP Problem 3CP Problem 4CP Problem 5CP Problem 6CP Problem 7CP Problem 8CP Problem 9CP Problem 10CP: Given the matrix representing relation on a finite set, find the matrix representing the reflexive... Problem 11CP Problem 12CP: en the matrix representing a relation on a finite set, find the matrix representing the transitive... Problem 13CP: Given the matrix representing a relation on a finite set, find the matrix representing the... Problem 14CP Problem 15CP Problem 1CAE Problem 2CAE Problem 3CAE Problem 4CAE Problem 5CAE: d the transitive closure of a relation of your choice on a set with at least 20 elements. Either use... Problem 6CAE: pute the number of different equivalence relations on a set withnelements for all positive... Problem 7CAE Problem 8CAE Problem 9CAE Problem 1WP: Discuss the concept of a fuzzy relation. How are fuzzy relations used? Problem 2WP: cribe the basic principles of relational databases, going beyond what was covered inSection 9.2. How... Problem 3WP: Explain how the Apriori algorithm is used to find frequent itemsets and strong association rules. Problem 4WP: Describe some applications of association rules in detail. Problem 5WP Problem 6WP Problem 7WP Problem 8WP Problem 9WP Problem 10WP Problem 11WP Problem 12WP format_list_bulleted