{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Claude Opus","Gemini"],"discussed":0,"published":"2026-11-19","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"all"}