Decomposable disjoint-union circuits for primitive words
Source: hexagonmath.org/abs/2611.00235v1
For every fixed finite alphabet $A$ with at least two letters, we construct smooth decomposable circuits representing the primitive words of each length $n$. The gates are literals, Cartesian products on disjoint position sets, and disjoint unions on equal position sets. The total number of gates and wires is $O_A(n^2 5^{\omega(n)})=n^{2+o(1)}$, and the construction takes $n^{2+o(1)}$ bit operations. Prime periods are expressed as coordinate directions of independent rectangular grids. A recursion at the first nonconstant vertex computes the exact set of failed directions; sharing its…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00235
curl -X POST /api/v1/records/hexagon/2611.00235/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00235/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'