ⅠIntroduction to Set Theory 1. Sets and Subsets

Slides:



Advertisements
Similar presentations
Discrete Mathematics II
Advertisements

CSCI 115 Chapter 6 Order Relations and Structures.
Chapter 8 Topics in Graph Theory
 期中测验时间:本周五上午 9 : 40  教师 TA 答疑时间 : 周三晚上 6 : 00—8 : 30  地点:软件楼 315 房间,  教师 TA :李弋老师  开卷考试.
Edge-Coloring of Graphs On the left we see a 1- factorization of  5, the five-sided prism. Each factor is respresented by its own color. No edges of the.
Combinatorial Algorithms
Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.
Chapter 7 Relations : the second time around
Matchings Matching: A matching in a graph G is a set of non-loop edges with no shared endpoints.
Preliminaries/ Chapter 1: Introduction. Definitions: from Abstract to Linear Algebra.
K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.
K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.
Discrete Mathematics Lecture 9 Alexander Bukharovich New York University.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Partially Ordered Sets (POSets)
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
Wei Wang Xi’an Jiaotong University Generalized Spectral Characterization of Graphs: Revisited Shanghai Conference on Algebraic Combinatorics (SCAC), Shanghai,
Discrete Mathematics Transparency No. 0-1 Discrete Mathematics Cheng-Chia Chen September 2009.
Graph Theory Topics to be covered:
 期中测验时间:  11 月 4 日  课件 集合,关系,函数,基数, 组合数学.  Ⅰ Introduction to Set Theory  1. Sets and Subsets  Representation of set:  Listing elements, Set builder.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
MATH 370 Final Review Chapter Know this well Chapter 5 and 6: Counting/ Probability Basic counting P(n,r), C(n,r), C(n-1+r,r),… Basic probability,
5.8 Graph Matching  Example: Set of worker assign to a set of task  Four tasks are to be assigned to four workers.  – Worker 1 is qualified to do tasks.
8.3 Representing Relations Directed Graphs –Vertex –Arc (directed edge) –Initial vertex –Terminal vertex.
 期中测验时间:  10 月 31 日上午 9 : 40—11 : 30  第一到第四章  即,集合,关系,函数,组合数学.
 Ⅰ Introduction to Set Theory  1. Sets and Subsets  Representation of set:  Listing elements, Set builder notion, Recursive definition  , ,  
Introduction to Graph Theory
Data Structures & Algorithms Graphs
September1999 CMSC 203 / 0201 Fall 2002 Week #13 – 18/20/22 November 2002 Prof. Marie desJardins.
5.5.2 M inimum spanning trees  Definition 24: A minimum spanning tree in a connected weighted graph is a spanning tree that has the smallest possible.
Mathematical Preliminaries
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)
Some NP-complete Problems in Graph Theory Prof. Sin-Min Lee.
Week 1 – Introduction to Graph Theory I Dr. Anthony Bonato Ryerson University AM8002 Fall 2014.
5.8 Graph Matching  Example: Set of worker assign to a set of task  Four tasks are to be assigned to four workers.  – Worker 1 is qualified to do tasks.
Graph Theory and Applications
Chap. 11 Graph Theory and Applications 1. Directed Graph 2.
DISCRETE COMPUTATIONAL STRUCTURES
Unit II Discrete Structures Relations and Functions SE (Comp.Engg.)
Chapter 6 Abstract algebra
 Quotient graph  Definition 13: Suppose G(V,E) is a graph and R is a equivalence relation on the set V. We construct the quotient graph G R in the follow.
Introduction to Graph Theory
Math 3121 Abstract Algebra I Lecture 14 Sections
 Example: [Z m ;+,*] is a field iff m is a prime number  [a] -1 =?  If GCD(a,n)=1,then there exist k and s, s.t. ak+ns=1, where k, s  Z.  ns=1-ak.
 Theorem 6.21: Let H be a subgroup of G. H is a normal subgroup of G iff g -1 hg  H for  g  G and h  H.  Proof: (1) H is a normal subgroup of G.
Set Theory Concepts Set – A collection of “elements” (objects, members) denoted by upper case letters A, B, etc. elements are lower case brackets are used.
Introduction to Graph Theory
MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE By, A.Kousar Nikhath, Asst.Professor, CSE Dpt.
Chapter 20: Graphs. Objectives In this chapter, you will: – Learn about graphs – Become familiar with the basic terminology of graph theory – Discover.
CSCI 115 Course Review.
 Hamilton paths.  Definition 20: A Hamilton paths is a path that contains each vertex exactly once. A Hamilton circuit is a circuit that contains.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Week 8 - Wednesday.  What did we talk about last time?  Relations  Properties of relations  Reflexive  Symmetric  Transitive.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Trees.
MATHEMATICS B.A./B.Sc. (GENERAL) THIRD YEAR EXAMINATION, 2012.
Review: Discrete Mathematics and Its Applications
Unit-III Algebraic Structures
6.6.4 Subring, Ideal and Quotient ring
Groups and Applications
Sungho Kang Yonsei University
Problem Solving 4.
Review: Discrete Mathematics and Its Applications
Theorem 6.29: Any Field is an integral domain
4.7 Recurrence Relations P13, P100
ⅠIntroduction to Set Theory 1. Sets and Subsets
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
N(S) ={vV|uS,{u,v}E(G)}
Presentation transcript:

ⅠIntroduction to Set Theory 1. Sets and Subsets Representation of set: Listing elements, Set builder notion, Recursive definition , ,  P(A) 2. Operations on Sets Operations and their Properties A=?B AB, and B A Properties Theorems, examples, and exercises

3. Relations and Properties of relations reflexive ,irreflexive symmetric , asymmetric ,antisymmetric Transitive Closures of Relations r(R),s(R),t(R)=? Theorems, examples, and exercises 4. Operations on Relations Inverse relation, Composition

5. Equivalence Relations equivalence class 6.Partial order relations and Hasse Diagrams Extremal elements of partially ordered sets: maximal element, minimal element greatest element, least element upper bound, lower bound least upper bound, greatest lower bound Theorems, examples, and exercises

Cardinality, 0. 7.Functions one to one, onto, one-to-one correspondence Composite functions and Inverse functions Cardinality, 0. Theorems, examples, and exercises

II Combinatorics 1. Pigeonhole principle Pigeon and pigeonholes example,exercise

2. Permutations and Combinations Permutations of sets, Combinations of sets circular permutation Permutations and Combinations of multisets Formulae inclusion-exclusion principle generating functions integral solutions of the equation example,exercise

Applications generating functions and Exponential generating functions Applications of Inclusion-Exclusion principle theorem 3.15,theorem 3.16,example,exercise Applications generating functions and Exponential generating functions ex=1+x+x2/2!+…+xn/n!+…; x+x2/2!+…+xn/n!+…=ex-1; e-x=1-x+x2/2!+…+(-1)nxn/n!+…; 1+x2/2!+…+x2n/(2n)!+…=(ex+e-x)/2; x+x3/3!+…+x2n+1/(2n+1)!+…=(ex-e-x)/2; 3. recurrence relation Using Characteristic roots to solve recurrence relations Using Generating functions to solve recurrence relations example,exercise

III Graphs 1. Graph terminology The degree of a vertex,(G),  (G), Theorem 5.1 5.2 k-regular, spanning subgraph, induced subgraph by V'V the complement of a graph G, connected, connected components strongly connected, connected directed weakly connected

2. connected, Euler and Hamilton paths Prove: G is connected (1)there is a path from any vertex to any other vertex (2)Suppose G is disconnected 1) k connected components(k>1) 2)There exist u,v such that is no path between u,v Shortest-path problem

Prove that the complement of a disconnected graph is connected. Let G be a simple graph with n vertices. Show that ifδ(G) >[n/2]-1, then G is connected. Show that a simple graph G with an vertices is connected if it has more than (n-1)(n-2)/2 edges. Theorems, examples, and exercises

Determine whether there is a Euler cycle or path, determine whether there is a Hamilton cycle or path. Give an argument for your answer. Let the number of edges of G be m. Suppose m≥(n2-3n+6)/2, where n is the number of vertices of G. Show that (G-S)≤|S| for each nonempty proper subset S of V(G). Hamilton cycle! Theorems, examples, and exercises

3.Trees Theorem 5.12 spanning tree minimum spanning tree Theorem 5.14 Example: Let G be a simple graph with n vertices. Show that ifδ(G) >[n/2]-1, then G has a spanning tree First: G is connected, Second:By theorem 5.14⇒ G has a spanning tree Path ,leave

1. Let G be a tree with two or more vertices 1.Let G be a tree with two or more vertices. Then G is a bipartite graph. 2.Let G be a simple graph with n vertices. Show that ifδ(G) >[n/2]-1, then G is a tree or contains three spanning trees at least.

m-ary tree , full m-ary tree, optimal tree Find a minimum spanning tree by Prim’s algorithms or Kruskal’s algorithm m-ary tree , full m-ary tree, optimal tree By Huffman algorithm, find optimal tree , w(T) Theorems, examples, and exercises

4. Transport Networks and Graph Matching Maximum flow algorithm Prove:theorem 5.22, examples, and exercises matching, maximum matching. M-saturated, M-unsaturated perfect matching (bipartite graph), complete matching M-alternating path (cycle) M-augmenting path Prove:Theorem 5.23 Prove: G has a complete matching,by Hall’s theorem examples, and exercises

5. Planar Graphs Euler’s formula, Corollary By Euler formula,Corollary, prove Example,exercise Vertex colorings Region(face) colorings Edge colorings Chromatic polynomials Let G is a planar graph. If (G)=2 then G is a bipartite graph Let G is a planar graph. If (G)=2 then G does not contain any odd simple circuit.

Prove theorem 6.3 by theorem 6.3 prove IV Abstract algebra 1. algebraic system n-ary operation: SnS function algebraic system :nonempty set S, Q1,…,Qk(k1), [S;Q1,…,Qk]。 Associative law, Commutative law, Identity element, Inverse element, Distributive laws homomorphism, isomorphism Prove theorem 6.3 by theorem 6.3 prove

2. Semigroup, monoid, group Order of an element order of group cyclic group Prove theorem 6.14 Example,exercise

3. Subgroups, normal subgroups ,coset, and quotient groups By theorem 6.20(Lagrange's Theorem), prove Example: Let G be a finite group and let the order of a in G be n. Then n| |G|. Example: Let G be a finite group and |G|=p. If p is prime, then G is a cyclic group. Let G =, and consider the binary operation. Is [G; ●] a group? Let G be a group. H=. Is H a subgroup of G? Is H a normal subgroup? Proper subgroup

Let  is an equivalence relation on the group G, and if axax’ then x x‘ for a,x,x‘G. Let H={x|xe, x‘G}. Prove: H is a subgroup of G. xx-1=ex=xe xe, y e x-1xy=ye=x-1x

4. The fundamental theorem of homomorphism for groups Homomorphism kernel homomorphism image Prove: Theorem 6.23 By the fundamental theorem of homomorphism for groups, prove¨[G/H;][G';] Prove: Theorem 6.25 examples, and exercises

5. Ring and Field Ring, Integral domains, division rings, field Identity of ring and zero of ring commutative ring Zero-divisors Find zero-divisors Let R=, and consider two binary operations. Is [G; +,●] a ring, Integral domains, division rings, field? Let ring A there be one and only a right identity element. Prove A is an unitary ring.

Let e is right identity element of A. For aA,ea-a+eA, For xA,x(ea-a+e)=? ea-a+e right identity element of A ea-a+e=e, ea=a, e is left identity element of A.。

Quotient ring, Find zero-divisors, ideal, Integral domains? characteristic of a ring prove: Theorem 6.32 subring, ideal, Principle ideas Let R be a ring. I=… Is I a subring of R? Is I an ideal? Proper ideal Quotient ring, Find zero-divisors, ideal, Integral domains? By the fundamental theorem of homomorphism for rings(T 6.37), prove [R/ker;,] [(R);+’,*’] examples, and exercises

Example: Let R be a commutative ring, and H be an ideal of R Example: Let R be a commutative ring, and H be an ideal of R. Prove that quotient ring R/H is an integral domain  For any a,bR, if abH, then aH or bH. Proof: (1)If quotient ring R/H is an integral domain, then aH or bH when abH where a,bR. (2)R is a commutative ring, and H be an ideal of R. If aH or bH when abH where a,bR, then quotient ring R/H is an integral domain.

答疑 1月 日上午9:00-11:00 下午1:30-4:00 地点: 软件楼 房间 1月 日下午1:30-4:00 地点: 软件楼