The unboundedness conjecture for glued posets

Let P1\mathcal P_1 and P2\mathcal P_2 be finite posets, and let P2P1\mathcal P_2*\mathcal P_1 denote their gluing, obtained by placing every element of P1\mathcal P_1 below every element of P2\mathcal P_2. Let sat(n,P)\operatorname{sat}^*(n,\mathcal P) denote the induced saturation number. Glued-poset unboundedness conjecture. The function sat(n,P2P1)\operatorname{sat}^*(n,\mathcal P_2*\mathcal P_1) is unbounded if and only if at least one of P1\mathcal P_1 and P2\mathcal P_2 has unbounded saturation number. This would extend the paper's established result in the case where at least one glued poset has the unique cover twin property.

Sources & referencesView supporting material

Primary source

Maria-Romina Ivan and Sean Jaffe, “Gluing Posets and the Dichotomy of Poset Saturation Numbers”, arXiv:2503.12223 (2026).

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.