English
Related papers

Related papers: C-sortable words as green mutation sequences

200 papers

We introduce operators $\mathsf{hare}$ and $\mathsf{tortoise}$, which act on words as natural generalizations of West's stack-sorting map. We show that the heuristically slower algorithm $\mathsf{tortoise}$ can sort words arbitrarily faster…

Combinatorics · Mathematics 2018-12-11 Colin Defant , Noah Kravitz

We prove triviality of the centre of arbitrary Hecke algebras of irreducible non-finite non-affine type. This result is obtained as a consequence of the following structure result for conjugacy classes of the underlying Coxeter groups. If…

Group Theory · Mathematics 2024-02-23 Timothée Marquis , Sven Raum

A word over an ordered alphabet is said to be clustering if identical letters appear adjacently in its Burrows-Wheeler transform. Such words are strictly related to (discrete) interval exchange transformations. We use an extended version of…

Formal Languages and Automata Theory · Computer Science 2025-04-28 Francesco Dolce , Christian B. Hughes

In 1993, Savage, Squire, and West described an inductive construction for generating every acyclic orientation of a chordal graph exactly once, flipping one arc at a time. We provide two generalizations of this result. Firstly, we describe…

Combinatorics · Mathematics 2022-12-09 Jean Cardinal , Hung P. Hoang , Arturo Merino , Ondřej Mička , Torsten Mütze

The sign coherence phenomenon is an important feature of c-vectors in cluster algebras with principal coefficients. In this note, we consider a more general version of c-vectors defined for arbitrary cluster algebras of geometric type and…

Combinatorics · Mathematics 2023-02-23 Michael Gekhtman , Tomoki Nakanishi

We present a simple bijection between permutation matrices and descending plane partitions without special parts. This bijection is already mentioned in work of P. Lalonde (without giving the details); it involves the inversion words of…

Combinatorics · Mathematics 2017-03-08 Markus Fulmek

We present a simple resolution proof system for higher-order constrained Horn clauses (HoCHC) - a system of higher-order logic modulo theories - and prove its soundness and refutational completeness w.r.t. the standard semantics. As…

Logic in Computer Science · Computer Science 2021-06-22 C. -H. Luke Ong , Dominik Wagner

Let $Q$ be an acyclic quiver. Associated with any element $w$ of the Coxeter group of $Q$, triangulated categories $\underline{\Sub}\Lambda_w$ were introduced in \cite{Bua2}. There are shown to be triangle equivalent to generalized cluster…

Representation Theory · Mathematics 2011-11-21 Claire Amiot

We show that the set R(w_0) of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon. More specifically, R(w_0) possesses a natural cyclic action given by moving the first letter of…

Combinatorics · Mathematics 2009-05-19 T. Kyle Petersen , Luis Serrano

Exceptional sequences are certain ordered sequences of quiver representations. We use noncrossing edge-labeled trees in a disk with boundary vertices (expanding on T. Araya's work) to classify exceptional sequences of representations of Q,…

Representation Theory · Mathematics 2014-12-11 Alexander Garver , Jacob P. Matherne

The usual combinatorial model for the 0-Hecke algebra of the symmetric group is to consider the algebra (or monoid) generated by the bubble sort operators. This construction generalizes to any finite Coxeter group W. The authors previously…

Combinatorics · Mathematics 2011-02-07 Florent Hivert , Anne Schilling , Nicolas M. Thiéry

Let (W,S) be a finite rank Coxeter system with W infinite. We prove that the limit weak order on the blocks of infinite reduced words of W is encoded by the topology of the Tits boundary of the Davis complex X of W. We consider many special…

Group Theory · Mathematics 2014-09-19 Thomas Lam , Anne Thomas

The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…

Logic in Computer Science · Computer Science 2007-05-23 Thomas Colcombet

We classify the Ext-quivers of hearts in the bounded derived category D(A_n) and the finite-dimensional derived category D(\Gamma_N A_n) of the Calabi-Yau-N Ginzburg algebra D(\Gamma_N A_n). This provides the classification for Buan-Thomas'…

Representation Theory · Mathematics 2015-05-27 Yu Qiu

We investigate the existence and non-existence of maximal green sequences for quivers arising from weighted projective lines. Let $Q$ be the Gabreil quiver of the endomorphism algebra of a basic cluster-tilting object in the cluster…

Representation Theory · Mathematics 2024-02-15 Changjian Fu , Shengfei Geng

We give a precise definition of mutation of skew symmetrizable matrices over group rings and relate it to folding and mutation of quivers with symmetries. These matrices can have non-zero diagonal entries and we explain a mutation rule in…

Combinatorics · Mathematics 2026-01-23 Dani Kaufman , Carmen Alves Sabin

We define a tower of injections of $\tilde{C}$-type Coxeter groups $W(\tilde C_{n})$ for $n\geq 1$. We define a tower of Hecke algebras and we use the faithfulness at the Coxeter level to show that this last tower is a tower of injections.…

Group Theory · Mathematics 2016-07-18 Sadek Al Harbat

We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…

Combinatorics · Mathematics 2026-05-14 Nathan Reading

Let $\mathcal{H}$ be a hereditary abelian category over a field $k$ with finite dimensional $\operatorname{Hom}$ and $\operatorname{Ext}$ spaces. It is proved that the bounded derived category $\mathcal{D}^b(\mathcal{H})$ has a silting…

Rings and Algebras · Mathematics 2024-02-15 Wei Dai , Changjian Fu

Given a string of characters, the Burrows-Wheeler Transform rearranges the characters in it so as to produce another string of the same length which is more amenable to compression techniques such as move to front, run-length encoding, and…

Data Structures and Algorithms · Computer Science 2012-01-17 Joseph Yossi Gil , David Allen Scott