Unbounded rank gaps in differential posets

Let PP be a differential poset, and let pnp_n denote the number of elements in rank nn. Define the rank gap by Δpn=pn+1pn\Delta p_n=p_{n+1}-p_n.

Unbounded rank-gap conjecture. In any differential poset,

limnΔpn=.\lim_{n \to \infty} \Delta p_n = \infty.

The conjecture asks whether rank sizes in every differential poset eventually have arbitrarily large successive differences. The surrounding discussion gives partial lower bounds for particular differential-poset constructions, but does not establish the general assertion.

Sources & referencesView supporting material

Primary source

Christian Gaetz and Praveen Venkataramana, “Path counting and rank gaps in differential posets”, arXiv:1806.03509 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.