"Babes-Bolyai" University of Cluj-Napoca
Faculty of Mathematics and Computer Science

Selected topics of combinatorics
Code
Semes-
ter
Hours: C+S+L
Credits
Type
Section
MI068
6
2+0+1
5
optional
Informatică
MI068
6
2+1+0
5
optional
Matematică-Informatică
Teaching Staff in Charge
Prof. KASA Zoltan, Ph.D., kasa@cs.ubbcluj.ro
Aims
Familiarization with the combinatorics notions, which are not treated in other courses.
Content
1. Generalization of combinations and permutations.
2. Generating functions.
3. Counting and enumerating problems. Using generating functions in counting problems.
4. Remarkable numbers in combinatorics (Fibonacci, Catalan, Stirlin, Bell)
5. Principles in combinatorisc.
6. Combinatorics of words. Complexity of finite and infinitye words.
References
1. I. Tomescu: Introducere in combinatorica, Ed. Tehnica, 1975.
2. Cormen-Leiserson-Rivest: Algoritmusok, Mûszaki Könyvkiadó, Budapest, I. kiadás 1997, II. kiadás 1999, III. kiadás 2000.
3. Cormen-Leiserson-Rivest: Introducere in algoritmi, Ed. Libris Computer Agora, 2000.
3. Kása Zoltán: Matematica discreta, UBB, Cluj, 2001.
4. Lovász László: Kombinatorikai problémák és feladatok, Typotex Kiadó, Budapest, 1999.
5. R. L. Graham-D. E. Knuth-O. Patashnik: Konkrét matematika, Műszaki Kiadó, Budapest,
1998.
Assessment
Written exam.