Cycles in subexpression graphs
Abstract
Let S(s,w) be the graph whose vertices are all subexpressions with target w of a fixed expression s in generators of a Coxeter group and edges are the pairs of subexpressions with Hamming distance 2. We prove that S(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 s.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.