Ballantine–Beck–Merca injectivity conjecture for elementary symmetric partitions

Less than 1 year old · traced to

Let nn be a positive integer. A partition of nn is a weakly decreasing sequence of positive integers with size nn and length ℓ\ell. For 1≤j≤ℓ1\leq j\leq\ell, define pre⁡j(λ)\operatorname{pre}_j(\lambda) to be the partition whose parts are the products of all jj-element subcollections of the parts of λ\lambda. Ballantine–Beck–Merca's injectivity conjecture. For j≥2j\geq 2, the function pre⁡j\operatorname{pre}_j is injective on the set of partitions of size nn and length ℓ≥j\ell\geq j. This conjecture is false: the j=2j=2 case is solved, while the case ℓ=j\ell=j has been disproved, and the present paper disproves the claim for ℓ=2j\ell=2j when j≥3j\geq3.

References

Primary source

Vixail Hadelyn, Harper Niergarth, Weiyou Li and Wenhui Li, “Counterexamples regarding elementary symmetric partitions”, arXiv:2606.00420 (2026).

Additional references

2 papers in this index state this conjecture (2026). The statement above is taken from the most recent of them; the others are arXiv:2604.17424.

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.