Coursebooks 2017-2018

PDF
 

Packing and covering

MATH-465

Lecturer(s) :

Language:

English

Remarque

Pas donné en 2017-18 - Cours donnés en alternance tous les deux ans

Summary

How many objects of a given shape and size can be packed into a large box of fixed volume? We give a systematic introduction into the rich theory that has grown out of the above questions. Connections to number theory, coding theory, potential theory, and robotics will also be presented.

Content

  1. Geometry of numbers
  2. Approximation of convex sets by polygons
  3. Packing and covering with congruent convex discs
  4. Lattice packing and lattice covering
  5. The method of cell decomposition
  6. Methos of Blichfeldt and Rogers
  7. Efficient ramdom arrangements

Keywords

Learning Prerequisites

Required courses

Recommended courses

Discrete Mathematics of Graph Theory

Learning Outcomes

By the end of the course, the student must be able to:

Transversal skills

Teaching methods

Lectures and exercise sessions

Expected student activities

Solution of homework problems and other assignment

Assessment methods

Oral exam

Supervision

Office hours Yes
Others Office hours Tuesday morning

Resources

Bibliography

Pach-Agarwal: Combinatorial Geometry (Wiley)

Websites

In the programs

Reference week

 MoTuWeThFr
8-9     
9-10     
10-11     
11-12     
12-13     
13-14     
14-15     
15-16     
16-17     
17-18     
18-19     
19-20     
20-21     
21-22     
 
      Lecture
      Exercise, TP
      Project, other

legend

  • Autumn semester
  • Winter sessions
  • Spring semester
  • Summer sessions
  • Lecture in French
  • Lecture in English
  • Lecture in German