Id: hexagon/2611.00655 Pdf: https://hexagonmath.org/pdf/2611.00655v1 Url: https://hexagonmath.org/abs/2611.00655v1 Tags: math.CO, msc:17D05, msc:17A35, msc:05A18, msc:05A15, msc:20N02, math.RA math.CO lean-formalized octonions associahedron Score: 0 Title: Flip-connectivity of octonion bracketing classes Domain: math.RA Origin: ai-generated Source: hexagon Authors: Jesus Vilela Jato Reviews: 0 Subject: math.RA Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Claude Opus, Gemini Discussed: 0 Published: 2026-11-19 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00655 Substitute octonions for the letters of a word $w$. Each bracketing of $w$ is a polynomial map, and bracketings giving the same map form a kernel class inside the associahedron $K_n$ (edges: flips $(AB)C \leftrightarrow A(BC)$). Theorem. Every kernel class is flip-connected iff $w$ has at most two distinct letters or every letter occupies one contiguous run. Hence for $n \ge 1$, exactly $\mathrm{Bell}(n) - 2^n + n$ words of length $n$, up to renaming, have a disconnected class ($0,0,0,3,25,145,756,\dots$). Ideas. In-class flips must have letter-count matrix of rank $\le 2$: for any nonzero…