Related papers: C-sortable words as green mutation sequences
A maximal green sequence introduced by B. Keller is a certain sequence of quiver mutations at green vertices. T. Br\"ustle, G. Dupont and M. P\'erotin showed that for an acyclic quiver, maximal green sequences are realized as maximal paths…
For a finite Coxeter group W, a subword complex is a simplicial complex associated with a pair (Q, \rho), where Q is a word in the alphabet of simple reflections, \rho is a group element. We describe the transformations of such a complex…
We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then…
This paper studies connections between the preprojective representations of a valued quiver, the (+)-admissible sequences of vertices, and the Weyl group by associating to each preprojective representation a canonical (+)-admissible…
For a finite dimensional hereditary algebra, we consider: exceptional sequences in the category of finite dimensional modules, silting objects in the bounded derived category, and m-cluster tilting objects in the m-cluster category. There…
Baxter permutations are known to be in bijection with a wide number of combinatorial objects. Previously, it was shown that each of these objects had a natural involution which was carried equivariantly by the known bijections, and the…
Let C be a coalgebra and consider the Grothendieck groups of the categories of the socle-finite injective right and left C-comodules. One of the main aims of the paper is to study Coxeter transformation, and its dual, of a pointed sharp…
This paper gives a definitive solution to the problem of describing conjugacy classes in arbitrary Coxeter groups in terms of cyclic shifts. Let $(W,S)$ be a Coxeter system. A cyclic shift of an element $w\in W$ is a conjugate of $w$ of the…
A subsemigroup S of a semigroup Q is a left order in Q and Q is a semigroup of left quotients of S if every element of Q can be expressed as a# b where a and b are elements of S and if, in addition, every element of S that is square…
We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new…
We give an interpretation of the map $\pi^c$ defined by Reading, which is a map from the elements of a Coxeter group to the $c$-sortable elements, in terms of the representation theory of preprojective algebras. Moreover, we study a close…
The Burrows-Wheeler Transform is a string transformation that plays a fundamental role for the design of self-indexing compressed data structures. Over the years, researchers have successfully extended this transformation outside the…
We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…
A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…
In a Coxeter group $W$, an element is fully commutative if any two of its reduced expressions can be linked by a series of commutation of adjacent letters. These elements have particularly nice combinatorial properties, and also index a…
A permutation representation of a Coxeter group $W$ naturally defines an absolute order. This family of partial orders (which includes the absolute order on $W$) is introduced and studied in this paper. Conditions under which the associated…
The exchange graph of a cluster algebra encodes the combinatorics of mutations of clusters. Through the recent "categorifications" of cluster algebras using representation theory one obtains a whole variety of exchange graphs associated…
Let W be an arbitrary Coxeter group. If two elements have expressions that are cyclic shifts of each other (as words), then they are conjugate (as group elements) in W. We say that w is "cyclically fully commutative" (CFC) if every cyclic…
We characterise when a simple Happel-Reiten-Smalo tilt of a length heart is again a length heart in terms of approximation theory and the existence of a stability condition with a phase gap. We apply simple-minded reduction to provide a…
An involution in a Coxeter group has an associated set of involution words, a variation on reduced words. These words are saturated chains in a partial order first considered by Richardson and Springer in their study of symmetric varieties.…