|
СЕМИНАРЫ |
Коллоквиум Факультета компьютерных наук НИУ ВШЭ
|
|||
|
[Bruhat interval polytopes which are cubes] Mikiya Masuda |
|||
Аннотация: For a pair of permutations with The Bruhat interval polytope In this talk, I will explain that a certain family of Bruhat interval polytopes, which are particularly combinatorially equivalent to a cube, determines triangulations of a polygon. It turns out that the Wedderburn-Etherington numbers which count unordered binary trees appear in their classification. If time permits, I will discuss another family of Bruhat interval polytopes and their classification, where directed paths, more generally directed Dynkin diagrams appear. This talk is based on recent joint work with Eunjeong Lee (IBS-CGP) and Seonjeong Park (Jeonju Univ.). Язык доклада: английский Website: https://cs.hse.ru/announcements/468719435.html |