分野別セミナー

A hyperplane arrangement is a finite set of hyperplanes in a vector space. This s originally from the Weyl arrangement, the set of all reflecting hyperplanes of a reflecting group. Since arrangements themselves are very simple, there are a lot of ways to research them. In this talk, we start from a counting problem of the connected component of the complement of arrangements, this is a combinatorics. And we explain how it is related to topology and algebra. If time permits, we want to explain the relation with the social welfare function.