combinatorics / Differential posets

Stanley's Rankwise Lower-Bound Conjecture for Differential Posets

Must every $r$-differential poset have at least as many elements in each rank as $Y^r$, the $r$-th Cartesian power of Young's lattice? For $r = 3$ the new construction has fourth-rank size $50$ against $51$ for $Y^3$.

15Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsJul 28, 2026Significance 15/100Registry: unreviewed

Stanley's Rankwise Lower-Bound Conjecture for Differential Posets

Prior state unknowndisproved

Must every $r$-differential poset have at least as many elements in each rank as $Y^r$, the $r$-th Cartesian power of Young's lattice? For $r = 3$ the new construction has fourth-rank size $50$ against $51$ for $Y^3$.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Must every $r$-differential poset have at least as many elements in each rank as $Y^r$, the $r$-th Cartesian power of Young's lattice? For $r = 3$ the new construction has fourth-rank size $50$ against $51$ for $Y^3$.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.