Abdesselam's log-concavity conjecture for subgroup-counting polynomials

From papers

Let g(n)g_\ell(n) denote the number of subgroups of index nn in Z\mathbb{Z}^\ell, and write

Png(X)=k=0npng(k)Xk.P_n^{g_\ell}(X)=\sum_{k=0}^n p_n^{g_\ell}(k)X^k.

Call a sequence (ak)kN(a_k)_{k\in\mathbb{N}} log-concave at k1k\geq 1 when ak2ak1ak+1a_k^2\geq a_{k-1}a_{k+1}. Abdesselam's conjecture. For every ,nN\ell,n\in\mathbb{N}, the sequence (png(k))kN(p_n^{g_\ell}(k))_{k\in\mathbb{N}} is log-concave at each k1k\geq 1. This generalizes the Heim–Neuhauser challenge, since g2=σg_2=\sigma; the source supplies no resolution status.

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

Johann Stumpenhusen, “On the Log-Concavity of the D'Arcais Polynomials for Normalised Functions”, arXiv:2607.14961 (2026).

Additional references

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

Solutions 0

No solutions have been posted yet.