Topic outline

  • VL Formal Modeling (SS 2020)

    326.006, Wednesday, 15:30-17:00, S2 046, Start: March 4, 2020

    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.

  • Organization

    Preliminary Schedule

    • March 4:
      • Introduction to course topics.
    • March 11, March 18, May 6, May 13:
      • Wolfgang Schreiner: Logical Models of Problems and Computations
    • March 25, April 1, May 20, May 27:
      • Josef Schicho: Mathematical Models in Mechanics
    • April 22, April 29, June 3, June 10
      • Wolfgang Windsteiger: Modeling Problems in Geometry and Discrete Mathematics

    Grading

    Students have to submit 3 positive home assignments to pass the course (if an assignment fails, after the course a substitute is handed out)

  • Logical Models of Problems and Computations

  • Mathematical Models in Kinematics and Mechanics

    • Read the file qubits.pdf and do the two exercises contained in it. Each exercise have a math part, where there is something to compute and proof, and a nonmath part, where there is an instruction for a "quantum engineer" to write. A quantum engineer is a hypothetical person who knows how to do certain physical operations and who is generally not interested in proofs. 

  • Modeling Problems in Geometry and Discrete Mathematics

    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 techniques from algebra,
    • the Shortest Path Problem, and
    • the Bin Packing Problem.