HEXAGONbeta

Analytic q-inequalities and a proof of Bergeron's conjecture

Primarily AI-generated textHuman understanding: no partsmath.CO — Combinatorics

Contributed by Veronica Phan ↗

Version 1 / Oct 27, 2026 / CC BY 4.0

Abstract

For integers 1≤a≤b≤c≤d1\le a\le b\le c\le d with ad=bcad=bc, Bergeron asked whether the difference of Gaussian binomial coefficients (b+cb)q−(a+da)q\binom{b+c}{b}_q-\binom{a+d}{a}_q has nonnegative coefficients. We prove that it does, and more generally that (b+cb)q−(a+da)q\binom{b+c}{b}_q-\binom{a+d}{a}_q has nonnegative coefficients whenever a≤b≤ca\le b\le c and ad≤bcad\le bc, a strengthening proposed by Troyka. The proof is analytic rather than bijective. We develop a toolkit for coefficientwise inequalities, including a coefficientwise local limit theorem for Gaussian polynomials based on Irwin--Hall densities, and use it in a Pascal-type induction that proves the case a≤20a\le 20. For general aa the problem reduces to a two-parameter inequality between linearly interpolated Gaussian polynomials. Near its base case this inequality reduces exactly to the monotonicity of rational qq-Catalan numbers. Using the circle method with explicit error terms, we prove the conjecture of Chen, Wang and Wang that the coefficients of MacMahon's qq-Catalan numbers Cn(q)C_n(q) are unimodal for every n≥16n\ge16, and an analogue for the rational qq-Catalan numbers Cx,N+1(q)C_{x,N+1}(q) with x≤N≤2xx\le N\le 2x. Beyond this range the difference splits into two nonnegative parts, which we compare degree by degree using local limit bounds for Gaussian polynomials that are uniform in both parameters. The proof is computer-assisted: it uses exact integer and rational arithmetic, ball arithmetic, and one floating-point computation with a proved error bound. The scripts and the logs of their runs are provided as ancillary files.

Tools used

Anthropic
Claude Opus

References

  1. T. Amdeberhan and M. Beck, Bergeron's conjecture & a tale of two binomial coefficients , preprint (2026), arXiv:2607.04050 (https://arxiv.org/abs/2607.04050).arXiv
  2. T. Amdeberhan and D. Callan, Gaussian inequality , preprint (2023), arXiv:2304.03395 (https://arxiv.org/abs/2304.03395).arXiv
  3. G. E. Andrews, On the difference of successive Gaussian polynomials , J. Statist. Plann. Inference 34 (1993), 19--22.
  4. F. Bergeron, A qq-analog of Foulkes' conjecture , Electron. J. Combin. 24 (1) (2017), Paper 1.38, arXiv:1602.08134 (https://arxiv.org/abs/1602.08134).arXiv
  5. L. M. Butler, A unimodality result in the enumeration of subgroups of a finite abelian group , Proc. Amer. Math. Soc. 101 (1987), 771--775.
  6. W. Y. C. Chen, C. J. Wang and L. X. W. Wang, The limiting distribution of the coefficients of the qq-Catalan numbers , Proc. Amer. Math. Soc. 136 (2008), 3759--3767, arXiv:0708.2574 (https://arxiv.org/abs/0708.2574).arXiv
  7. J. N. Darroch, On the distribution of the number of successes in independent trials , Ann. Math. Statist. 35 (1964), 1317--1321.
  8. P. Flajolet and R. Sedgewick, Analytic Combinatorics , Cambridge University Press, Cambridge, 2009.
  9. M. Gangl, Á. Gutiérrez and M. Szwej, On the generalised Foulkes conjecture for SL2(C)\mathrm{SL}_2(\mathbb{C}) under divisibility conditions , preprint (2025), arXiv:2507.06220 (https://arxiv.org/abs/2507.06220).arXiv
  10. K. Q. Ji, The qq-log-concavity and unimodality of qq-Kaplansky numbers , preprint (2021), arXiv:2111.03369 (https://arxiv.org/abs/2111.03369).arXiv
Show all 23 referencesShow fewer references
  1. F. Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic , IEEE Trans. Comput. 66 (2017), 1281--1292.
  2. A. W. Marshall, I. Olkin and B. C. Arnold, Inequalities: Theory of Majorization and Its Applications , 2nd ed., Springer, New York, 2011.
  3. S. Melczer, G. Panova and R. Pemantle, Counting partitions inside a rectangle , SIAM J. Discrete Math. 34 (2020), 2388--2410, arXiv:1805.08375 (https://arxiv.org/abs/1805.08375).arXiv
  4. K. M. O'Hara, Unimodality of Gaussian coefficients: a constructive proof , J. Combin. Theory Ser. A 53 (1990), 29--52.
  5. R. A. Proctor, Solution of two difficult combinatorial problems with linear algebra , Amer. Math. Monthly 89 (1982), 721--734.
  6. C. Raicu, S. V. Sam, J. Weyman and F. Yang, Powers of binary forms and derived Hermite reciprocity , preprint (2026), arXiv:2602.15175 (https://arxiv.org/abs/2602.15175).arXiv
  7. R. P. Stanley, Log-concave and unimodal sequences in algebra, combinatorics, and geometry , Ann. New York Acad. Sci. 576 (1989), 500--535.
  8. J. J. Sylvester, Proof of the hitherto undemonstrated fundamental theorem of invariants , Philos. Mag. 5 (1878), 178--188.
  9. J. M. Troyka, New generalizations of the Foulkes conjecture on qq-binomial coefficients , slides of a talk, Combinatorics and Graph Theory Seminar, Michigan State University, January 2024, https://users.math.msu.edu/group/combinatorics-graph-theory-seminar/troyka.pdf.link
  10. R. Vessenes, Generalized Foulkes' conjecture and tableaux construction , J. Algebra 277 (2004), 579--614.
  11. G. Xin and Y. Zhong, On parity unimodality of qq-Catalan polynomials , Electron. J. Combin. 27 (1) (2020), Paper 1.3, arXiv:1912.01829 (https://arxiv.org/abs/1912.01829).arXiv
  12. F. Zanello, On Bergeron's positivity problem for qq-binomial coefficients , Electron. J. Combin. 25 (2) (2018), Paper 2.17, arXiv:1709.06187 (https://arxiv.org/abs/1709.06187).arXiv
  13. D. Zeilberger, Kathy O'Hara's constructive proof of the unimodality of the Gaussian polynomials , Amer. Math. Monthly 96 (1989), 590--602.

Version history

  1. v1Submitted by Veronica PhanInitial depositCurrentOct 27, 2026