This note shows that for any cluster algebra, the exchange graph has the non-leaving-face property.M S C 2 0 2 0 13F60, 05E45 (primary)
INTRODUCTIONGeneralized associahedra were introduced by Fomin and Zelevinsky in connection to cluster algebras of finite type. Ceballos and Pilaud [6] showed that all type 𝐵-𝐶-𝐷 associahedra have the non-leaving-face property, namely, any geodesic connecting two vertices in the graph of the polytope stays in the minimal face containing both. In fact, this property was already proven by Sleator, Tarjan, and Thurston [12] for associahedra of type 𝐴, before the name was coined in [6].For a finite Coxeter system (𝑊, 𝑆), Williams [13] established the non-leaving-face property for 𝑊permutahedra and 𝑊-associahedra. However, it is known that there are examples related to the associahedron that do not satisfy the non-leaving-face property (cf. [6]).An important combinatorial invariant of a cluster algebra is its exchange graph. The abstract exchange graph was introduced in [1], which unifies various exchange graphs arising from representation theory of finite-dimensional algebras, marked surfaces, cluster algebras, and so on. An abstract exchange graph has the structure of a generalized polytope and then the non-leavingface property can be formulated in this general situation. In [2], the non-leaving-face property for Dedicated to Professor Jie Xiao on the Occasion of his 60th Birthday