Unbounded rank gaps in differential posets
Unbounded rank gaps in differential posets
Let be a differential poset, and let denote the number of elements in rank . Define the rank gap by .
Unbounded rank-gap conjecture. In any differential poset,
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.