Flip-connectivity of octonion bracketing classes
Source: hexagonmath.org/abs/2611.00655v1
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00655
curl -X POST /api/v1/records/hexagon/2611.00655/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00655/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'