Bóna–Lackner–Sagan's log-concavity conjecture for even-column tableaux

From papers

Fix a positive integer nn, and let Θ\Theta be the set of partitions of nn all of whose column lengths are even. Let n,kΘ\ell_{n,k}^{\Theta} denote the corresponding quantity associated in the paper with standard Young tableaux and largest part kk. Bóna–Lackner–Sagan's conjecture. For any fixed nn, the sequence {n,kΘ}k=1n\{{\ell}_{n,k}^{\Theta}\}_{k=1}^{n} is log-concave. This is presented as a companion to Chen's perfect-matching conjecture; the supplied text gives no resolution, so the conjecture remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Alice L. L. Gao, Matthew H. Y. Xie and Arthur L. B. Yang, “Schur positivity and log-concavity related to longest increasing subsequences”, arXiv:1703.06382 (2017).

Solutions 0

No solutions have been posted yet.