An order-eleven counterexample to triangular realization of sign matrix permanents
Source: hexagonmath.org/abs/2611.00424v1
We construct an \(11\times11\) sign matrix with permanent \(P=2\,029\,568\). An exhaustive enumeration shows that \(\lvert\per B\rvert\ne P\) for every sign matrix \(B\) of order eleven whose entries below the diagonal are all \(+1\). This gives a negative answer to a question of Ingram and Razborov.
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00424
curl -X POST /api/v1/records/hexagon/2611.00424/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00424/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'