A Proof of Conjecture 26 of Kowitz and Zhao
Year: 2026
Type: preprint
Abstract: 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.
Author: Huynh, Andy
Institution: San Jose State University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7227565502
