{
  "schema_version": 1,
  "problem_number": "OWR-1782-017",
  "title": "Real-Rooted Integer Polynomials Satisfy a g-Theorem: Proof of a Conjecture of Brenti and Welker",
  "author": {
    "name": "Alper Ferudun",
    "affiliation": "Mercury Software GmbH",
    "url": "https://github.com/AlperTheKing"
  },
  "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.",
  "result_type": "COMPLETE_SCOPED_PROOF",
  "categories": [
    "math.CO",
    "math.AC"
  ],
  "keywords": [
    "real-rooted polynomials",
    "g-theorem",
    "M-sequences",
    "Macaulay's theorem",
    "pseudo-power",
    "binomial representation",
    "Newton's inequalities",
    "ultra log-concave sequences",
    "h-vectors",
    "simplicial polytopes",
    "barycentric subdivision",
    "Brenti–Welker conjecture",
    "partial answer",
    "Oberwolfach Reports problems",
    "UnsolvedMath",
    "OWR-1782-017",
    "math.CO",
    "math.AC",
    "open mathematics"
  ],
  "manuscript_version_date": "2026-10-17",
  "publication_date": "2026-10-17",
  "publication_date_kind": "first public online release",
  "version": "1.0",
  "date_modified": "2026-10-17",
  "presentation_revision_only": false,
  "doi_archived_file_version": "1.0",
  "status": "unrefereed preprint",
  "canonical_url": "https://eulersolve.org/papers/owr-1782-017/",
  "pdf_url": "https://eulersolve.org/papers/owr-1782-017/paper.pdf?v=e38749f8ac54",
  "doi": "10.5281/zenodo.23430747",
  "zenodo_record_url": "https://zenodo.org/records/23430747",
  "license": "https://creativecommons.org/licenses/by/4.0/",
  "scope_caveat": "Proves the Brenti-Welker conjecture (Welker, OWR 1/2008, Conjecture 8) with no symmetry assumed; the record's first conjecture, on barycentric subdivisions of non-simplicial polytopes, is not treated.",
  "files": {
    "paper.pdf": {
      "sha256": "e38749f8ac54f08d01916145dc1870d2947d45f2e7afe05aa56e8e65fbc7e062"
    },
    "source.zip": {
      "sha256": "e3dbfacf4f019415b60253460fc5870b77ea61f61a55a32046a7f9ed4751e971"
    },
    "verification_report.md": {
      "sha256": "f2158ccfd7bd83d56fe98b6a19258a4b3ec31d505c23089ba7f3871eb949bbe9"
    }
  },
  "ai_use_disclosure": "AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text."
}