# Relations Graphical View

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Introduction Recall that a relation between elements of two sets is a subset of their Cartesian product (of ordered pairs). A binary relation from a set A to a set B is a subset Spring 2006 R A B = {(a, b) a A, b B} Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 7.1, of Rosen Note the difference between a relation and a function: in a relation, each a A can map to multiple elements in B. Thus, relations are generalizations of functions. If an ordered pair (a, b) R then we say that a is related to b. We may also use the notation arb and a Rb. Relations Relations Graphical View To represent a relation, you can enumerate every element in R. A B Let A = {a 1, a 2, a 3, a 4, a 5 } and B = {b 1, b 2, b 3 } let R be a relation from A to B as follows: R = {(a 1, b 1 ), (a 1, b 2 ), (a 1, b 3 ), (a 2, b 1 ), (a 3, b 1 ), (a 3, b 2 ), (a 3, b 3 ), (a 5, b 1 )} a 1 a 2 a 3 a 4 a 5 b 1 b 2 b 3 You can also represent this relation graphically. Figure: Graphical Representation of a Relation Relations On a Set A relation on the set A is a relation from A to A. I.e. a subset of A A. The following are binary relations on N: R 1 = {(a, b) a b} R 2 = {(a, b) a, b N, a b Z} Reflexivity There are several properties of relations that we will look at. If the ordered pairs (a, a) appear in a relation on a set A for every a A then it is called reflexive. A relation R on a set A is called reflexive if a A ( (a, a) R ) R 3 = {(a, b) a, b N, a b = 2} Exercise: Give some examples of ordered pairs (a, b) N 2 that are not in each of these relations.

2 Reflexivity Symmetry I Recall the following relations; which is reflexive? R 1 = {(a, b) a b} R 2 = {(a, b) a, b N, a b Z} R 3 = {(a, b) a, b N, a b = 2} R 1 is reflexive since for every a N, a a. R 2 is also reflexive since a a = 1 is an integer. R 3 is not reflexive since a a = 0 for every a N. A relation R on a set A is called symmetric if (b, a) R (a, b) R for all a, b A. A relation R on a set A is called antisymmetric if [ ] ((a, ) a, b, b) R (b, a) R a = b for all a, b A. Symmetry II Symmetric Relations Some things to note: A symmetric relationship is one in which if a is related to b then b must be related to a. An antisymmetric relationship is similar, but such relations hold only when a = b. An antisymmetric relationship is not a reflexive relationship. A relation can be both symmetric and antisymmetric or neither or have one property but not the other! A relation that is not symmetric is not necessarily asymmetric. Let R = {(x, y) R 2 x 2 + y 2 = 1}. Is R reflexive? Symmetric? Antisymmetric? It is clearly not reflexive since for example (2, 2) R. It is symmetric since x 2 + y 2 = y 2 + x 2 (i.e. addition is commutative). It is not antisymmetric since ( 1 3, 8 3 ) R and ( 8 3, 1 3 ) R but Transitivity Transitivity s A relation R on a set A is called transitive if whenever (a, b) R and (b, c) R then (a, c) R for all a, b, c R. Equivalently, a, b, c A ( (arb brc) arc ) Is the relation R = {(x, y) R 2 x y} transitive? Yes it is transitive since (x y) (y z) x z. Is the relation R = {(a, b), (b, a), (a, a)} transitive? No since bra and arb but b Rb.

3 Transitivity s Is the relation {(a, b) a is an ancestor of b} Other Properties A relation is irreflexive if a [ (a, a) R ] transitive? Yes, if a is an ancestor of b and b is an ancestor of c then a is also an ancestor of b (who is the youngest here?). A relation is asymmetric if a, b [ (a, b) R (b, a) R ] Is the relation {(x, y) x 2 y} transitive? No. For example, (2, 4) R and (4, 10) R (i.e and 4 2 = 16 10) but 2 2 < 10 thus (2, 10) R. Lemma A relation R on a set A is asymmetric if and only if R is irreflexive and R is antisymmetric. Combining Relations Combining Relations Relations are simply sets, that is subsets of ordered pairs of the Cartesian product of a set. It therefore makes sense to use the usual set operations, intersection, union and set difference A \ B to combine relations to create new relations. Sometimes combining relations endows them with the properties previously discussed. For example, two relations may not be transitive alone, but their union may be. Let Then A = {1, 2, 3, 4} B = {1, 2, 3} R 1 = {(1, 2), (1, 3), (1, 4), (2, 2), (3, 4), (4, 1), (4, 2)} R 2 = {(1, 1), (1, 2), (1, 3), (2, 3)} R 1 R 2 = {(1, 1), (1, 2), (1, 3), (1, 4), (2, 2), (2, 3), (3, 4), (4, 1), (4, 2)} R 1 R 2 = {(1, 2), (1, 3)} R 1 \ R 2 = {(1, 4), (2, 2), (3, 4), (4, 1), (4, 2)} R 2 \ R 1 = {(1, 1), (2, 3} Powers of Relations Let R 1 be a relation from the set A to B and R 2 be a relation from B to C. I.e. R 1 A B, R 2 B C. The composite of R 1 and R 2 is the relation consisting of ordered pairs (a, c) where a A, c C and for which there exists and element b B such that (a, b) R 1 and (b, c) R 2. We denote the composite of R 1 and R 2 by R 1 R 2 Using this composite way of combining relations (similar to function composition) allows us to recursively define powers of a relation R. Let R be a relation on A. The powers, R n, n = 1, 2, 3,..., are defined recursively by R 1 = R R n+1 = R n R

4 Powers of Relations Powers of Relations Consider R = {(1), (2, 1), (3, 2), (4, 3)} R 2 = R 3 : R 4 : Notice that R n = R 3 for n=4, 5, 6,... The powers of relations give us a nice characterization of transitivity. Theorem A relation R is transitive if and only if R n R for n = 1, 2, 3,.... Representing Relations 0-1 Matrices I A 0-1 matrix is a matrix whose entries are either 0 or 1. We have seen ways of graphically representing a function/relation between two (different) sets specifically a graph with arrows between nodes that are related. We will look at two alternative ways of representing relations; 0-1 matrices and directed graphs. Let R be a relation from A = {a 1, a 2,..., a n } to B = {b 1, b 2,..., b m }. Note that we have induced an ordering on the elements in each set. Though this ordering is arbitrary, it is important to be consistent; that is, once we fix an ordering, we stick with it. In the case that A = B, R is a relation on A, and we choose the same ordering. 0-1 Matrices II 0-1 Matrices III The relation R can therefore be represented by a (n m) sized 0-1 matrix M R = [m i,j ] as follows. { 1 if (ai, b m i,j = j ) R 0 if (a i, b j ) R Intuitively, the (i, j)-th entry is 1 if and only if a i A is related to b j B. An important note: the choice of row or column-major form is important. The (i, j)-th entry refers to the i-th row and j-th column. The size, (n m) refers to the fact that M R has n rows and m columns. Though the choice is arbitrary, switching between row-major and column-major is a bad idea, since for A B, the Cartesian products A B and B A are not the same. In matrix terms, the transpose, (M R ) T does not give the same relation. This point is moot for A = B.

5 0-1 Matrices IV Matrix Representation a 1 a A 2 a 3 a 4 B {}}{ b 1 b 2 b 3 b Let A = {a 1, a 2, a 3, a 4, a 5 } and B = {b 1, b 2, b 3 } let R be a relation from A to B as follows: What is M R? R = {(a 1, b 1 ), (a 1, b 2 ), (a 1, b 3 ), (a 2, b 1 ), (a 3, b 1 ), (a 3, b 2 ), (a 3, b 3 ), (a 5, b 1 )} Let s take a quick look at the example from before. Clearly, we have a (5 3) sized matrix M R = Useful Characteristics Useful Characteristics Symmetry R is symmetric if and only if for all pairs (a, b), arb bra. In our defined matrix, this is equivalent to m i,j = m j,i for every pair i, j = 1, 2,..., n. A 0-1 matrix representation makes checking whether or not a relation is reflexive, symmetric and antisymmetric very easy. Reflexivity For R to be reflexive, a(a, a) R. By the definition of the 0-1 matrix, R is reflexive if and only if m i,i = 1 for i = 1, 2,..., n. Thus, one simply has to check the diagonal. Alternatively, R is symmetric if and only if M R = (M R ) T. Antisymmetry To check antisymmetry, you can use a disjunction; that is R is antisymmetric if m i,j = 1 with i j then m j,i = 0. Thus, for all i, j = 1, 2,..., n, i j, (m i,j = 0) (m j,i = 0). What is a simpler logical equivalence? i, j = 1, 2,..., n; i j ( (m i,j m j,i ) ) M R = Is R reflexive? Symmetric? Antisymmetric? Clearly it is not reflexive since m 2,2 = 0. It is not symmetric either since m 2,1 m 1,2. It is, however, antisymmetric. You can verify this for yourself. Combining Relations Combining relations is also simple union and intersection of relations is nothing more than entry-wise boolean operations. Union An entry in the matrix of the union of two relations R 1 R 2 is 1 if and only if at least one of the corresponding entries in R 1 or R 2 is one. Thus M R1 R 2 = M R1 M R2 Intersection An entry in the matrix of the intersection of two relations R 1 R 2 is 1 if and only if both of the corresponding entries in R 1 and R 2 is one. Thus M R1 R 2 = M R1 M R2 Count the number of operations

6 Combining Relations Composite Relations Let M R1 = 0 1 1, M R2 = What is M R1 R 2 and M R1 R M R1 R2 = 1 1 1, M R1 R2 = How does combining the relations change their properties? One can also compose relations easily with 0-1 matrices. If you have not seen matrix product before, you will need to read section M R1 = 1 1 0, M R2 = M R1 M R1 = M R1 M R2 = Latex notation: \circ, \odot. Composite Relations Directed Graphs Remember that recursively composing a relation R n, n = 1, 2,... gives a nice characterization of transitivity. Using these ideas, we can build that Warshall (a.k.a. Roy-Warshall) algorithm for computing the transitive closure (discussed in the next section). We will get more into graphs later on, but we briefly introduce them here since they can be used to represent relations. In the general case, we have already seen directed graphs used to represent relations. However, for relations on a set A, it makes more sense to use a general graph rather than have two copies of the set in the diagram. Directed Graphs I Directed Graphs II A graph consists of a set V of vertices (or nodes) together with a set E of edges. We write G = (V, E). A directed graph (or digraph) consists of a set V of vertices (or nodes) together with a set E of edges of ordered pairs of elements of V.

7 Directed Graphs III Directed Graph Representation I Usefulness Let A = {a 1, a 2, a 3, a 4 } and let R be a relation on A defined as: R = {(a 1, a 2 ), (a 1, a 3 ), (a 1, a 4 ), (a 2, a 3 ), (a 2, a 4 ) (a 3, a 1 ), (a 3, a 4 ), (a 4, a 3 ), (a 4, a 4 )} a 1 a 2 Again, a directed graph offers some insight as to the properties of a relation. Reflexivity In a digraph, a relation is reflexive if and only if every vertex has a self loop. Symmetry In a digraph, a represented relation is symmetric if and only if for every edge from x to y there is also a corresponding edge from y to x. a 3 a 4 Directed Graph Representation II Usefulness Closures Antisymmetry A represented relation is antisymmetric if and only if there is never a back edge for each directed edge between distinct vertices. Transitivity A digraph is transitive if for every pair of edges (x, y) and (y, z) there is also a directed edge (x, z) (though this may be harder to verify in more complex graphs visually). If a given relation R is not reflexive (or symmetric, antisymmetric, transitive) can we transform it into a relation R that is? Let R = {(1, 2), (2, 1), (2, 2), (3, 1), (3, 3)} is not reflexive. How can we make it reflexive? In general, we would like to change the relation as little as possible. To make this relation reflexive we simply have to add (1, 1) to the set. Inducing a property on a relation is called its closure. In the example, R is the reflexive closure. Closures I Closures II In general, the reflexive closure of a relation R on A is R where is the diagonal relation on A. = {(a, a) a A} Question: How can we compute the reflexive closure using a 0-1 matrix representation? Digraph representation? Similarly, we can create symmetric closures using the inverse of a relation. That is, R R 1 where R 1 = {(b, a) (a, b) R} Question: How can we compute the symmetric closure using a 0-1 matrix representation? Digraph representation? Also, transitive closures can be made using a previous theorem: Theorem A relation R is transitive if and only if R n R for n = 1, 2, 3,.... Thus, if we can compute R k such that R k R n for all n k, then R k is the transitive closure. To see how to efficiently do this, we present Warhsall s Algorithm. Note: your book gives much greater details in terms of graphs and connectivity relations. It is good to read these, but they are based on material that we have not yet seen.

8 Warshall s Algorithm I Key Ideas Warshall s Algorithm Warshall s Algorithm In any set A with A = n elements, any transitive relation will be built from a sequence of relations that has a length at most n. Why? Consider the case where A contains the relations (a 1, a 2 ), (a 2, a 3 ),..., (a n 1, a n ) Then (a 1, a n ) is required to be in A for A to be transitive. Thus, by the previous theorem, it suffices to compute (at most) R n. Recall that R k = R R k 1 is calculated using a Boolean matrix product. This gives rise to a natural algorithm Input Output : An (n n) 0-1 Matrix M R representing a relation R : A (n n) 0-1 Matrix W representing the transitive closure of R W = M R for k = 1,..., n do for i = 1,..., n do for j = 1,..., n do w i,j = w i,j (w i,k w k,j ) end end return W end Warshall s Algorithm Compute the transitive closure of the relation R = {(1, 1), (1, 2), (1, 4), (2, 2), (2, 3), (3, 1), (3, 4), (4, 1), (4, 4)} on A = {1, 2, 3, 4} Equivalence Relations Consider the set of every person in the world. Now consider a relation such that (a, b) R if a and b are siblings. Clearly, this relation is: reflexive, symmetric, and transitive. Such a unique relation is called and equivalence relation. A relation on a set A is an equivalence relation if it is reflexive, symmetric and transitive. Equivalence Classes I Equivalence Classes II Though a relation on a set A may not be an equivalence relation, we can defined a subset of A such that R does become an equivalence relation (for that subset). Let R be an equivalence relation on the set A and let a A. The set of all elements in A that are related to a is called the equivalence class of a. We denote this set [a] R (we omit R when there is no ambiguity as to the relation). That is, [a] R = {s (a, s) R, s A} Elements in [a] R are called representatives of the equivalence class. Theorem Let R be an equivalence relation on a set A. The following are equivalent: 1. arb 2. [a] = [b] 3. [a] [b] The proof in the book is a cicular proof.

9 Partitions I Partitions II Equivalence classes are important because they can partition a set A into disjoint non-empty subsets A 1, A 2,..., A l where each equivalence class is self-contained. Note that a partition satisfies these properties: l i=1 A i = A A i A j = for i j A i for all i For example, if R is a relation such that (a, b) R if a and b live in the US and live in the same state, then R is an equivalence relation that partitions the set of people who live in the US into 50 equivalence classes. Theorem Let R be an equivalence relation on a set S. Then the equivalence classes of R form a partition of S. Conversely, given a partition A i of the set S, there is an equivalence relation R that has the sets A i as its equivalence classes. Visual Interpretation Equivalence Relations I In a 0-1 matrix, if the elements are ordered into their equivalence classes, equivalence classes/partitions form perfect squares of 1s (and zeros else where). In a digraph, equivalence classes form a collection of disjoint complete graphs. Say that we have A = {1, 2, 3, 4, 5, 6, 7} and R is an equivalence relation that partitions A into A 1 = {1, 2}, A 2 = {3, 4, 5, 6} and A 3 = {7}. What does the 0-1 matrix look like? Digraph? Let R = {(a, b) a, b R, a b} Reflexive? Transitive? Symmetric? No, it is not since, in particular 4 5 but 5 4. Thus, R is not an equivalence relation. Equivalence Relations II Equivalence Relations III Let R = {{(a, b) a, b Z, a = b} Reflexive? Transitive? Symmetric? What are the equivalence classes that partition Z? For (x, y), (u, v) R 2 define R = {( (x, y), (u, v) ) x 2 + y 2 = u 2 + v 2} Show that R is an equivalence relation. What are the equivalence classes it defines (i.e. what are the partitions of R?

10 Equivalence Relations IV Given n, r N, define the set nz + r = {na + r a Z} For n = 2, r = 0, 2Z represents the equivalence class of all even integers. What n, r give the equivalence class of all odd integers? If we set n = 3, r = 0 we get the equivalence class of all integers divisible by 3. If we set n = 3, r = 1 we get the equivalence class of all integers divisible by 3 with a remainder of one. In general, this relation defines equivalence classes that are, in fact, congruence classes. (see chapter 2, to be covered later).

### Lecture 17 : Equivalence and Order Relations DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion

### Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

### 4. MATRICES Matrices

4. MATRICES 170 4. Matrices 4.1. Definitions. Definition 4.1.1. A matrix is a rectangular array of numbers. A matrix with m rows and n columns is said to have dimension m n and may be represented as follows:

### Week 5: Binary Relations

1 Binary Relations Week 5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all

### Diagonal, Symmetric and Triangular Matrices

Contents 1 Diagonal, Symmetric Triangular Matrices 2 Diagonal Matrices 2.1 Products, Powers Inverses of Diagonal Matrices 2.1.1 Theorem (Powers of Matrices) 2.2 Multiplying Matrices on the Left Right by

### Discrete Mathematics. Hans Cuypers. October 11, 2007

Hans Cuypers October 11, 2007 1 Contents 1. Relations 4 1.1. Binary relations................................ 4 1.2. Equivalence relations............................. 6 1.3. Relations and Directed Graphs.......................

### 3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

### Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

### MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### . 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9

Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### Theory of Computation

Theory of Computation For Computer Science & Information Technology By www.thegateacademy.com Syllabus Syllabus for Theory of Computation Regular Expressions and Finite Automata, Context-Free Grammar s

### Warshall s Algorithm: Transitive Closure

CS 0 Theory of Algorithms / CS 68 Algorithms in Bioinformaticsi Dynamic Programming Part II. Warshall s Algorithm: Transitive Closure Computes the transitive closure of a relation (Alternatively: all paths

### Regular Languages and Finite Automata

Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a

### Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

### The basic unit in matrix algebra is a matrix, generally expressed as: a 11 a 12. a 13 A = a 21 a 22 a 23

(copyright by Scott M Lynch, February 2003) Brief Matrix Algebra Review (Soc 504) Matrix algebra is a form of mathematics that allows compact notation for, and mathematical manipulation of, high-dimensional

### INTRODUCTORY SET THEORY

M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

### Chapter 7. Permutation Groups

Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral

### Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices. A Biswas, IT, BESU SHIBPUR

Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices A Biswas, IT, BESU SHIBPUR McGraw-Hill The McGraw-Hill Companies, Inc., 2000 Set of Integers The set of integers, denoted by Z,

### Reading 13 : Finite State Automata and Regular Expressions

CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model

### A linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form

Section 1.3 Matrix Products A linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form (scalar #1)(quantity #1) + (scalar #2)(quantity #2) +...

### 2.5 Elementary Row Operations and the Determinant

2.5 Elementary Row Operations and the Determinant Recall: Let A be a 2 2 matrtix : A = a b. The determinant of A, denoted by det(a) c d or A, is the number ad bc. So for example if A = 2 4, det(a) = 2(5)

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

### Similarity and Diagonalization. Similar Matrices

MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

### Matrix Multiplication

Matrix Multiplication CPS343 Parallel and High Performance Computing Spring 2016 CPS343 (Parallel and HPC) Matrix Multiplication Spring 2016 1 / 32 Outline 1 Matrix operations Importance Dense and sparse

### Notes on Algebraic Structures. Peter J. Cameron

Notes on Algebraic Structures Peter J. Cameron ii Preface These are the notes of the second-year course Algebraic Structures I at Queen Mary, University of London, as I taught it in the second semester

### Recursive Algorithms. Recursion. Motivating Example Factorial Recall the factorial function. { 1 if n = 1 n! = n (n 1)! if n > 1

Recursion Slides by Christopher M Bourke Instructor: Berthe Y Choueiry Fall 007 Computer Science & Engineering 35 Introduction to Discrete Mathematics Sections 71-7 of Rosen cse35@cseunledu Recursive Algorithms

### Solution to Homework 2

Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if

### 1 Sets and Set Notation.

LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

### DATA ANALYSIS II. Matrix Algorithms

DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where

### DETERMINANTS. b 2. x 2

DETERMINANTS 1 Systems of two equations in two unknowns A system of two equations in two unknowns has the form a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2 This can be written more concisely in

### Integers and division

CS 441 Discrete Mathematics for CS Lecture 12 Integers and division Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Symmetric matrix Definition: A square matrix A is called symmetric if A = A T.

### Just the Factors, Ma am

1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive

### 1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

### Applications of Methods of Proof

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

### a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

### Solutions to In-Class Problems Week 4, Mon.

Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science September 26 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised September 26, 2005, 1050 minutes Solutions

### CmSc 175 Discrete Mathematics Lesson 10: SETS A B, A B

CmSc 175 Discrete Mathematics Lesson 10: SETS Sets: finite, infinite, : empty set, U : universal set Describing a set: Enumeration = {a, b, c} Predicates = {x P(x)} Recursive definition, e.g. sequences

### Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture No. # 31 Recursive Sets, Recursively Innumerable Sets, Encoding

### Midterm Practice Problems

6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator

### Chapter 7: Products and quotients

Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### A Primer on Index Notation

A Primer on John Crimaldi August 28, 2006 1. Index versus Index notation (a.k.a. Cartesian notation) is a powerful tool for manipulating multidimensional equations. However, there are times when the more

### Lecture Notes: Matrix Inverse. 1 Inverse Definition

Lecture Notes: Matrix Inverse Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Inverse Definition We use I to represent identity matrices,

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.

Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that

### Chapter 10. Abstract algebra

Chapter 10. Abstract algebra C.O.S. Sorzano Biomedical Engineering December 17, 2013 10. Abstract algebra December 17, 2013 1 / 62 Outline 10 Abstract algebra Sets Relations and functions Partitions and

### Mathematics for Algorithm and System Analysis

Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface

### Section 6.1 - Inner Products and Norms

Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,

### Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture 7 Transformations in 2-D

Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture 7 Transformations in 2-D Welcome everybody. We continue the discussion on 2D

### 6.3 Conditional Probability and Independence

222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

### NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

### Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers

### Data Structures and Algorithms Written Examination

Data Structures and Algorithms Written Examination 22 February 2013 FIRST NAME STUDENT NUMBER LAST NAME SIGNATURE Instructions for students: Write First Name, Last Name, Student Number and Signature where

### 1.2 Solving a System of Linear Equations

1.. SOLVING A SYSTEM OF LINEAR EQUATIONS 1. Solving a System of Linear Equations 1..1 Simple Systems - Basic De nitions As noticed above, the general form of a linear system of m equations in n variables

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### GENERATING SETS KEITH CONRAD

GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors

### Zachary Monaco Georgia College Olympic Coloring: Go For The Gold

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various

### Why? A central concept in Computer Science. Algorithms are ubiquitous.

Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online

### Social Media Mining. Graph Essentials

Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures

### DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH

DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH CHRISTOPHER RH HANUSA AND THOMAS ZASLAVSKY Abstract We investigate the least common multiple of all subdeterminants,

### The Language of Mathematics

CHPTER 2 The Language of Mathematics 2.1. Set Theory 2.1.1. Sets. set is a collection of objects, called elements of the set. set can be represented by listing its elements between braces: = {1, 2, 3,

### Algebraic and Combinatorial Circuits

C H A P T E R Algebraic and Combinatorial Circuits Algebraic circuits combine operations drawn from an algebraic system. In this chapter we develop algebraic and combinatorial circuits for a variety of

### Automata and Formal Languages

Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,

### Degree Hypergroupoids Associated with Hypergraphs

Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated

### Group Theory (MA343): Lecture Notes Semester I Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics, NUI Galway

Group Theory (MA343): Lecture Notes Semester I 2013-2014 Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics, NUI Galway November 21, 2013 Contents 1 What is a group? 2 1.1 Examples...........................................

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Unit 21 Influence Coefficients

Unit 21 Influence Coefficients Readings: Rivello 6.6, 6.13 (again), 10.5 Paul A. Lagace, Ph.D. Professor of Aeronautics & Astronautics and Engineering Systems Have considered the vibrational behavior of

### Sets and set operations

CS 441 Discrete Mathematics for CS Lecture 7 Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square asic discrete structures Discrete math = study of the discrete structures used

### CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

### CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

### Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March

### Lecture 2 Matrix Operations

Lecture 2 Matrix Operations transpose, sum & difference, scalar multiplication matrix multiplication, matrix-vector product matrix inverse 2 1 Matrix transpose transpose of m n matrix A, denoted A T or

### CS 3719 (Theory of Computation and Algorithms) Lecture 4

CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a

### 3 Some Integer Functions

3 Some Integer Functions A Pair of Fundamental Integer Functions The integer function that is the heart of this section is the modulo function. However, before getting to it, let us look at some very simple

### 7 Communication Classes

this version: 26 February 2009 7 Communication Classes Perhaps surprisingly, we can learn much about the long-run behavior of a Markov chain merely from the zero pattern of its transition matrix. In the

### Cartesian Products and Relations

Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special

### NOTES on LINEAR ALGEBRA 1

School of Economics, Management and Statistics University of Bologna Academic Year 205/6 NOTES on LINEAR ALGEBRA for the students of Stats and Maths This is a modified version of the notes by Prof Laura

### Network (Tree) Topology Inference Based on Prüfer Sequence

Network (Tree) Topology Inference Based on Prüfer Sequence C. Vanniarajan and Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 vanniarajanc@hcl.in,

### CS2 Algorithms and Data Structures Note 11. Breadth-First Search and Shortest Paths

CS2 Algorithms and Data Structures Note 11 Breadth-First Search and Shortest Paths In this last lecture of the CS2 Algorithms and Data Structures thread we will consider the problem of computing distances

### Permutation Groups. Rubik s Cube

Permutation Groups and Rubik s Cube Tom Davis tomrdavis@earthlink.net May 6, 2000 Abstract In this paper we ll discuss permutations (rearrangements of objects), how to combine them, and how to construct

### R u t c o r Research R e p o r t. Boolean functions with a simple certificate for CNF complexity. Ondřej Čepeka Petr Kučera b Petr Savický c

R u t c o r Research R e p o r t Boolean functions with a simple certificate for CNF complexity Ondřej Čepeka Petr Kučera b Petr Savický c RRR 2-2010, January 24, 2010 RUTCOR Rutgers Center for Operations

### 15.062 Data Mining: Algorithms and Applications Matrix Math Review

.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 11

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According

### SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections

### 1.1 Logical Form and Logical Equivalence 1

Contents Chapter I The Logic of Compound Statements 1.1 Logical Form and Logical Equivalence 1 Identifying logical form; Statements; Logical connectives: not, and, and or; Translation to and from symbolic

### Discrete Maths. Philippa Gardner. These lecture notes are based on previous notes by Iain Phillips.

Discrete Maths Philippa Gardner These lecture notes are based on previous notes by Iain Phillips. This short course introduces some basic concepts in discrete mathematics: sets, relations, and functions.

### AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC

AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following.

### Announcements. CompSci 230 Discrete Math for Computer Science Sets. Introduction to Sets. Sets

CompSci 230 Discrete Math for Computer Science Sets September 12, 2013 Prof. Rodger Slides modified from Rosen 1 nnouncements Read for next time Chap. 2.3-2.6 Homework 2 due Tuesday Recitation 3 on Friday

### 1 Introduction to Counting

1 Introduction to Counting 1.1 Introduction In this chapter you will learn the fundamentals of enumerative combinatorics, the branch of mathematics concerned with counting. While enumeration problems can

### COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

### Direct Methods for Solving Linear Systems. Matrix Factorization

Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011