Literature list to be prepared for lecture “Discrete Structures”

Dr. F. Stehn July 20, 2022

Topics and Literature

a) Landau Symbols (“Big Oh-Notation”)

• Cormen et al. [1], Chapter 3: “Growth of Functions”

b) Proof Strategies

• Jenkyns et al. [2], Chapters 3.3 to 3.6

c) Sets/Relations/Functions

• O’Regan [3], Chapter 2: “Sets, Relations and Functions”

• Jenkyns et al. [2]

– Chapter 2: “Sets, Sequences, and Counting”

– Chapter 7.1 to 7.4: “Relations: Especially on (Integer) Sequences”

d) Number-Theory

• O’Regan [3], Chapter 5: “NumberTheory”

e) Combinatorics

• Jenkyns et al. [2], Chapter 2: “Sets, Sequences, and Counting”

References
[1] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algo-
rithms, Third Edition. The MIT Press, 3rd edition, 2009.

[2] Tom Jenkyns and Ben Stephenson. Fundamentals of Discrete Math for Computer Science: A Problem-
Solving Primer (Second Edition). Springer Publishing Company, Incorporated, 2018.

[3] Gerard O’Regan. Mathematics in Computing: An Accessible Guide to Historical, Foundational and
Application Contexts (Second Edition). Springer Publishing Company, Incorporated, 2020.