REVIEW 4 major objections 5 minor 12 references
On the Log-Concavity of the D'Arcais Polynomials for Normalised Functions
T0 review · 4 major / 5 minor · reviewed 2026-08-02 · deepseek-v4-flash
Pith's one-line read For any normalised integer-valued arithmetic function g with g(2)≠0, the D'Arcais polynomials are eventually log-concave at every fixed distance from the top coefficient, both horizontally and vertically.
desk verdict Solid eventual log-concavity theorem for normalised D'Arcais polynomials; the new skew notion is mostly a repackaging, and the auxiliary lemmas have small errors that need fixing. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The engine is the polynomial representation of near-top coefficients (Proposition 4.3): for fixed k, a_g_n(n−k) is a polynomial in n of degree 2k (when g(2)≠0) with leading coefficient g(2)^k/(2^k k!). This turns a log-concavity inequality at n−k into a comparison of leading coefficients of polynomials in n, so eventual validity is decided by a positive number. The paper also uses this representation for the new skew-log-concavity condition, where the same polynomiality (under a non-negativity assumption) yields eventual log-concavity via a general lemma about polynomial log-concavity.
What would settle it
Compute a_g_n(n−2) for a normalised integer-valued g with g(2)≠0 but with negative values, e.g. g(2)=1, g(3)=−1, using the recurrence (3.1) for n=1,...,10, and compare with the predicted polynomial (n−2)(n−1)n(3g(2)^2(n−3)+8g(3))/24. If the values deviate from this polynomial, or if the degree drops, Proposition 4.3(c) is false; if they match, the load-bearing premise survives for that test.
Extended reading notes
Core claim
The central claim is Theorem 2.1: if g is a normalised Z-valued arithmetic function with g(2)≠0, then for every fixed k there exist thresholds n_h and n_v such that the coefficient sequence of A_g_n (and hence P_g_n) is horizontally log-concave at n−k for all n≥n_h, and vertically log-concave at n−k for all n≥n_v. The proof shows that a_g_n(n−k) equals a polynomial c_k(n) of degree exactly 2k with leading coefficient g(2)^k/(2^k k!), so the difference c_k(n)^2 − c_{k+1}(n)c_{k−1}(n) has positive leading coefficient; eventually the sign is right. The same leading-coefficient argument handles the vertical direction because shifting n by ±1 does not change the leading term.
Load-bearing premise
The proof relies on the claim that, for g(2)≠0, the top coefficient a_g_n(n−k) is exactly a polynomial in n of degree 2k with leading coefficient g(2)^k/(2^k k!); if this polynomial description fails, the leading-coefficient comparison that forces eventual log-concavity collapses.
Editorial extensions
If this is right
- For every normalised integer arithmetic function with nonzero value at 2, both horizontal and vertical log-concavity hold eventually at every fixed distance k from the top coefficient.
- The same conclusion transfers from the renormalised polynomials A_g_n to the standard D'Arcais polynomials P_g_n; horizontal log-concavity is in fact equivalent for the two families.
- The existence of thresholds n_h(g,k) and n_v(g,k) is established, though explicit values are not given; the result is qualitative.
- For non-negative functions whose first non-zero value beyond 1 occurs at κ≥2, the new skew log-concavity holds eventually; for the trivial function e it holds with no threshold.
- The paper's computations give closed forms for the top three coefficients of A_g_n for a general g, illustrating the polynomial pattern.
Reading between the lines
- If Proposition 4.3(c) can be made fully rigorous for κ=2 (the paper itself notes the induction is sketched), Theorem 2.1 is unconditional; a natural next step is to compute explicit thresholds for concrete functions like the sum-of-divisors function to test sharpness.
- The leading-coefficient method suggests that similar eventual log-concavity results may hold for other sequences of polynomials defined by exponential generating products, as long as a polynomial representation of the relevant coefficients is available.
- The paper leaves open an equivalence condition between vertical/horizontal and skew log-concavity; proving such an equivalence would give a unified framework for all three notions.
- For functions with a later first non-zero value (κ≥3), the paper's own remark shows cancellations can occur when g takes negative values, so the non-negativity assumption in the skew-log-concavity result is likely essential rather than technical.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies log-concavity properties of the D'Arcais polynomials P_n^g(X) and their normalised versions A_n^g(X)=n!P_n^g(X). It introduces a new notion of 'skew log-concavity' and proves two main results. Theorem 2.1 asserts that for any normalised Z-valued arithmetic function g with g(2)≠0, the polynomials A_n^g and P_n^g are eventually horizontally and vertically log-concave at the near-top coefficient positions n−k. Theorem 2.2 asserts eventual skew log-concavity for N-valued g with a gap condition, and everywhere for the Dirichlet identity g=e. The proofs are based on the recurrence (3.1) and on a polynomiality/leading-coefficient analysis of the top coefficients c_k(n)=a_n^g(n−k), together with a comparison of leading coefficients.
Significance. If Theorem 2.1 is correct, it is a clean and reasonably general asymptotic log-concavity statement for D'Arcais polynomials, extending earlier asymptotic results for σℓ in a natural direction. The leading-coefficient comparison idea is simple and potentially reusable. The paper also proposes a new notion, skew log-concavity. However, the submitted manuscript contains several false or internally inconsistent auxiliary statements, and the proof of the load-bearing Proposition 4.3 is only sketched. The central theorem appears sound, but the paper needs substantial revision before the claims are presented correctly.
major comments (4)
- [§2.2, Theorem 2.2(a)] The hypothesis is self-contradictory as written: it requires g(κ)≠0 and g(m)=0 for 2≤m≤κ. For every κ≥2 this includes m=κ and forces g(κ)=0, so only κ=1 is admissible, where the range is empty and the hypothesis holds for all normalised g. The intended condition is presumably κ≥2 and g(m)=0 for 2≤m≤κ−1, matching Proposition 4.3(a). As stated, the theorem is not supported by the proof, which invokes Proposition 4.3(a).
- [§4.1, Proposition 4.3(a)] The asserted degree formula fails for k<κ−1. In the displayed difference, the summation over m=κ,…,k+1 is empty, so a_n^g(n−k) is identically zero, not a polynomial of degree k+⌊k/(κ−1)⌋. For example, when κ=3 and k=1, the formula gives degree 1, but a_n^g(n−1)=g(2)(n−1)n/2=0 if g(2)=0. The statement needs the restriction k≥κ−1, or a separate zero-polynomial case. This does not invalidate Theorem 2.1, which only uses κ=2, but it is a false statement used in the proof of Theorem 2.2(a).
- [§4.1, Proposition 4.3(c)] This is the load-bearing step for Theorem 2.1, but the proof is only a sketch. The sentence 'by virtue of Lemma 4.2' hides the induction, and Lemma 4.2 itself is asserted as 'easily verifiable'. Since the leading-coefficient comparison in §4.2 depends on the exact leading coefficient g(2)^k/(2^k k!), the proof should contain a complete induction, including a demonstration that no cancellation occurs in the recurrence for κ=2 and arbitrary Z-valued g. This is especially important because the manuscript itself notes that cancellations may occur for other κ.
- [§4.3, Lemma 4.4] The stated leading coefficient is false. For f(X)=a_dX^d+…, the coefficient of X^{2d−2} in f(X)^2−f(X+1)f(X−1) is d a_d^2, not 2d a_d^2. For example, when d=1, the expression is a_1^2, not 2a_1^2. The qualitative conclusion (eventual log-concavity) still holds because the correct coefficient is positive, but the lemma as written is incorrect and must be corrected.
minor comments (5)
- [§2, Theorem 2.1] The statement should explicitly restrict k and n so that the coefficients n−k, n−k+1, and n−k−1 are in the natural ranges for the polynomials; otherwise the log-concavity inequalities may refer to undefined coefficients for small n.
- [§3.3, Theorem 3.1] The displayed formula for a_n^g(k)/n! is typeset densely; the summation over λ∈S_{l(µ)} and the nested indices could be reformatted for readability. This is a presentational issue only.
- [§5.2] In the displayed definition of F_n(x), the index K should be lowercase k, and the condition 'for n±1' is ambiguous; it should say 'for n−1 and n+1'.
- [§5.1, Table] The entries for general g are useful, but the table would benefit from a sentence indicating that they follow from the recurrence (3.1) and perhaps a sample derivation for the general-g row.
- [§1.2] The notation n_0 in the definition of log-concavity at n_0 is used only once; it may be simpler to consistently write 'at m' or 'at n'.
Circularity Check
No significant circularity: the main theorem is derived from the defining recurrence and degree/leading-coefficient comparisons, with citations serving only as background or independent context.
full rationale
The central derivation chain is self-contained. Theorem 2.1 is proved from Proposition 4.3(c), which is obtained from the recurrence relation (3.1), itself derived directly from the defining generating function (1.1) by applying the differential operator. The key leading-coefficient computation for the κ=2 case, lc(c_k) = g(2)^k/(2^k k!), follows by induction from (3.1): in D_k(n) = c_k(n) - c_k(n-1), the m=2 term has degree 1 + 2(k-1) = 2k-1 while all m>2 terms have degree at most 2k-2, so no cancellation affects the leading coefficient. This is a genuine mathematical argument, not a fit or a renamed input. The horizontal and vertical log-concavity inequalities in Theorem 2.1 then reduce to the positive leading coefficient g(2)^{2k}/(2^{2k}(k+1)!k!), which is a consequence of g(2) ≠ 0 and the polynomial-degree statement, not of any fitted parameter or assumed conclusion. Cited prior work, including Theorem 3.1 from Heim–Neuhauser, is used as background or as an independent coefficient formula, and the only self-citation (Heim–Stumpenhusen [7]) is mentioned motivatinally in the introduction, not as load-bearing support. The reader's noted concern about the sketched induction and potential issues for κ ≥ 3 is a correctness or rigor concern, not circularity; moreover Theorem 2.1 explicitly targets κ=2, where the degree/leading-coefficient argument is secure. No step in the derivation assumes the target theorem, and no parameter is fitted to the data it claims to predict. Therefore the appropriate circularity score is 0.
Assumptions & free parameters
assumptions (4)
- standard math Generating function identity exp(X Σ g(n)q^n/n) = Π (1−q^n)^{−f_g(n)X}
- standard math Recurrence (3.1) for the coefficients a_g_n(k)
- standard math Heim–Neuhauser coefficient formula (Theorem 3.1)
- domain assumption Domain assumptions: g normalised Z-valued with g(2)≠0 for Theorem 2.1; g N-valued with a first nonzero after index 1 for Theorem 2.2
Cite this review
Pith. "Pith review of On the Log-Concavity of the D'Arcais Polynomials for Normalised Functions." pith.science (2026). https://pith.science/paper/MB4ST3E6
@misc{pith2026260714961,
author = {Pith},
title = {Pith review of: On the Log-Concavity of the D'Arcais Polynomials for Normalised Functions},
year = {2026},
howpublished = {\url{https://pith.science/paper/MB4ST3E6}},
note = {Machine review of arXiv:2607.14961}
}
abstract
A sequence $(a_n)_{n \in \mathbb{N}}$ of non-negative real numbers is called log-concave at $n$ if $a_n^2 \geq a_{n+1}a_{n-1}$. This property has been generalised in various ways to families of polynomials. We introduce a new variant and show that certain types of D'Arcais polynomials have the respective properties at certain points.
Reference graph
Works this paper leans on
-
[1]
A. Abdesselam,Log-concavity with respect to the number of orbits for infinite tuples of commuting permutations(2023),https://arxiv.org/abs/2309.07358
arXiv 2023
-
[2]
A. Abdesselam, P. Brunialti, T. Doan, and P. Velie,A bijection for tuples of commuting permutations and a log-concavity conjecture(2024),https://arxiv.org/abs/2309.09407
arXiv 2024
-
[3]
S. Charlton, B. Heim, and J. Stumpenhusen,On the Smallest Counterexample to the Log-Concavity of the D’Arcais Polynomials(2026),https://arxiv.org/abs/2606.09545
arXiv 2026
-
[4]
Heim and M
B. Heim and M. Neuhauser,Horizontal and vertical log-concavity(2020),https://arxiv.org/abs/2010. 05231. 8 STUMPENHUSEN
2020
-
[5]
,Formulas for coefficients of polynomials assigned to arithmetic functions, Journal of Mathematical Science290(2025), 612–622
2025
-
[6]
,On the Non-vanishing of the D’Arcais Polynomials, The Ramanujan Journal69(2026)
2026
-
[7]
Heim and J
B. Heim and J. Stumpenhusen,On the detection of non-roots of the D’Arcais polynomials, Research in Number Theory12(2026)
2026
-
[8]
L. Hong and S. Zhang,Towards Heim and Neuhauser’s Unimodality Conjecture on the Nekrasov–Okounkov polynomials(2020),https://arxiv.org/abs/2008.10069
arXiv 2020
Show all 12 references
-
[9]
Köhler,Eta Products and Theta Series Identities, Springer, Berlin, 2011
G. Köhler,Eta Products and Theta Series Identities, Springer, Berlin, 2011
2011
-
[10]
Ono,The Web of Modularity: Arithmetic of the Coefficients of Modular Forms andq-series, CBMS Regional Conference Series in Mathematics, vol
K. Ono,The Web of Modularity: Arithmetic of the Coefficients of Modular Forms andq-series, CBMS Regional Conference Series in Mathematics, vol. 102, American Mathematical Society, Providence, 2003
2003
-
[11]
Starr,Asymptotics of the d’Arcais Numbers at Smallk(2026),https://arxiv.org/abs/2601.18599
S. Starr,Asymptotics of the d’Arcais Numbers at Smallk(2026),https://arxiv.org/abs/2601.18599
2026
-
[12]
Żmija,Unusual class of polynomials related to partitions, The Ramanujan Journal62(2023)
B. Żmija,Unusual class of polynomials related to partitions, The Ramanujan Journal62(2023). Department of Mathematics and Computer Science, Division of Mathematics, University of Cologne, Weyertal 86-90, 50931 Cologne, Germany Email address:jstumpen@math.uni-koeln.de
2023
Reviewed August 2, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.