md-lean: exact height span, dart mass, and adjugate scaling for Mazur's greedy construction
Exact height-span of Mazur's scheme grammar, a local dart-mass bound, and an adjugate identity for the Dirichlet matrix of that construction; not a proof of the strong Papadimitriou–Ratajczak conjecture and not a theorem that every 3-connected plane graph attains the scheme maximum. Mazur builds injective integer heights by inductive recurrences on rooted pieces (edge, cycle, binary series, two-range join) and then forms a weighted Dirichlet matrix for the horizontal coordinate; the paper does not bound the height span or the bit length of the coordinates. For a well-formed scheme on n >= 2…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-09-14-000001
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-14-000001/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-14-000001/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'