English

Cycles in subexpression graphs

Representation Theory 2025-09-18 v2 Combinatorics Group Theory Geometric Topology

Abstract

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

Keywords

Cite

@article{arxiv.2506.11208,
  title  = {Cycles in subexpression graphs},
  author = {Vladimir Shchigolev},
  journal= {arXiv preprint arXiv:2506.11208},
  year   = {2025}
}
R2 v1 2026-07-01T03:14:35.816Z