The continuous window–variance conjecture for posets

About 1 year old · traced to

Let PP be a finite poset, let FF be uniformly distributed in its order polytope, let H(x)=EF(x)H(x)=\mathbb E F(x), and let Win⁡(x)=E[R(x)−Q(x)]\operatorname{Win}(x)=\mathbb E[R(x)-Q(x)], where Q(x)=max⁡y<xF(y)Q(x)=\max_{y<x}F(y) and R(x)=min⁡y>xF(y)R(x)=\min_{y>x}F(y) with endpoint conventions Q(x)=0Q(x)=0 and R(x)=1R(x)=1. The window–variance conjecture. For every PP and x∈Px\in P,

Var⁡(F(x))≤Win⁡(x)H(x)(1−H(x))2+Win⁡(x).\operatorname{Var}(F(x))\leq \frac{\operatorname{Win}(x)H(x)(1-H(x))}{2+\operatorname{Win}(x)}.

The proposed bound is tight in a stated incomparability case and is known for series-parallel posets, but remains open in general.

References

Primary source

Max Aires and Jeff Kahn, “Balancing Extensions in Posets of Large Width”, arXiv:2509.11549 (2025).

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.