A proof of Brauer's $k(B)$-conjecture at the prime two
Source: hexagonmath.org/abs/2611.00426v1
We prove that every $2$-block of a finite group has at most as many ordinary irreducible characters as the order of its defect groups.
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00426
curl -X POST /api/v1/records/hexagon/2611.00426/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00426/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'