Sortable elements for quivers with cycles.

MaRDI QIDQ986691zbMATH OpenFDO

Authors Nathan Reading, David E Speyer

Publication date 12 August 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0907.2849, https://eudml.org/doc/227611, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r90.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

combinatorics of cluster algebrasCoxeter elementsCoxeter groupsorientations of Coxeter diagramssortable elementsweak order

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Cluster algebras (13F60) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Abstract: Each Coxeter element c of a Coxeter group W defines a subset of W called the c-sortable elements. The choice of a Coxeter element of W is equivalent to the choice of an acyclic orientation of the Coxeter diagram of W. In this paper, we define a more general notion of Omega-sortable elements, where Omega is an arbitrary orientation of the diagram, and show that the key properties of c-sortable elements carry over to the Omega-sortable elements. The proofs of these properties rely on reduction to the acyclic case, but the reductions are nontrivial; in particular, the proofs rely on a subtle combinatorial property of the weak order, as it relates to orientations of the Coxeter diagram. The c-sortable elements are closely tied to the combinatorics of cluster algebras with an acyclic seed; the ultimate motivation behind this paper is to extend this connection beyond the acyclic case.

Review text

Summary: Each Coxeter element \(c\) of a Coxeter group \(W\) defines a subset of \(W\) called the \(c\)-sortable elements. The choice of a Coxeter element of \(W\) is equivalent to the choice of an acyclic orientation of the Coxeter diagram of \(W\). In this paper, we define a more general notion of \(\Omega\)-sortable elements, where \(\Omega\) is an arbitrary orientation of the diagram, and show that the key properties of \(c\)-sortable elements carry over to the \(\Omega\)-sortable elements. The proofs of these properties rely on reduction to the acyclic case, but the reductions are nontrivial; in particular, the proofs rely on a subtle combinatorial property of the weak order, as it relates to orientations of the Coxeter diagram. The \(c\)-sortable elements are closely tied to the combinatorics of cluster algebras with an acyclic seed; the ultimate motivation behind this paper is to extend this connection beyond the acyclic case.

Recommendations

• Sortable elements in infinite Coxeter groups.
• The sorting order on a Coxeter group
• Clusters, Coxeter-sortable elements and noncrossing partitions
• Sortable elements and Cambrian lattices.
• Torsion pairs for quivers and the Weyl groups

Cited in

(9)

• An affine almost positive roots model
• Universal geometric cluster algebras
• Sortable elements in infinite Coxeter groups.
• Clusters, Coxeter-sortable elements and noncrossing partitions
• Cambrian frameworks for cluster algebras of affine type
• Stack-sorting for Coxeter groups
• Acyclic cluster algebras revisited
• A Cambrian framework for the oriented cycle
• Sortable elements and Cambrian lattices.

This page was built for publication: Sortable elements for quivers with cycles.

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