Rank computing of configurations on bi-complete graphs
Báo cáo viên: Trần Thị Thu Hương

Thời gian: 9h00, ngày thứ 5, ngày 8 tháng 2 năm 2018
Địa điểm: Phòng 611 - 612, nhà A6, Viện Toán học, 18 Hoàng Quốc Việt
Tóm tắt: Rank computing of configurations on complete graphs is given by Cori and Le Borgne using Dyckwords associated to superstable configurations in 2016. Thereby, rank computing problem on complete graph can be executed in linear time. We consider the rank computing problem of configurations of chip firing games on bi-complete graphs, which are graphs accumulated by two complete graphs at a vertex. We give an optimization formula for the rank of superstable configurations in term of the rank of corresponding superstable configurations on each complete graph. This formula allows us to compute this rank in polynomial time. Last, we discuss on further tasks for the current problem and relevant problems. The work is joint with Cori and Le Borgne.