Directed graphs (digraphs), tournaments (05C20) Partial orders, general (06A06) Combinatorial identities, bijective combinatorics (05A19) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Conjugacy classes for groups (20E45) Reflection and Coxeter groups (group-theoretic aspects) (20F55)
Abstract: We study the equivalence relation on the set of acyclic orientations of an undirected graph G generated by source-to-sink conversions. These conversions arise in the contexts of admissible sequences in Coxeter theory, quiver representations, and asynchronous graph dynamical systems. To each equivalence class we associate a poset, characterize combinatorial properties of these posets, and in turn, the admissible sequences. This allows us to construct an explicit bijection from the equivalence classes over G to those over G' and G", the graphs obtained from G by edge deletion and edge contraction of a fixed cycle-edge, respectively. This bijection yields quick and elegant proofs of two non-trivial results: (i) A complete combinatorial invariant of the equivalence classes, and (ii) a solution to the conjugacy problem of Coxeter elements for simply-laced Coxeter groups. The latter was recently proven by H. Eriksson and K. Eriksson using a much different approach.
Recommendations
- On enumeration of conjugacy classes of Coxeter elements
- The enumeration of Coxeter elements
- scientific article; zbMATH DE number 5942854
- Automorphisms of Coxeter groups of type \(K_n\).
- Cyclically reduced elements in Coxeter groups
- A Class of Rigid Coxeter Groups
- Conjugacy classes of involutions in Coxeter groups
- Freely braided elements in Coxeter groups.
- Homotopy type of the Boolean complex of a Coxeter system.
- Freely braided elements in Coxeter groups. II.
Cited in
(14)- An atlas of limit set dynamics for asynchronous elementary cellular automata
- On the cyclically fully commutative elements of Coxeter groups.
- Adjoining cofinitary permutations. II
- Friends and strangers walking on graphs
- The principal numbers of K. Saito for the types \(A_{l}, D_{l}\) and \(E_{l}\)
- Toric partial orders
- On the diameters of friends-and-strangers graphs
- Attractor stability in finite asynchronous biological system models
- On enumeration of conjugacy classes of Coxeter elements
- scientific article; zbMATH DE number 5548720 (Why is no real title available?)
- Cycle equivalence of finite dynamical systems containing symmetries
- Asynchronous, finite dynamical systems
- Lipschitz continuity under toric equivalence for asynchronous Boolean networks
- Coxeter groups and asynchronous cellular automata
This page was built for publication: Posets from admissible Coxeter sequences.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640460)
