The boundedness conjecture for gluing posets

Let P1\mathcal P_1 and P2\mathcal P_2 be finite posets with bounded saturation number, 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. Gluing-boundedness conjecture. The glued poset P2P1\mathcal P_2*\mathcal P_1 also has bounded saturation number. This is a special case of the preceding unboundedness conjecture and is presented as a desired extension of the paper's boundedness theorem to arbitrary posets.

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.