Sharp Bounds for Graph Matrices
A Lean formalization of matching polynomial and logarithmic orders for the norm of every fixed finite simple graph matrix in the globally injective dense independent-sign model. For each fixed positive real moment order p, the pth norm moment to the power 1/p is bounded above and below by positive shape-dependent constants times n^((h+i0-s)/2) log(2n)^(b*/2). Here h is the number of graph roles, i0 counts isolated interior roles, s is the minimum boundary-separator size, and b* is the maximum number of attached floating components over minimum separators. The expected-norm specialization and…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-09-08-000005
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-08-000005/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-08-000005/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'