DISCRETE MATHEMATICS

Course objectives

General objectives: to acquire the basic knowledge and techniques of the combinatorics of permutations, enumerative combinatorics, combinatorics of integer partitions, generating functions and understand its main applications. Specific objectives: Knowledge and understanding: at the end of the course the student will have acquired the basic notions and results related to Combinatorics of permutations (with particular regard to enumerations, representation with trees, cycles, linear orderings, random generation) and enumerative combinatorics (especially concerning its algebraic aspects, via generating functions). She will also know at least the set of the most significant problems in which these theories find applications. Apply knowledge and understanding: the student will be able to solve algebraic-combinatorial problems requiring the use of techniques related to the theories of combinatorics of permutations, enumerative combinatorics, of posets and integer partitions, and to discuss how problems (in non-purely mathematical environments) can be modeled by means of the acquired tools. Critical and judgmental skills: the student will have the basis to analyze how the topics of combinatorics and Algebra and Linear Algebra treated in basic courses can find applications in different fields and be an essential tool in solving concrete problems. Communication skills: The learner will have the ability to communicate rigorously the ideas and contents shown in the course. Learning skills: the acquired knowledge will allow the student to carry on an autonomous study in a possible interdisciplinary context (for those who have knowledge and interests in Applied Mathematics, Genetics, Computer Science, Data Science).

Channel 1
PAOLO BRAVI Lecturers' profile

Program - Frequency - Exams

Course program
- Permutations: cycles, inversions, descents, pattern avoidance. - Partitions: diagrams, generating functions and various identities. - The principle of inclusion-exclusion. - Partially ordered sets: Moebius inversion principle. - Rational generation functions.
Prerequisites
A basic course in Linear Algebra and a basic course in Algebra
Books
Richard Stanley, Enumerative Combinatorics, volume 1, second edition, Cambridge University Press, 2011.
Teaching mode
Lectures and exercise classes
Frequency
Attendance is recommended.
Exam mode
The exam aims to evaluate learning through a written test (consisting in solving problems of the same type as those carried out in the exercises). To pass the exam it is necessary to achieve a grade of not less than 18/30. The student must demonstrate that he/she has acquired sufficient knowledge of the main topics and that he/she is able to carry out at least the simplest of the assigned exercises. To achieve a score of 30/30 cum laude, the student must demonstrate that he/she has acquired an excellent knowledge of all the topics covered during the course and to be able to connect them in a logical and consistent way.
Lesson mode
Lectures and exercise classes
  • Lesson code1031836
  • Academic year2025/2026
  • CourseMathematics
  • CurriculumAlgebra e Geometria
  • Year1st year
  • Semester2nd semester
  • SSDMAT/02
  • CFU6