Noel–Scott–Sudakov–Balogh–Wagner centeredness conjecture for product posets

Let kk be a positive integer, and let n0n_0 be an integer. Equip the product poset {0,1,,k}n\{0,1,\ldots,k\}^n with the coordinatewise order. A family is centered when its elements are chosen as close as possible to the middle rank, and the poset has the centeredness property if, for every family size MM, some centered family of size MM minimizes the number of comparable pairs. Noel–Scott–Sudakov–Balogh–Wagner conjecture. For every kk there exists an n0n_0 such that if nn0n\geq n_0 then the poset {0,1,,k}n\{0,1,\ldots,k\}^n has the centeredness property. This extends Kleitman's theorem for the Boolean lattice, while a counterexample is known for n=2n=2 and k=16k=16; the asserted eventual centeredness for each fixed kk remains open.

Sources & referencesView supporting material

Primary source

Jozsef Balogh, Sarka Petrickova and Adam Zsolt Wagner, “Families in posets minimizing the number of comparable pairs”, arXiv:1703.05427 (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.