Real-Rooted Integer Polynomials Satisfy a g-Theorem: Proof of a Conjecture of Brenti and Welker

In his abstract Conjectures on f-vectors in Oberwolfach Report 1/2008, V. Welker recorded the following conjecture of F. Brenti and himself (Conjecture 8 there). Let h(t) = 1 + h_1 t + ⋯ + h_d t^d have positive integer coefficients and only real roots. Then (h_0, …, h_d) satisfies a g-theorem: it increases strictly up to a first peak h_r and does not increase afterwards, and the differences g_i = h_i − h_{i−1}, 1 ≤ i ≤ r, satisfy Macaulay's condition g_{i+1} ≤ g_i^⟨i⟩. We prove this conjecture, with the classical pseudo-power g^⟨i⟩; the definition printed in the source contains a slip under which the source's own statement of the g-theorem would fail. No symmetry is assumed. More generally, the conclusion holds for every sequence of positive integers with h_0 = 1 and i h_i² ≥ (i+1) h_{i−1} h_{i+1}; by Newton's classical inequalities this class contains the coefficient sequences of real-rooted polynomials. The proof combines the elementary inequality (k+1)! g_{k+1} ≤ (k! g_k)^{(k+1)/k} for the differences of such sequences with a lower bound for Macaulay's pseudo-power, a^⟨k⟩ ≥ (k! a)^{(k+1)/k}/(k+1)! for all positive integers a and k; both inequalities are asymptotically sharp. The palindromic case, in which the conclusion says that h is the h-vector of a simplicial polytope, was proved by Guo and Kang (2026, unrefereed preprint) by a different method; Theorem 9 of the source (Kubitzke and Nevo) and a theorem of Bell and Skandera also follow. The contribution of this note is the lower bound for the pseudo-power and the resulting proof of the general case. The stronger Kruskal–Katona version, asked by Kubitzke and Welker, remains open. The first conjecture of the corpus record, on real roots for barycentric subdivisions of non-simplicial polytopes, is not treated; as far as we know, it is open. This is an unrefereed note. Unrefereed preprint released for independent mathematical scrutiny. Publication on Zenodo does not constitute peer review. AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text. Corpus identifier: OWR-1782-017 (V. Welker, Conjectures on f-vectors, Oberwolfach Report 1/2008, Conjecture 8, attributed to F. Brenti and V. Welker; the record's Conjecture 2. The record's Conjecture 1, its title statement, is not treated).

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-17
DOI
https://doi.org/10.5281/zenodo.23430746
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Real-Rooted Integer Polynomials Satisfy a g-Theorem: Proof of a Conjecture of Brenti and Welker

Alper Ferudun
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Real-Rooted Integer Polynomials Satisfy a g-Theorem: Proof of a Conjecture of Brenti and Welker

Alper Ferudun
preprint en

Abstract

In his abstract Conjectures on f-vectors in Oberwolfach Report 1/2008, V. Welker recorded the following conjecture of F. Brenti and himself (Conjecture 8 there). Let h(t) = 1 + h_1 t + ⋯ + h_d t^d have positive integer coefficients and only real roots. Then (h_0, …, h_d) satisfies a g-theorem: it increases strictly up to a first peak h_r and does not increase afterwards, and the differences g_i = h_i − h_{i−1}, 1 ≤ i ≤ r, satisfy Macaulay's condition g_{i+1} ≤ g_i^⟨i⟩. We prove this conjecture, with the classical pseudo-power g^⟨i⟩; the definition printed in the source contains a slip under which the source's own statement of the g-theorem would fail. No symmetry is assumed. More generally, the conclusion holds for every sequence of positive integers with h_0 = 1 and i h_i² ≥ (i+1) h_{i−1} h_{i+1}; by Newton's classical inequalities this class contains the coefficient sequences of real-rooted polynomials. The proof combines the elementary inequality (k+1)! g_{k+1} ≤ (k! g_k)^{(k+1)/k} for the differences of such sequences with a lower bound for Macaulay's pseudo-power, a^⟨k⟩ ≥ (k! a)^{(k+1)/k}/(k+1)! for all positive integers a and k; both inequalities are asymptotically sharp. The palindromic case, in which the conclusion says that h is the h-vector of a simplicial polytope, was proved by Guo and Kang (2026, unrefereed preprint) by a different method; Theorem 9 of the source (Kubitzke and Nevo) and a theorem of Bell and Skandera also follow. The contribution of this note is the lower bound for the pseudo-power and the resulting proof of the general case. The stronger Kruskal–Katona version, asked by Kubitzke and Welker, remains open. The first conjecture of the corpus record, on real roots for barycentric subdivisions of non-simplicial polytopes, is not treated; as far as we know, it is open. This is an unrefereed note. Unrefereed preprint released for independent mathematical scrutiny. Publication on Zenodo does not constitute peer review. AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text. Corpus identifier: OWR-1782-017 (V. Welker, Conjectures on f-vectors, Oberwolfach Report 1/2008, Conjecture 8, attributed to F. Brenti and V. Welker; the record's Conjecture 2. The record's Conjecture 1, its title statement, is not treated).

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.