English

An asymptotic approach to Borwein-type sign pattern theorems

Combinatorics 2022-02-01 v1

Abstract

The celebrated (First) Borwein Conjecture predicts that for all positive integers~nn the sign pattern of the coefficients of the ``Borwein polynomial'' (1q)(1q2)(1q4)(1q5)(1q3n2)(1q3n1)(1-q)(1-q^2)(1-q^4)(1-q^5) \cdots(1-q^{3n-2})(1-q^{3n-1}) is +++--+--\cdots. It was proved by the first author in [Adv. Math. 394 (2022), Paper No. 108028]. In the present paper, we extract the essentials from the former paper and enhance them to a conceptual approach for the proof of ``Borwein-like'' sign pattern statements. In particular, we provide a new proof of the original (First) Borwein Conjecture, a proof of the Second Borwein Conjecture (predicting that the sign pattern of the square of the ``Borwein polynomial'' is also +++--+--\cdots), and a partial proof of a ``cubic'' Borwein Conjecture due to the first author (predicting the same sign pattern for the cube of the ``Borwein polynomial''). Many further applications are discussed.

Keywords

Cite

@article{arxiv.2201.12415,
  title  = {An asymptotic approach to Borwein-type sign pattern theorems},
  author = {Chen Wang and Christian Krattenthaler},
  journal= {arXiv preprint arXiv:2201.12415},
  year   = {2022}
}
R2 v1 2026-06-24T09:08:10.950Z