Cycles in subexpression graphs

Vladimir Shchigolev

公開日: 2025/6/12

Abstract

Let $\mathfrak{S}(\underline{s},w)$ be the graph whose vertices are all subexpressions with target $w$ of a fixed expression $\underline{s}$ in generators of a Coxeter group and edges are the pairs of subexpressions with Hamming distance 2. We prove that $\mathfrak{S}(\underline{s},w)$ is connected and its cycle space is spanned by cycles of lengths $d+2$, where $d$ ranges over all positive divisors of all finite orders of products of at most two entries of $\underline{s}$.

Cycles in subexpression graphs | SummarXiv | SummarXiv