A direct proof of Brannan's conjecture for \(\beta = 1\) (Q2208940)

For \(z,\omega\in \mathbb{C}\) with \(|z| < 1 = |\omega|\) write \[ \frac{(1+\omega z)^\alpha}{(1-z)^\beta}=\sum_{n=0}^{\infty}\mathcal{A}_n(\alpha,\beta,\omega)z^n. \]The coefficients \(\mathcal{A}_n\) can be written as \[\mathcal{A}_n(\alpha,\beta,\omega) = \frac{(\beta)_n}{n!}\,_2F_1(-n, -\alpha; 1-\beta - n; -\omega),\] where \(\,_2F_1\) is the Gaussian hypergeometric function. Brannan's conjecture states that the inequality \[\mathcal{A}_n(\alpha,\beta,e^{i\theta})\leq \mathcal{A}_n(\alpha,\beta,1) \]holds for all odd \(n\), \(\alpha,\beta\in(0,1]\) and \(\theta\in (-\pi,\pi].\) Recent results of several authors provide a proof of Brannan's conjecture for the case that \(\beta=1\), which relies on a computer-assisted argument. The present paper presents a direct analytical proof of this result.