Heim–Neuhauser conjecture for D’Arcais polynomials

About 6 years old · traced to

Let P0(x)=1P_0(x)=1 and, for n≥1n\geq 1, define the D’Arcais polynomials by

Pn(x):=xn∑j=1nσ(j)Pn−j(x),σ(j):=∑d∣jd.P_n(x):=\frac{x}{n}\sum_{j=1}^n\sigma(j)P_{n-j}(x),\qquad \sigma(j):=\sum_{d\mid j}d.

For integers a>b≥0a>b\geq 0, define

Δa,b(x):=Pa−1(x)Pb+1(x)−Pa(x)Pb(x).\Delta_{a,b}(x):=P_{a-1}(x)P_{b+1}(x)-P_a(x)P_b(x).

Heim–Neuhauser conjecture. For all x≥2x\geq 2,

Δa,b(x)≥0,\Delta_{a,b}(x)\geq 0,

except for b=0b=0 and (a,b)=(6,4)(a,b)=(6,4). The inequality remains true for x≥3x\geq 3 when b=0b=0, and for x≥x6,4x\geq x_{6,4} when (a,b)=(6,4)(a,b)=(6,4), where xa,bx_{a,b} is the largest real root of Δa,b(x)\Delta_{a,b}(x). This conjecture extends the colored-partition inequality to D’Arcais polynomials; the source does not provide a resolution status.

References

Primary source

Bernhard Heim and Markus Neuhauseer, “Proof of the Bessenrodt–Ono inequality by Induction”, arXiv:2108.00191 (2021).

Additional references

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

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.