326.006, VL Formales Modellieren, Wolfgang Schreiner / Carsten Schneider / Wolfgang Windsteiger, 2022W
Topic outline

326.006, Wednesday, 15:3017:00, Room: S2 Z74 Start: October 5, 2022
We discuss the formal modeling of mathematical problems that are amenable to algorithms and software from symbolic computation; the models are based on the language of algebra and logic. In this lecture, we discuss particular examples from various application domains. In the accompanying proseminar students are expected to model selected problems and demonstrate their results in the form of small papers and presentations.
As an extra service, some course units may be livestreamed and recorded via the following Zoom Meeting (but no guarantee is given with respect to completeness and quality of the streams, the basic format is onsite, not hybrid):
Zoom Meeting
https://jku.zoom.us/j/95922982482?pwd=ejFPeVEyekswZFRRQ0h4MWlzRlNpdz09
MeetingID: 995 2030 2042 Password: ..modeling 
Preliminary Schedule
 October 5:
 Introduction to course topics.
 October 12, October 19, December 7, December 14:
 Wolfgang Schreiner: Logical Models of Problems and Computations
 November 9, November 16, January 11, January 18:
 Wolfgang Windsteiger: Modeling Problems in Geometry and Discrete Mathematics
 November 16 (17:1518:45), November 23 (17:1518:45), November 30 (17:1518:45):
 Carsten Schneider: Symbolic Summation and the Modeling of Sequences
GradingStudents have to submit 3 positive home assignments to pass the course (if an assignment fails, after the course a substitute is handed out)
 October 5:

In this part of the lecture we will deal with the challenge to model sequences (infinite objects) by using computer algebra technologies.
Special focus will be put on
 modeling sequences tailored for the user in the setting of term algebras;
 modeling sequences in formal difference rings tailored for the computer ;
 connecting the two worlds to extract interesting properties for the user.
The lecture will be enhanced stepwise and the topics will be summarized within the lecture notes that can be found here. In addition, there are slides and a Matheamtica Notebook given here that supplements the lecture.The corresponding homeworks will be explained in the lecture. The precise specification can be found here. Lecture 1: 16. November 2022
Symbolic summation (a short introduction)  Lecture 2: 23. November 2022
Modeling of sequences with a term algebra (the user interface)  Lecture 3: 30. November 2022
Modeling of sequences in difference rings (computer algebra)

We discuss geometric problems and problems that can be modelled in the language of graph theory and in the language of combinatorial optimization. After modelling the problems appropriately we discuss general and special solution techniques and algorithms that can be applied to these problems. Problems discussed will cover
 proving geometrical statements using algebraic techniques,
 the Shortest Path Problem, and
 the Bin Packing Problem.
 proving geometrical statements using algebraic techniques,