2013/05/23 by Mikhail Gorsky, Gorsky, Mikhail
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Algebraic structures and combinatorial models #Combinatorics (math.CO) #FOS: Mathematics #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1305.5499
openalex publication_date 2013/05/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For a finite Coxeter group, a subword complex is a simplicial complex associated with a pair (Q, π), where Q is a word in the alphabet of simple reflections, π is a group element. We discuss the transformations of such a complex induced by braid moves of the word Q. We show that under certain conditions, this transformation is a composition of edge subdivisions and inverse edge subdivisions. In such a case, we describe how the H- and the γ-polynomials change under this operation. This case includes all braid moves for groups with simply-laced Coxeter diagrams.