Introduction
Introduction
Discrete Structures
Johnnie Baker
[email protected]
Introduction
Bart Selman 1
CS2800
Acknowledgement
Bart Selman 2
CS2800
Textbook
Bart Selman 4
CS2800
Discrete vs. Continuous Mathematics
Continuous Mathematics
It considers objects that vary continuously;
Example: analog wristwatch (separate hour, minute, and second hands).
From an analog watch perspective, between 1 :25 p.m. and 1 :26 p.m.
there are infinitely many possible different times as the second hand moves
around the watch face.
Bart Selman 5
CS2800
Discrete vs. Continuous Mathematics
Discrete Mathematics
It considers objects that vary in a discrete way.
Example: digital wristwatch.
On a digital watch, there are only finitely many possible different times
between 1 :25 P.M. and 1:27 P.M. A digital watch does not show split
seconds: - no time between 1 :25:03 and 1 :25:04. The watch moves from one
time to the next.
Integers --- core of discrete mathematics
Discrete mathematics --- models and tools for analyzing real-world
phenomena that change discretely over time and therefore ideal for studying
computer science – computers are digital! (numbers as finite bit strings; data
structures, all discrete! Historical aside: earliest computers were analogue.)
Bart Selman 6
CS2800
What is CS 23022 about?
Bart Selman 7
CS2800
Logic:
Hardware and software specifications
Formal: Input_wire_A
value in {0, 1}
–The router can send packets to the edge system only if it supports the new address space.
– For the router to support the new address space it’s necessary that the latest software release be installed.
–The router can send packets to the edge system if the latest software release is installed.
–The router does not support the new address space.
How to write these specifications in a rigorous / formal way? Use Logic.8 Bart Selman
CS2800
Number Theory:
RSA and Public-key Cryptography
Alice and Bob have never met but they would like to
exchange a message. Eve would like to eavesdrop.
E.g. between you and the Bank of America.
Bart Selman 13
CS2800
Graphs and Networks
•Examples:
– Distribution problems
– Routing problems
Aside: finding the right
– Maximum flow problems problem representation
– Designing computer / phone / road networks is one of the key issues.
– Equipment replacement
– And of course the Internet
Bart Selman 14
CS2800
Networks are
New Science of Networks pervasive
Sub-Category Graph
No Threshold
NYS Electric
Power Grid Network of computer scientists
ReferralWeb System
15
Cybercommunities
(Thorp,Strogatz,Watts)
(Kautz and Selman) (Automatically discovered)
Kleinberg et al
Example: Coloring a Map
Abstract the
essential info:
Proof: Appel and Haken 1976; careful case analysis performed by computer; proof
reduced the infinitude of possible maps to 1,936 reducible configurations (later
reduced to 1,476) which had to be checked one by one by computer. The computer
program ran for hundreds of hours. The first significant computer-assisted
mathematical proof. Write-up was hundreds of pages including code!
20
Scheduling of Final Exams
How can the final exams at Kent State be scheduled so that no student has
two exams at the same time? (Note not obvious this has anything to do
with graphs or graph coloring!)
Graph:
A vertex correspond to a course.
An edge between two vertices denotes that there is at least one common
student in the courses they represent.
Each time slot for a final exam is represented by a different color.
21
Scheduling of Final Exams
1 1
Time Courses
Period
2 7 2 I 1,6
7
II 2
III 3,5
IV 4,7
6 3 6 3
5 4 5 4
Why is mimimum
What are the constraints between courses? number of colors
Find a valid coloring
useful? 22
Example 2:
Traveling Salesman
25
13,509 cities in the US
13508!= 1.4759774188460148199751342753208e+49936
26
The optimal tour!
Probability and Chance
Bayes Rule
29
“18th-century theory is new force in computing” CNET ’07
Probability and Chance, cont.
30
Probability and Chance, cont.
Computer scientist have recently found a remarkable way to do this:
“holographic proofs”
Started with results from the early nineties (Arora et al. ‘92) with recent refinements
(Dinur ’06). Combines ideas from coding theory, probability, algebra, computation, and
graph theory. It’s an example of one of the latest advances in discrete mathematics .
See Bernard Chazelle, Nature ’07.
Course Themes, Goals, and Course Outline
Bart Selman 32
CS2800
Goals of CS 23022
Introduce students to a range of mathematical tools from discrete
mathematics that are key in computer science
Mathematical Sophistication
How to write statements rigorously Practice works!
How to read and write theorems, lemmas, etc.
How to write rigorous proofs
Bart Selman 36
CS2800