Universität Wien

250075 VO Selected Topics in Combinatorics (2005W)

Selected Topics in Combinatorics

0.00 ECTS (2.00 SWS), SPL 25 - Mathematik

erstmals am 03.10.2005

Details

Language: German

Lecturers

Classes (iCal) - next class is marked with N

  • Monday 03.10. 10:00 - 12:00 Seminarraum
  • Monday 10.10. 10:00 - 12:00 Seminarraum
  • Monday 17.10. 10:00 - 12:00 Seminarraum
  • Monday 24.10. 10:00 - 12:00 Seminarraum
  • Monday 31.10. 10:00 - 12:00 Seminarraum
  • Monday 07.11. 10:00 - 12:00 Seminarraum
  • Monday 14.11. 10:00 - 12:00 Seminarraum
  • Monday 21.11. 10:00 - 12:00 Seminarraum
  • Monday 28.11. 10:00 - 12:00 Seminarraum
  • Monday 05.12. 10:00 - 12:00 Seminarraum
  • Monday 12.12. 10:00 - 12:00 Seminarraum
  • Monday 09.01. 10:00 - 12:00 Seminarraum
  • Monday 16.01. 10:00 - 12:00 Seminarraum
  • Monday 23.01. 10:00 - 12:00 Seminarraum
  • Monday 30.01. 10:00 - 12:00 Seminarraum

Information

Aims, contents and method of the course

An integer partition is a way of splitting a number n into integer parts. In general there are no explicit formulas for the number of partitions of n with certain properties. But these numbers can be characterized by their generating functions and we can find interesting bijections between different classes of partitions. E.g. Euler has proved that every number n has as many integer partitions into odd parts as into distinct parts. Starting with this theorem we give an elementary introduction to the theory of integer partitions.
Some highlights of the course are Euler¿s pentagonal number theorem, the q-binomial theorem, the triple product identity of Jacobi and the famous Rogers-Ramanujan identities.

Assessment and permitted materials

Minimum requirements and assessment criteria

Examination topics

Reading list

"Integer Partitions" von George E. Andrews und Kimmo Eriksson.

Association in the course directory

Last modified: Mo 07.09.2020 15:40