Cycles in subexpression graphs
Representation Theory
2025-09-18 v2 Combinatorics
Group Theory
Geometric Topology
Abstract
Let be the graph whose vertices are all subexpressions with target of a fixed expression in generators of a Coxeter group and edges are the pairs of subexpressions with Hamming distance 2. We prove that is connected and its cycle space is spanned by cycles of lengths , where ranges over all positive divisors of all finite orders of products of at most two entries of .
Keywords
Cite
@article{arxiv.2506.11208,
title = {Cycles in subexpression graphs},
author = {Vladimir Shchigolev},
journal= {arXiv preprint arXiv:2506.11208},
year = {2025}
}