On Enumeration of Conjugacy Classes of Coxeter Elements
arXiv:0711.1140 · doi:10.1090/S0002-9939-08-09543-9
Abstract
In this paper we study the equivalence relation on the set of acyclic orientations of a graph Y that arises through source-to-sink conversions. This source-to-sink conversion encodes, e.g. conjugation of Coxeter elements of a Coxeter group. We give a direct proof of a recursion for the number of equivalence classes of this relation for an arbitrary graph Y using edge deletion and edge contraction of non-bridge edges. We conclude by showing how this result may also be obtained through an evaluation of the Tutte polynomial as T(Y,1,0), and we provide bijections to two other classes of acyclic orientations that are known to be counted in the same way. A transversal of the set of equivalence classes is given.
Added a few results about connections to the Tutte polynomial
References in corpus (1)
Cited by in corpus (8)
- Cycle Equivalence of Graph Dynamical Systems
- Equivalences on Acyclic Orientations
- Attractor Stability in Finite Asynchronous Biological System Models
- Dynamics on networks. Case of Heterogeneous Opinion Status Model
- The Peterson recurrence formula for the chromatic discriminant of a graph
- Toric partial orders
- On the Cyclically Fully Commutative Elements of Coxeter Groups
- Posets from Admissible Coxeter Sequences