On enumeration of conjugacy classes of Coxeter elements

DOI10.1090/S0002-9939-08-09543-9MaRDI QIDQ3542033zbMATH OpenFDO

Authors M. Macauley, Henning S. Mortveit

Publication date 27 November 2008

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0711.1140

zbMATH Keywords

Coxeter elementCoxeter groupscycle-edgegraphsource-to-sink conversion

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorics of partially ordered sets (06A07) Conjugacy classes for groups (20E45) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

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.

Recommendations

• Posets from admissible Coxeter sequences.
• Conjugacy classes and straight elements in Coxeter groups.
• The enumeration of Coxeter elements
• Conjugacy relation on Coxeter elements
• On non-conjugate Coxeter elements in well-generated reflection groups

Cites work

• Acyclic orientations of random graphs
• Chip-firing games on graphs
• Conjugacy relation on Coxeter elements
• Cycle equivalence of graph dynamical systems
• Enumerating degree sequences in digraphs and a cycle--cocycle reversing system
• Generalized associahedra via quiver representations
• scientific article; zbMATH DE number 47598 (Why is no real title available?)
• scientific article; zbMATH DE number 52944 (Why is no real title available?)
• Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs
• Syzygies of oriented matroids
• The enumeration of Coxeter elements

Cited in

(15)

• Cone types, automata, and regular partitions in Coxeter groups
• Chromatic polynomials of graphs from Kac-Moody algebras
• Attractor stability in finite asynchronous biological system models
• Toric partial orders
• Conjugacy classes of involutions in Coxeter groups
• An atlas of limit set dynamics for asynchronous elementary cellular automata
• scientific article; zbMATH DE number 4123124 (Why is no real title available?)
• On the cyclically fully commutative elements of Coxeter groups.
• Coxeter groups and asynchronous cellular automata
• Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
• Cycle equivalence of finite dynamical systems containing symmetries
• Posets from admissible Coxeter sequences.
• Asynchronous, finite dynamical systems
• Lipschitz continuity under toric equivalence for asynchronous Boolean networks
• The enumeration of Coxeter elements

This page was built for publication: On enumeration of conjugacy classes of Coxeter elements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3542033)