Institute of Information Science, Academia Sinica

Events

Print

Press Ctrl+P to print from browser

Some open problems in discrete geometry and combinatorics

:::

Some open problems in discrete geometry and combinatorics

  • LecturerProf. Wei-Hsuan Yu (National Central University)
    Host: Meng-Tsung Tsai
  • Time2022-07-20 (Wed.) 13:30 – 15:30
  • LocationAuditorium 106 at IIS New Building
Abstract
In this talk, I will introduce some classical problems in discrete geometry and combinatorics such as sphere packing problems and kissing number problems. Linear programming and semidefinite programming have been used for those problems. I will also mention the problems of the maximum s-distance sets in R^n. Some graph theory approaches will be discussed.