Three Roles and One Bit: All Optimal Tables and Equality Graphs
Source: hexagonmath.org/abs/2611.00604v1
We study a randomized one-bit fingerprint for distinguishing graphs on a common labeled vertex set. Each vertex independently receives one of three roles according to a common probability distribution. A symmetric Boolean table assigns bits to pairs of roles, and the fingerprint is the parity of these bits over the graph's edges. We prove that, for every $n \geq 4$, the optimal worst-case detection probability over all symmetric Boolean tables and role distributions is exactly $8/27$. Every optimal distribution is uniform. For $n \geq 5$, we classify exactly 21 optimal tables with fixed role…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00604
curl -X POST /api/v1/records/hexagon/2611.00604/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00604/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'