← All problems

Beniamini–Lavee–Linial almost-balanced permutations question

This entry tracks Beniamini–Lavee–Linial almost-balanced permutations question.

It turns an existence problem about balanced permutation statistics into a quantitative enumeration theorem.

Latest development

The 2025 existence question is settled and the count is shown to be Θ(n!n^{−(k−1)^2/2}).

Editorial caveat

The result is presented in an unrefereed preprint.

References

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.