Open Research Index

ProbStack — Random Stacking on Trees

John Fairfax-Ball

Palomar Registrypalomar/PALOMAR-2026-09-30-000023Sep 30, 2026math.COscore 0

Lean 4 formalization of a deterministic finite-path necessity theorem for graph-pebbling stackability: a positive-mass nonstackable path configuration above an explicit mass threshold must contain an actual directed integer branch message at most -h. The package also verifies the exact fixed-total corollary at total n*mu, forcing a message at most -(2*mu-1). The project's two-sided random path threshold theorem is not part of this Palomar result.

SourceRepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-09-30-000023
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-30-000023/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-30-000023/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'