Coefficientwise positivity for quotients of Gaussian binomial coefficients

We give an independent proof of the Gatzweiler-Krattenthaler conjecture on quotients of Gaussian binomial coefficients with a common upper index. The main result concerns two disjoint integer intervals of equal length. If the upper interval contains at least as many multiples of each positive integer as the lower interval, then every subset of the lower interval generates at least its own cardinality of elements in the upper interval under addition. A Dyson transform modulo the least generator gives the count when the interval is long relative to that generator. Short intervals are treated by counting sums between multiples of the extreme generators. A criterion for weighted complete intersections then realizes the polynomial quotient as a Hilbert series. The accompanying Lean formalization verifies the implication from polynomial divisibility to the interval counting theorem. Note on priority: J. Du released an earlier candidate proof of the Gatzweiler–Krattenthaler conjecture on 11 November 2026 (https://zdoorr.github.io/papers/gatzweiler-krattenthaler/). It reduces the problem to the same additive-semigroup count for two separated intervals and uses the same regular-sequence criterion of Gatzweiler, Levicán-Santibáñez and Yoshida, with Kneser's theorem in the central lemma. This work was prepared independently and first appeared later (18 November 2026). Its argument for the counting step is different, and the implication from polynomial divisibility to that counting theorem is formalized in Lean 4 with mathlib. Changes from version 1: the abstract now says "an independent proof"; Section 1 discusses and cites Du's earlier candidate proof; the formal-verification appendix refers to the supplementary Lean files. The mathematics and the Lean supplement are unchanged. Files: the paper (PDF and LaTeX source) and lean-supplement.zip, which contains the 22 local Lean 4 modules (Lean 4.24.0, mathlib commit f897ebcf72cd16f89ab4577d0c826cd14afaafc7), a README and the rebuild script verify.py. Main declaration: QBinomialPolynomiality.polynomiality_implies_hall. Axioms reported: propext, Classical.choice, Quot.sound.

Authors

Publication Details

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

Coefficientwise positivity for quotients of Gaussian binomial coefficients

Jason Peng
1 links
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Coefficientwise positivity for quotients of Gaussian binomial coefficients

Jason Peng
preprint en

Abstract

We give an independent proof of the Gatzweiler-Krattenthaler conjecture on quotients of Gaussian binomial coefficients with a common upper index. The main result concerns two disjoint integer intervals of equal length. If the upper interval contains at least as many multiples of each positive integer as the lower interval, then every subset of the lower interval generates at least its own cardinality of elements in the upper interval under addition. A Dyson transform modulo the least generator gives the count when the interval is long relative to that generator. Short intervals are treated by counting sums between multiples of the extreme generators. A criterion for weighted complete intersections then realizes the polynomial quotient as a Hilbert series. The accompanying Lean formalization verifies the implication from polynomial divisibility to the interval counting theorem. Note on priority: J. Du released an earlier candidate proof of the Gatzweiler–Krattenthaler conjecture on 11 November 2026 (https://zdoorr.github.io/papers/gatzweiler-krattenthaler/). It reduces the problem to the same additive-semigroup count for two separated intervals and uses the same regular-sequence criterion of Gatzweiler, Levicán-Santibáñez and Yoshida, with Kneser's theorem in the central lemma. This work was prepared independently and first appeared later (18 November 2026). Its argument for the counting step is different, and the implication from polynomial divisibility to that counting theorem is formalized in Lean 4 with mathlib. Changes from version 1: the abstract now says "an independent proof"; Section 1 discusses and cites Du's earlier candidate proof; the formal-verification appendix refers to the supplementary Lean files. The mathematics and the Lean supplement are unchanged. Files: the paper (PDF and LaTeX source) and lean-supplement.zip, which contains the 22 local Lean 4 modules (Lean 4.24.0, mathlib commit f897ebcf72cd16f89ab4577d0c826cd14afaafc7), a README and the rebuild script verify.py. Main declaration: QBinomialPolynomiality.polynomiality_implies_hall. Axioms reported: propext, Classical.choice, Quot.sound.

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.

Laika access coming soon