Posets from admissible Coxeter sequences. (Q640460)

Let \(\Gamma\) be an undirected graph and let \(\text{Acyc}(\Gamma)\) be the set of all acyclic orientations of \(\Gamma\). Write \(O_1\sim_\kappa O_2\) in \(\text{Acyc}(\Gamma)\), if \(O_2\) can be obtained from \(O_1\) by a sequence of source-to-sink conversions (called an admissible sequence). This defines an equivalence relation in \(\text{Acyc}(\Gamma)\), the corresponding equivalence classes are called \(\kappa\)-classes. Let \(\text{Acyc}(\Gamma)/\!\sim_\kappa\) be the set of all \(\kappa\)-classes in \(\text{Acyc}(\Gamma)\), denote by \(\kappa(\Gamma)\) its cardinal. Fix a non-bridge edge \(e\) of \(\Gamma\). Let \(\Gamma'_e\) and \(\Gamma''_e\) be the graphs obtained from \(\Gamma\) by deleting and contracting \(e\), respectively. In the paper under review, the authors associate a poset to each \(\kappa\)-class and define a bijection \[ \Theta\colon\text{Acyc}(\Gamma)/\!\sim_\kappa\to(\text{Acyc}(\Gamma'_e)/\!\sim_\kappa)\cup(\text{Acyc}(\Gamma''_e)/\!\sim_\kappa). \] By this bijection, the authors construct a complete invariant of \(\text{Acyc}(\Gamma)/\!\sim_\kappa\). Now let \(\Gamma\) be the Coxeter graph of a Coxeter group \(W\). The authors use the above result to prove that \(\kappa(\Gamma)\) is exactly the number of conjugacy classes of Coxeter elements in \(W\) if \(W\) is of a simply-laced type. Note that the latter was proved by \textit{H. Eriksson} and \textit{K. Eriksson} by a much different approach [see Electron. J. Comb. 16, No. 2, Research Paper R4 (2009; Zbl 1161.20034)].