Pemantle's CNA+ truncation stochastic-domination conjecture

About 19 years old · traced to

Let μ∈Pn\mu\in\mathfrak{P}_n be a probability measure on subsets of [n][n], and for 0≤k≤n0\leq k\leq n let μk\mu_k be its conditional measure given that the sampled set has size kk. Write ν≼μ\nu\preccurlyeq\mu when μ\mu stochastically dominates ν\nu. Pemantle's truncation conjecture. If μ\mu is CNA+ and

μ({S∈2[n]:∣S∣=k})μ({S∈2[n]:∣S∣=k+1})>0,\mu(\{S\in 2^{[n]}:|S|=k\})\mu(\{S\in 2^{[n]}:|S|=k+1\})>0,

then μk≼μk+1\mu_k\preccurlyeq\mu_{k+1}. The source attributes this to Pemantle and the supplied status evidence indicates that it was subsequently confirmed, so the conjecture is solved.

References

Primary source

Julius Borcea, Petter Brändén and Thomas M. Liggett, “Negative dependence and the geometry of polynomials”, arXiv:0707.2340 (2008).

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.