Time: 9h30, Thursday, January 19, 2017
Location: Room 201, Builiding A5, Institute of Mathematics, Hanoi
Abstract:  A maximizing characteristic for critical configurations of chip-firing games on digraphs Hoang Thach NGUYEN, Thi Thu Huong TRAN Aval et al. proved in [2] that starting from a critical configuration of a chip-firing game on an undirected graph, one can never achieve a stable configuration by reverse firing any non-empty subsets of its vertices. In this paper, we generalize the result to digraphs with a global sink where reverse firing subsets of vertices is replaced with reverse firing multi-subsets of vertices. Consequently, a combinatorial proof for the duality between critical configurations and superstable configurations on digraphs is given. Finally, by introducing the concept of energy vector of a configuration, we show that the critical configurations and the superstable one are the unique configurations with the greatest and smallest (w.r.t. the containment order), respectively, energy vectors in each of their equivalence classes.