Ma/CS 6b Class 12: Graphs and Matrices
|
|
- Robert Craig
- 5 years ago
- Views:
Transcription
1 Ma/CS 6b Class 2: Graphs and Matrices 3 3 v 5 v 4 v By Adam Sheffer Non-simple Graphs In this class we allow graphs to be nonsimple. We allow parallel edges, but not loops.
2 Incidence Matrix Consider a graph G = V, E. We order the vertices as V = v,,, v n and the edges as E = e, e 2,, e m The incidence matrix of G is an n m matrix M. The cell M ij contains if v i is an endpoint of e j, and otherwise. v v 5 e 4 v 4 e e 2 e 3 e 5 e 6 Playing with an Incidence Matrix Let M be the incidence matrix of a graph G = V, E, and let B = MM T. What is the value of B ii? The degree of v i in G. What is the value of B ij for i j? The number of edges between v i and v j. M = e v 5 e 4 v 4 v e 2 e 3 e 5 e 6 2
3 Adjacency Matrix A = Consider a graph G = V, E. We order the vertices as V = v,,, v n. The adjacency matrix of G is a symmetric n n matrix A. The cell A ij contains the number of edges between v i and v j. v 3 3 v 5 v 4 A Connection Problem. Let G = V, E be a graph with incidence matrix M and adjacency matrix A. Express MM T using A. Answer. This is a V V matrix. MM T ii is the degree of v i. MM T ij for i j is number of edges between v i and v j. Let D be a diagonal matrix with D ii being the degree of v i. We have MM T = A + D. 3
4 Example A = 3 3 D = v M = MM T = = A + D Multiplying by s Let n denote the n n matrix with in each of its cells. Problem. Let G = V, E be a graph with adjacency matrix A. Describe the values in the cells of B = A V. Answer. It is a V V matrix. The column vectors of B are identical. The i th element of each column is the degree of v i. 4
5 Playing with an Adjacency Matrix Let A be the adjacency matrix of a simple graph G = V, E, and let M = A 2. What is the value of M ii? The degree of v i in G. What is the value of M ij for i j? The number of vertices that are adjacent to both v i and v j. A = v 5 v 4 v What about M 3? Let A be the adjacency matrix of a simple graph G = V, E. For i j: A ij tells us if there is an edge v i, v j E. A 2 ij tells us how many vertices are adjacent to both v i and v j. What is A 3 ij? It is the number of paths of length three between v i and v j. In fact, A 2 ij is the number of paths of length two between v i and v j. 5
6 The Meaning of M k Theorem. Let A be the adjacency matrix of a (not necessarily simple) graph G = V, E. Then A k is the number of ij (not necessarily simple) paths between v i and v j. An Example a b d c A = A 2 = AA = = A 3 = A 2 A = =
7 The Meaning of M k Theorem. Let M be the incidence matrix of a (not necessarily simple) graph G = V, E. Then M k is the number ij of (not necessarily simple) paths between v i and v j. Proof. By induction on k. Induction basis. Easy to see for k = and k = 2. The Induction Step We have A k = A k A. That is V A k ij = Ak im A mj m= By the induction hypothesis, A k is the im number of paths of length k between v i and v m. A mj is the number of edges between v m, v j. 7
8 The Induction Step (cont.) V A k ij = Ak im A mj m= For a fixed m, A k A im mj is the number of paths from v i to v j of length k with v m as their penultimate vertex. Thus, summing over every m V results in the number of paths from v i to v j of length k. Which Classic English Rock Band is More Sciency? 8
9 Computing the Number of Paths of Length k Problem. Consider a graph G = V, E, two vertices s, t V, and an integer k >. Describe an algorithm for finding the number of paths of length k between s and t. Let A be the adjacency matrix of G. We need to compute A k, which involves k matrix multiplication. Matrix Multiplication: A Brief History We wish to multiply two n n matrices. Computing one cell requires about n multiplications and additions. So computing an entire matrix takes cn 3 (for some constant c). In 969 Strassen found an improved algorithm with a running time of cn In 987, Coppersmith and Winograd obtained an improved cn After over 2 years, in 2, Stothers obtained cn Williams immediately improved to cn In 24, Le Gall improved to cn
10 A More Efficient Algorithm To compute A k, we do not need k matrix multiplications. If k is a power of 2: A 2 = AA, A 4 = A 2 A 2,, A k = A k/2 A k/2. Only log 2 k multiplications! If k is not a power of 2: We again compute A, A 2, A 4,, A k. We can then obtain A k by multiplying a subset of those. For example, A 57 = A 32 A 6 A 8 A. At most 2log k multiplications! Connectivity and Matrices Problem. Let G = V, E be a graph with an adjacency matrix A. Use M = I + A + A 2 + A A V to tell whether G is connected. Answer. G is connected iff every cell of A is positive. The main diagonal of A is positive due to I. A cell A ij for i j contains the number of paths between v i and v j of length at most k. If the graph is connected, such paths exist between every two vertices.
11 And Now with Colors Problem. Consider a graph G = V, E, two vertices s, t V, and an integer k >. Moreover, every edge is colored either red or blue. Describe an algorithm for finding the number of paths of length k between s and t that have an even number of blue edges. Solution We define two sets of matrices: Cell ij of the matrix E m contains the number of paths of length m between v i an v j using an even number of blue edges. Cell ij of the matrix O m contains the number of paths of length m between v i an v j using an odd number of blue edges. What are E and O ()? E is the adjacency matrix of G after removing the blue edges. Similarly for O after removing the red edges.
12 Solution (cont.) We wish to compute E k. We know how to find E and O. How can we compute E m and O (m) using E m and O (m )? E m = E m E + O (m ) O (). E m E is the number of paths of ij length m between v i and v j with an even number of blue edges and whose last edge is red. Similarly for O m O last edges of the paths is blue. ij except that the Solution (cont.) How can we similarly compute O m using E m and O m? O m = E m O + O (m ) E (). Concluding the solution. We compute about 2k matrices. Each computation involves two matrix multiplications and one addition. 2
13 Identical Graphs? Are the following two graphs identical? v v Possible answers: No, since in one v has degree 2 and in the other degree. Yes, because they have exactly the same structure. Graph Isomorphism An isomorphism from a graph G = V, E to a graph G = V, E is a bijection f: V V such that for every u, v V, E has the same number of edges between u and v as E has between f u and f v. We say that G and G are isomorphic if there is an isomorphism from G to G. In our example, the graphs are isomorphic (f v = u 2, f = u, f = u 3 ). v u 2 u 3 u 3
14 Uniqueness? Question. If two graphs are isomorphic, can there be more than one isomorphism from one to the other? Yes! a w, b z, c x, d y. a y, b z, c x, d w. a b w x c d y z Isomorphisms and Adjacency Matrices What can we say about adjacency matrices of isomorphic graphs? c a b d w y z x 4
15 Answer Two graphs G, G are isomorphic if and only if the adjacency matrix of G is obtained by permuting the rows and columns of the adjacency matrix of G. (The same permutation should apply both to the rows and to the column)., 2 4, 4 3, 3 2: Incidence Matrix of a Directed Graph Consider a directed graph G = V, E. We order the vertices as V = v,,, v n and the edges as E = e, e 2,, e m The incidence matrix of G is an n m matrix M. The cell M ij contains - if e j is entering v i, and if e j is leaving v i. v v 5 e 4 v 4 e e 2 e 3 e 5 e 6 5
16 The End: Queen Ph.D. in astrophysics Degree in Biology Electronics engineer Freddie Mercury 6
Ma/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Recall: Parity of a Permutation S n the set of permutations of 1,2,, n. A permutation σ S n is even if it can be written as a composition of an
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x
More informationMa/CS 6a Class 19: Group Isomorphisms
Ma/CS 6a Class 19: Group Isomorphisms By Adam Sheffer A Group A group consists of a set G and a binary operation, satisfying the following. Closure. For every x, y G x y G. Associativity. For every x,
More informationEE263 Review Session 1
EE263 Review Session 1 October 5, 2018 0.1 Importing Variables from a MALAB.m file If you are importing variables given in file vars.m, use the following code at the beginning of your script. close a l
More informationMa/CS 6a Class 28: Latin Squares
Ma/CS 6a Class 28: Latin Squares By Adam Sheffer Latin Squares A Latin square is an n n array filled with n different symbols, each occurring exactly once in each row and exactly once in each column. 1
More informationMa/CS 6b Class 25: Error Correcting Codes 2
Ma/CS 6b Class 25: Error Correcting Codes 2 By Adam Sheffer Recall: Codes V n the set of binary sequences of length n. For example, V 3 = 000,001,010,011,100,101,110,111. Codes of length n are subsets
More informationMa/CS 6b Class 3: Stable Matchings
Ma/CS 6b Class 3: Stable Matchings α p 5 p 12 p 15 q 1 q 7 q 12 By Adam Sheffer Reminder: Alternating Paths Let G = V 1 V 2, E be a bipartite graph, and let M be a matching of G. A path is alternating
More information21-301, Spring 2019 Homework 4 Solutions
21-301, Spring 2019 Homework 4 Solutions Michael Anastos Not to be published without written consent of the author or the instructors of the course. (Please contact me if you find any errors!) Problem
More informationMa/CS 6a Class 19: Isomorphisms and Subgroups
Ma/CS 6a Class 19: Isomorphisms and Subgroups By Adam Sheffer Reminder: A Group A group consists of a set G and a binary operation, satisfying the following. Closure. For every x, y G, we have x y G. Associativity.
More informationMulti-coloring and Mycielski s construction
Multi-coloring and Mycielski s construction Tim Meagher Fall 2010 Abstract We consider a number of related results taken from two papers one by W. Lin [1], and the other D. C. Fisher[2]. These articles
More informationCSE 321 Solutions to Practice Problems
CSE 321 Solutions to Practice Problems Instructions: Feel free NOT to multiply out binomial coefficients, factorials, etc, and feel free to leave answers in the form of a sum. No calculators, books or
More informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
More informationGraphic sequences, adjacency matrix
Chapter 2 Graphic sequences, adjacency matrix Definition 2.1. A sequence of integers (d 1,..., d n ) is called graphic if it is the degree sequence of a graph. Example 2.2. 1. (1, 2, 2, 3) is graphic:
More informationMa/CS 6a Class 28: Latin Squares
Ma/CS 6a Class 28: Latin Squares By Adam Sheffer Latin Squares A Latin square is an n n array filled with n different symbols, each occurring exactly once in each row and exactly once in each column. 1
More informationAUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS
AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize
More information1.10 Matrix Representation of Graphs
42 Basic Concepts of Graphs 1.10 Matrix Representation of Graphs Definitions: In this section, we introduce two kinds of matrix representations of a graph, that is, the adjacency matrix and incidence matrix
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationCHAPTER 1. Relations. 1. Relations and Their Properties. Discussion
CHAPTER 1 Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition 1.1.1. A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is Related to b
More informationStrong Mathematical Induction
Strong Mathematical Induction Lecture 23 Section 5.4 Robb T. Koether Hampden-Sydney College Mon, Feb 24, 2014 Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, 2014 1
More informationGraph G = (V, E). V ={vertices}, E={edges}. V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}
Graph Theory Graph G = (V, E). V ={vertices}, E={edges}. a b c h k d g f e V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} E =16. Digraph D = (V, A). V ={vertices}, E={edges}.
More informationGraph fundamentals. Matrices associated with a graph
Graph fundamentals Matrices associated with a graph Drawing a picture of a graph is one way to represent it. Another type of representation is via a matrix. Let G be a graph with V (G) ={v 1,v,...,v n
More informationRecitation 8: Graphs and Adjacency Matrices
Math 1b TA: Padraic Bartlett Recitation 8: Graphs and Adjacency Matrices Week 8 Caltech 2011 1 Random Question Suppose you take a large triangle XY Z, and divide it up with straight line segments into
More informationMa/CS 6b Class 3: Stable Matchings
Ma/CS 6b Class 3: Stable Matchings α p 5 p 12 p 15 q 1 q 7 q 12 β By Adam Sheffer Neighbor Sets Let G = V 1 V 2, E be a bipartite graph. For any vertex a V 1, we define the neighbor set of a as N a = u
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationI. Approaches to bounding the exponent of matrix multiplication
I. Approaches to bounding the exponent of matrix multiplication Chris Umans Caltech Based on joint work with Noga Alon, Henry Cohn, Bobby Kleinberg, Amir Shpilka, Balazs Szegedy Modern Applications of
More informationMATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM
MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM (FP1) The exclusive or operation, denoted by and sometimes known as XOR, is defined so that P Q is true iff P is true or Q is true, but not both. Prove (through
More informationUSING GRAPHS AND GAMES TO GENERATE CAP SET BOUNDS
USING GRAPHS AND GAMES TO GENERATE CAP SET BOUNDS JOSH ABBOTT AND TREVOR MCGUIRE Abstract. Let F 3 be the field with 3 elements and consider the k- dimensional affine space, F k 3, over F 3. A line of
More informationAdvanced Combinatorial Optimization September 22, Lecture 4
8.48 Advanced Combinatorial Optimization September 22, 2009 Lecturer: Michel X. Goemans Lecture 4 Scribe: Yufei Zhao In this lecture, we discuss some results on edge coloring and also introduce the notion
More informationCourse : Algebraic Combinatorics
Course 18.312: Algebraic Combinatorics Lecture Notes #29-31 Addendum by Gregg Musiker April 24th - 29th, 2009 The following material can be found in several sources including Sections 14.9 14.13 of Algebraic
More informationTHE DYNAMICS OF SUCCESSIVE DIFFERENCES OVER Z AND R
THE DYNAMICS OF SUCCESSIVE DIFFERENCES OVER Z AND R YIDA GAO, MATT REDMOND, ZACH STEWARD Abstract. The n-value game is a dynamical system defined by a method of iterated differences. In this paper, we
More informationThe Matrix-Tree Theorem
The Matrix-Tree Theorem Christopher Eur March 22, 2015 Abstract: We give a brief introduction to graph theory in light of linear algebra. Our results culminates in the proof of Matrix-Tree Theorem. 1 Preliminaries
More informationMODEL ANSWERS TO THE SEVENTH HOMEWORK. (b) We proved in homework six, question 2 (c) that. But we also proved homework six, question 2 (a) that
MODEL ANSWERS TO THE SEVENTH HOMEWORK 1. Let X be a finite set, and let A, B and A 1, A 2,..., A n be subsets of X. Let A c = X \ A denote the complement. (a) χ A (x) = A. x X (b) We proved in homework
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationMa/CS 6b Class 15: The Probabilistic Method 2
Ma/CS 6b Class 15: The Probabilistic Method 2 By Adam Sheffer Reminder: Random Variables A random variable is a function from the set of possible events to R. Example. Say that we flip five coins. We can
More informationSpectra of Semidirect Products of Cyclic Groups
Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 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 B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More information(x 1 +x 2 )(x 1 x 2 )+(x 2 +x 3 )(x 2 x 3 )+(x 3 +x 1 )(x 3 x 1 ).
CMPSCI611: Verifying Polynomial Identities Lecture 13 Here is a problem that has a polynomial-time randomized solution, but so far no poly-time deterministic solution. Let F be any field and let Q(x 1,...,
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture 19
832: Algebraic Combinatorics Lionel Levine Lecture date: April 2, 20 Lecture 9 Notes by: David Witmer Matrix-Tree Theorem Undirected Graphs Let G = (V, E) be a connected, undirected graph with n vertices,
More informationPermutations and Combinations
Permutations and Combinations Permutations Definition: Let S be a set with n elements A permutation of S is an ordered list (arrangement) of its elements For r = 1,..., n an r-permutation of S is an ordered
More informationCS173 Strong Induction and Functions. Tandy Warnow
CS173 Strong Induction and Functions Tandy Warnow CS 173 Introduction to Strong Induction (also Functions) Tandy Warnow Preview of the class today What are functions? Weak induction Strong induction A
More informationMatrix Multiplication
Matrix Multiplication Matrix Multiplication Matrix multiplication. Given two n-by-n matrices A and B, compute C = AB. n c ij = a ik b kj k=1 c 11 c 12 c 1n c 21 c 22 c 2n c n1 c n2 c nn = a 11 a 12 a 1n
More informationSUMS PROBLEM COMPETITION, 2000
SUMS ROBLEM COMETITION, 2000 SOLUTIONS 1 The result is well known, and called Morley s Theorem Many proofs are known See for example HSM Coxeter, Introduction to Geometry, page 23 2 If the number of vertices,
More informationApproaches to bounding the exponent of matrix multiplication
Approaches to bounding the exponent of matrix multiplication Chris Umans Caltech Based on joint work with Noga Alon, Henry Cohn, Bobby Kleinberg, Amir Shpilka, Balazs Szegedy Simons Institute Sept. 7,
More informationMathematical Structures Combinations and Permutations
Definitions: Suppose S is a (finite) set and n, k 0 are integers The set C(S, k) of k - combinations consists of all subsets of S that have exactly k elements The set P (S, k) of k - permutations consists
More informationMAC Module 2 Systems of Linear Equations and Matrices II. Learning Objectives. Upon completing this module, you should be able to :
MAC 0 Module Systems of Linear Equations and Matrices II Learning Objectives Upon completing this module, you should be able to :. Find the inverse of a square matrix.. Determine whether a matrix is invertible..
More informationSUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS
SUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS Arash Asadi Luke Postle 1 Robin Thomas 2 School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT
More informationThe Theory of the Simplex Method. Chapter 5: Hillier and Lieberman Chapter 5: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course
The Theory of the Simplex Method Chapter 5: Hillier and Lieberman Chapter 5: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course Terms to Know Constraint Boundary Equation, Hyperplane, Constraint
More informationAlgorithms and Data Structures Strassen s Algorithm. ADS (2017/18) Lecture 4 slide 1
Algorithms and Data Structures Strassen s Algorithm ADS (2017/18) Lecture 4 slide 1 Tutorials Start in week (week 3) Tutorial allocations are linked from the course webpage http://www.inf.ed.ac.uk/teaching/courses/ads/
More information1 I A Q E B A I E Q 1 A ; E Q A I A (2) A : (3) A : (4)
Latin Squares Denition and examples Denition. (Latin Square) An n n Latin square, or a latin square of order n, is a square array with n symbols arranged so that each symbol appears just once in each row
More informationMath 775 Homework 1. Austin Mohr. February 9, 2011
Math 775 Homework 1 Austin Mohr February 9, 2011 Problem 1 Suppose sets S 1, S 2,..., S n contain, respectively, 2, 3,..., n 1 elements. Proposition 1. The number of SDR s is at least 2 n, and this bound
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationChapter 5. Divide and Conquer CLRS 4.3. Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
Chapter 5 Divide and Conquer CLRS 4.3 Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. 1 Divide-and-Conquer Divide-and-conquer. Break up problem into several parts. Solve
More informationSpectrally arbitrary star sign patterns
Linear Algebra and its Applications 400 (2005) 99 119 wwwelseviercom/locate/laa Spectrally arbitrary star sign patterns G MacGillivray, RM Tifenbach, P van den Driessche Department of Mathematics and Statistics,
More information7 Matrix Operations. 7.0 Matrix Multiplication + 3 = 3 = 4
7 Matrix Operations Copyright 017, Gregory G. Smith 9 October 017 The product of two matrices is a sophisticated operations with a wide range of applications. In this chapter, we defined this binary operation,
More informationCombinatorial Optimization
Combinatorial Optimization Problem set 8: solutions 1. Fix constants a R and b > 1. For n N, let f(n) = n a and g(n) = b n. Prove that f(n) = o ( g(n) ). Solution. First we observe that g(n) 0 for all
More informationReductions. Example 1
Reductions We want to compare the complexity of different problems. A reduction from problem X to problem Y means that problem X is easier (or, more precisely, not harder) than problem Y. We write X Y
More informationREVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms
REVIEW QUESTIONS Chapter 1: Foundations: Sets, Logic, and Algorithms 1. Why can t a Venn diagram be used to prove a statement about sets? 2. Suppose S is a set with n elements. Explain why the power set
More informationComplexity of Matrix Multiplication and Bilinear Problems
Complexity of Matrix Multiplication and Bilinear Problems François Le Gall Graduate School of Informatics Kyoto University ADFOCS17 - Lecture 3 24 August 2017 Overview of the Lectures Fundamental techniques
More informationThis section is an introduction to the basic themes of the course.
Chapter 1 Matrices and Graphs 1.1 The Adjacency Matrix This section is an introduction to the basic themes of the course. Definition 1.1.1. A simple undirected graph G = (V, E) consists of a non-empty
More informationComputational Complexity
Computational Complexity Problems, instances and algorithms Running time vs. computational complexity General description of the theory of NP-completeness Problem samples 1 Computational Complexity What
More informationDeterminants. Copyright c 2012 Dan Nettleton (Iowa State University) Statistics / 25
Determinants opyright c 2012 Dan Nettleton (Iowa State University) Statistics 611 1 / 25 Notation The determinant of a square matrix n n A is denoted det(a) or A. opyright c 2012 Dan Nettleton (Iowa State
More information7.6 The Inverse of a Square Matrix
7.6 The Inverse of a Square Matrix Copyright Cengage Learning. All rights reserved. What You Should Learn Verify that two matrices are inverses of each other. Use Gauss-Jordan elimination to find inverses
More informationTutorials. Algorithms and Data Structures Strassen s Algorithm. The Master Theorem for solving recurrences. The Master Theorem (cont d)
DS 2018/19 Lecture 4 slide 3 DS 2018/19 Lecture 4 slide 4 Tutorials lgorithms and Data Structures Strassen s lgorithm Start in week week 3 Tutorial allocations are linked from the course webpage http://www.inf.ed.ac.uk/teaching/courses/ads/
More informationMa/CS 6a Class 25: Partitions
Ma/CS 6a Class 25: Partitions Explain the significance of the following sequence: un, dos, tres, quatre, cinc, sis, set, vuit, nou, deu... By Adam Sheffer Answer These are the Catalan numbers! (The numbers
More informationAn Algorithm to Determine the Clique Number of a Split Graph. In this paper, we propose an algorithm to determine the clique number of a split graph.
An Algorithm to Determine the Clique Number of a Split Graph O.Kettani email :o_ket1@yahoo.fr Abstract In this paper, we propose an algorithm to determine the clique number of a split graph. Introduction
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More informationDiscrete Optimization 23
Discrete Optimization 23 2 Total Unimodularity (TU) and Its Applications In this section we will discuss the total unimodularity theory and its applications to flows in networks. 2.1 Total Unimodularity:
More informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More informationIntroduction to Graph Theory
Introduction to Graph Theory George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 351 George Voutsadakis (LSSU) Introduction to Graph Theory August 2018 1 /
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #10: Sequences and Summations Based on materials developed by Dr. Adam Lee Today s Topics Sequences
More informationEdge colored complete bipartite graphs with trivial automorphism groups
Edge colored complete bipartite graphs with trivial automorphism groups Michael J. Fisher Garth Isaak Abstract We determine the values of s and t for which there is a coloring of the edges of the complete
More information22m:033 Notes: 3.1 Introduction to Determinants
22m:033 Notes: 3. Introduction to Determinants Dennis Roseman University of Iowa Iowa City, IA http://www.math.uiowa.edu/ roseman October 27, 2009 When does a 2 2 matrix have an inverse? ( ) a a If A =
More informationMatching Polynomials of Graphs
Spectral Graph Theory Lecture 25 Matching Polynomials of Graphs Daniel A Spielman December 7, 2015 Disclaimer These notes are not necessarily an accurate representation of what happened in class The notes
More informationThe Master Theorem for solving recurrences. Algorithms and Data Structures Strassen s Algorithm. Tutorials. The Master Theorem (cont d)
The Master Theorem for solving recurrences lgorithms and Data Structures Strassen s lgorithm 23rd September, 2014 Theorem Let n 0 N, k N 0 and a, b R with a > 0 and b > 1, and let T : N R satisfy the following
More informationMatrices and Vectors
Matrices and Vectors James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 11, 2013 Outline 1 Matrices and Vectors 2 Vector Details 3 Matrix
More informationTrees. A tree is a graph which is. (a) Connected and. (b) has no cycles (acyclic).
Trees A tree is a graph which is (a) Connected and (b) has no cycles (acyclic). 1 Lemma 1 Let the components of G be C 1, C 2,..., C r, Suppose e = (u, v) / E, u C i, v C j. (a) i = j ω(g + e) = ω(g).
More informationF 2k 1 = F 2n. for all positive integers n.
Question 1 (Fibonacci Identity, 15 points). Recall that the Fibonacci numbers are defined by F 1 = F 2 = 1 and F n+2 = F n+1 + F n for all n 0. Prove that for all positive integers n. n F 2k 1 = F 2n We
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
More information4. How to prove a problem is NPC
The reducibility relation T is transitive, i.e, A T B and B T C imply A T C Therefore, to prove that a problem A is NPC: (1) show that A NP (2) choose some known NPC problem B define a polynomial transformation
More informationThe Probabilistic Method
The Probabilistic Method In Graph Theory Ehssan Khanmohammadi Department of Mathematics The Pennsylvania State University February 25, 2010 What do we mean by the probabilistic method? Why use this method?
More informationLecture 9: Submatrices and Some Special Matrices
Lecture 9: Submatrices and Some Special Matrices Winfried Just Department of Mathematics, Ohio University February 2, 2018 Submatrices A submatrix B of a given matrix A is any matrix that can be obtained
More informationChapter 2. Ma 322 Fall Ma 322. Sept 23-27
Chapter 2 Ma 322 Fall 2013 Ma 322 Sept 23-27 Summary ˆ Matrices and their Operations. ˆ Special matrices: Zero, Square, Identity. ˆ Elementary Matrices, Permutation Matrices. ˆ Voodoo Principle. What is
More informationHarvard CS 121 and CSCI E-207 Lecture 6: Regular Languages and Countability
Harvard CS 121 and CSCI E-207 Lecture 6: Regular Languages and Countability Salil Vadhan September 20, 2012 Reading: Sipser, 1.3 and The Diagonalization Method, pages 174 178 (from just before Definition
More informationReview 1 Math 321: Linear Algebra Spring 2010
Department of Mathematics and Statistics University of New Mexico Review 1 Math 321: Linear Algebra Spring 2010 This is a review for Midterm 1 that will be on Thursday March 11th, 2010. The main topics
More information6 Permutations Very little of this section comes from PJE.
6 Permutations Very little of this section comes from PJE Definition A permutation (p147 of a set A is a bijection ρ : A A Notation If A = {a b c } and ρ is a permutation on A we can express the action
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationReachability and controllability of time-variant discrete-time positive linear systems
Control and Cybernetics vol. 33 (2004) No. 1 Reachability and controllability of time-variant discrete-time positive linear systems by Ventsi G. Rumchev 1 and Jaime Adeane 2 1 Department of Mathematics
More informationDefinition 2.3. We define addition and multiplication of matrices as follows.
14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row
More informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More informationSUPPLEMENTARY NOTES: CHAPTER 1
SUPPLEMENTARY NOTES: CHAPTER 1 1. Groups A group G is a set with single binary operation which takes two elements a, b G and produces a third, denoted ab and generally called their product. (Mathspeak:
More informationRelations. Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations. Reading (Epp s textbook)
Relations Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations Reading (Epp s textbook) 8.-8.3. Cartesian Products The symbol (a, b) denotes the ordered
More informationCS100: DISCRETE STRUCTURES. Lecture 3 Matrices Ch 3 Pages:
CS100: DISCRETE STRUCTURES Lecture 3 Matrices Ch 3 Pages: 246-262 Matrices 2 Introduction DEFINITION 1: A matrix is a rectangular array of numbers. A matrix with m rows and n columns is called an m x n
More informationRelations Graphical View
Introduction Relations Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Recall that a relation between elements of two sets is a subset of their Cartesian
More informationAlgorithms and Theory of Computation. Lecture 22: NP-Completeness (2)
Algorithms and Theory of Computation Lecture 22: NP-Completeness (2) Xiaohui Bei MAS 714 November 8, 2018 Nanyang Technological University MAS 714 November 8, 2018 1 / 20 Set Cover Set Cover Input: a set
More informationarxiv: v1 [math.co] 20 Dec 2016
F-POLYNOMIAL FORMULA FROM CONTINUED FRACTIONS MICHELLE RABIDEAU arxiv:1612.06845v1 [math.co] 20 Dec 2016 Abstract. For cluster algebras from surfaces, there is a known formula for cluster variables and
More informationSydney University Mathematical Society Problems Competition Solutions.
Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed
More informationCombinations and Probabilities
Combinations and Probabilities Tutor: Zhang Qi Systems Engineering and Engineering Management qzhang@se.cuhk.edu.hk November 2014 Tutor: Zhang Qi (SEEM) Tutorial 7 November 2014 1 / 16 Combination Review
More informationEigenvectors Via Graph Theory
Eigenvectors Via Graph Theory Jennifer Harris Advisor: Dr. David Garth October 3, 2009 Introduction There is no problem in all mathematics that cannot be solved by direct counting. -Ernst Mach The goal
More informationPowers of Tensors and Fast Matrix Multiplication
Powers of Tensors and Fast Matrix Multiplication François Le Gall Department of Computer Science Graduate School of Information Science and Technology The University of Tokyo Simons Institute, 12 November
More information--------------------------------------------------------------------------------------------- Math 6023 Topics: Design and Graph Theory ---------------------------------------------------------------------------------------------
More information