Cambrian Acyclic Domains: Counting c-singletons

摘要

We study the size of certain acyclic domains that arise from geometric and combinatorial constructions. These acyclic domains consist of all permutations visited by commuting equivalence classes of maximal reduced decompositions if we consider the symmetric group and, more generally, of allc-singletons of a Cambrian lattice associated to the weak order of a finite Coxeter group. For this reason, we call these setsCambrian acyclic domains. Extending a closed formula of Galambos-Reiner for a particular acyclic domain called Fishburn's alternating scheme, we provide explicit formulae for the size of any Cambrian acyclic domain and characterize the Cambrian acyclic domains of minimum or maximum size.