This note proves the consecutive-interlacing assertion recorded by Chow. The argument uses the published Savage–Visontai refinement theorem. The exact deduction and the separate strictness argument were independently reviewed in this research session. See NOVELTY.md for the bounded priority audit and attribution.
Statement and conventions
Let be the even-signed permutations of , and put
These are the ordinary type-D Eulerian polynomials, not derangement polynomials.
Chow's Section 5 asks for consecutive interlacing. If the zeros of are and those of are , the assertion is
We obtain strict inequalities for every ; the case is weak because .
Published input
Savage and Visontai define polynomials , , whose sum equals for . Their Lemma 3.14 gives
The initial row is .
The proof of their Theorem 3.15 establishes, for every and , compatibility of both pairs
Their Lemma 2.5 therefore says that the row is ordered pairwise interlacing. This is stronger than merely asserting real-rootedness of each summand.
Equation (1) at gives the identity
Proof of the weak interlacing assertion
Fix and use the pairwise interlacing row . A first member of an ordered interlacing family interlaces every nonnegative sum of its members. This is Corollary 2.6 of Savage–Visontai, with the first weight vector and the second . Hence
Dividing both polynomials by two gives .
For ,
The three zeros of are , which interlace the double zero of . This finishes the full all-rank assertion.
Strictness
We give the additional argument because weak compatibility alone should not be described as strict interlacing.
Lemma 1: no refined row has a common zero
For every , the polynomials have no common complex zero.
Proof. The row includes the nonzero constant 2. In (1), the integer cutoffs , for , start at 0, end at , and increase by either 0 or 1. Thus every cutoff occurs. For two entries whose cutoffs are and , their difference is
If every entry in row vanished at , every entry of row would vanish there. Induction excludes that. At , all entries are positive by the initial row and (1). Thus cannot be a common zero either.
Lemma 2: strictness of the sum
Suppose has degree , positive leading coefficient, and simple real zeros . Suppose for polynomials with positive leading coefficients, each of degree or . At every , all nonzero numbers have the same sign: they have the sign of . This follows directly by placing the zeros of around those of .
If the have no common zero, their sum is nonzero at each . If that sum has degree , the signs at consecutive , together with its signs at the two ends of the real line, force a zero in each of the intervening intervals. Consequently the sum has simple roots and is strictly interlaced by .
Induction
The polynomial has simple negative zeros. Suppose has simple negative zeros, with . Set and let run through the row . The published ordered interlacing property gives , and Lemma 1 excludes a common zero. Their sum is , of degree . Lemma 2 gives strict interlacing and simplicity. All zeros are negative because the coefficients and constant term of are positive.
This proves strict consecutive interlacing for every .
What the proof does and does not establish about priority
The weak assertion is an immediate consequence of two parts of the 2015 Savage–Visontai paper. Its proof is the same first-entry/sum argument they use for s-Eulerian polynomials in their Theorem 2.7. This is explicitly credited, rather than represented as a new compatibility method.
Chow's 2022 paper nevertheless treats the type-D assertion as supported by computation and requiring further research. The specialist SymCat page dated 19 November 2026 still lists it as open. The literature search found no earlier explicit conclusion resolving the consecutive-interlacing assertion. The proof is a short consequence of established stronger results, and the priority record does not assert that the consequence was unknown to every specialist. The simplicity of individual polynomials was already known; the claimed target is their consecutive interlacing.
Sources
C. D. Savage and M. Visontai, The s-Eulerian polynomials have only real roots, Transactions of the American Mathematical Society 367 (2015), 1441–1466. arXiv:1208.3831v3; full HTML. Lemmas 2.5, 3.9, 3.14; Corollary 2.6; Theorem 2.7; proof of Theorem 3.15.
C.-O. Chow, New proofs of interlacing of zeros of Eulerian polynomials, Journal of Mathematical Analysis and Applications 510 (2022), 126019. DOI. Section 2 defines weak interlacing; Section 5 states the type-D question. Author-uploaded full text.
P. Alexandersson, Real-rooted polynomials: open problems, page dated 19 November 2026, checked 20 November 2026.
S.-M. Ma, The half interlacing property among the types A, B and D Eulerian polynomials, arXiv:2608.02357. Its within-rank assertion is different from consecutive type-D interlacing.
A. L. B. Yang and P. B. Zhang, Descent generating polynomials and the Hermite–Biehler theorem, Journal of Algebraic Combinatorics (2021/2022), DOI; author PDF. Theorem 2.5 and equation (11) explicitly restate the two published ingredients used here.