A Proof of Conjecture 26 of Kowitz and Zhao
This paper proves Conjecture 26 of Kowitz and Zhao concerning a sequence formed from Catalan numbers and Fibonacci numbers. Define\[a_n=\sum_{k=0}^{n}\binom{n}{k}C_{n-k}F_k.\]Kowitz and Zhao conjectured that \((a_n)_{n\ge1}\) is log-balanced. The proof uses a moment representation of the Catalan numbers, Binet's formula for the Fibonacci numbers, and bounds on ratios of consecutive terms. These bounds establish both the log-convexity of \((a_n)\) and the log-concavity of \((a_n/n!)\), proving the conjecture.
Authors
- Andy Huynh
Institutions
- San Jose State University (US)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-13
- DOI
- https://doi.org/10.5281/zenodo.24231499
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint