Related papers: Subword complexes and edge subdivisions

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…

Let (\Pi,\Sigma) be a Coxeter system. An ordered list of elements in \Sigma and an element in \Pi determine a {\em subword complex}, as introduced in our paper on Gr\"obner geometry of Schubert polynomials (math.AG/0110058). Subword…

In this paper, we use subword complexes to provide a uniform approach to finite type cluster complexes and multi-associahedra. We introduce, for any finite Coxeter group and any nonnegative integer k, a spherical subword complex called…

For a Coxeter element $c$ of a finite Coxeter group, we consider a family of subword complexes parameterized by reduced expressions of the longest element. This family generalizes $c-$cluster complexes. We describe vertices of these…

Subword complexes are simplicial complexes introduced by Knutson and Miller to illustrate the combinatorics of Schubert polynomials and determinantal ideals. They proved that any subword complex is homeomorphic to a ball or a sphere and…

We prove that the Stanley--Reisner ideal of the Alexander dual of the subword complexes in Coxeter groups has linear quotients with respect to the lexicographical order of the minimal monomial generators. As a consequence, we obtain a…

Given an involutive automorphism $\theta$ of a Coxeter system $(W,S)$, let $\mathfrak{I}(\theta) \subseteq W$ denote the set of twisted involutions. We provide a minimal set of moves that can be added to the braid moves, in order to connect…

We describe an algorithm to identify a minimal set of "braid relations" which span and preserve all sets of involution words for twisted Coxeter systems of finite or affine type. We classify the cases in which adding the smallest possible…

Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…

Consider a graph with vertex set S. A word in the alphabet S has the intervening neighbours property if any two occurrences of the same letter are separated by all its graph neighbours. For a Coxeter graph, words represent group elements.…

Let $\Gamma$ be a Coxeter graph, let $(W,S)$ be its associated Coxeter system, and let $(A,\Sigma$) be its associated Artin-Tits system. We regard $W$ as a reflection group acting on a real vector space $V$. Let $I$ be the Tits cone, and…

We generalize the brick polytope of V. Pilaud and F. Santos to spherical subword complexes for finite Coxeter groups. This construction provides polytopal realizations for a certain class of subword complexes containing all cluster…

We define the Coxeter cochain complex of a Coxeter group (G,S) with coefficients in a Z[G]-module A. This is closely related to the complex of simplicial cochains on the abstract simplicial complex I(S) of the commuting subsets of S. We…

The subword complexity of a word $w$ over a finite alphabet $\mathcal{A}$ is a function that assigns for each positive integer $n$, the number of distinct subwords of length $n$ in $w$. The subword complexity of a word is a good measure of…

For any Coxeter group W, we define a filtration of H^*(W;ZW) by W-submodules and then compute the associated graded terms. More generally, if U is a CW complex on which W acts as a reflection group we compute the associated graded terms for…

The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…

Multitriangulations, and more generally subword complexes, yield a large family of simplicial complexes that are homeomorphic to spheres. Until now, all attempts to prove or disprove that they can be realized as convex polytopes faced major…

We study the interplay between the discrete geometry of Bruhat poset intervals and subword complexes of finite Coxeter systems. We establish connections between the cones generated by cover labels for Bruhat intervals and of root…

In this article, we investigate the existence of joins in the weak order of an infinite Coxeter group W. We give a geometric characterization of the existence of a join for a subset X in W in terms of the inversion sets of its elements and…

For a Coxeter group (W,S), a permutation of the set S is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first letter to the end of the word is called a rotation and two Coxeter…