Universität Wien

250062 VO Topics in Combinatorics (2025S)

5.00 ECTS (3.00 SWS), SPL 25 - Mathematik

Registration/Deregistration

Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).

Details

Language: English

Lecturers

Classes (iCal) - next class is marked with N

  • Tuesday 04.03. 08:00 - 09:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 11.03. 08:00 - 09:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Thursday 13.03. 13:15 - 14:45 Seminarraum 8 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 18.03. 08:00 - 09:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 25.03. 08:00 - 09:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Thursday 27.03. 13:15 - 14:45 Seminarraum 8 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 01.04. 08:00 - 09:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 08.04. 08:00 - 09:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Thursday 10.04. 13:15 - 14:45 Seminarraum 8 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 29.04. 08:00 - 09:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 06.05. 08:00 - 09:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Thursday 08.05. 13:15 - 14:45 Seminarraum 8 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 13.05. 08:00 - 09:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 20.05. 08:00 - 09:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Thursday 22.05. 13:15 - 14:45 Seminarraum 8 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 27.05. 08:00 - 09:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 03.06. 08:00 - 09:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Thursday 05.06. 13:15 - 14:45 Seminarraum 8 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 17.06. 08:00 - 09:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 24.06. 08:00 - 09:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock

Information

Aims, contents and method of the course

The course will treat the basics of finite automata, automatic sequences and applications to combinatorics of words and transcendence of numbers and formal power series. Automata are a special type of directed graph whose edges are labelled with letters in an alphabet. In the course, we will consider automata that accept or reject certain words, as well as automata that generate sequences as output which are called automatic sequences.
Automatic sequences include many famous sequences like the Thue-Morse sequence, the Rudin-Shapiro sequence and the paperfolding sequence.

Assessment and permitted materials

The grade will be based on participation in the solution of exercises and an oral exam at the end of the course.

Minimum requirements and assessment criteria

Examination topics

Reading list

A large part of the course will be based on parts of the book "Automatic Sequences" of Allouche and Shallit.

Association in the course directory

MALV

Last modified: Tu 04.03.2025 10:26