Rogosinski-Szegő type inequalities for trigonometric sums (Q2514842)

A classical result on inequalities for trigonometric sums states that \[ 0\leq \sum_{k=1}^n \frac{\sin(kx)}{k}\quad (0\leq x\leq \pi; n=1,2,\ldots). \quad (1) \] The validity of this inequality was conjectured by Fejér in 1910 and proved by \textit{D. Jackson} [Rend. Circ. Mat. Palermo 32, 257--262 (1911; JFM 42.0281.03)]. \textit{W. H. Young} [Proc. Lond. Math. Soc. (2) 11, 357--366 (1912; JFM 43.0324.03)] considered an analogue of the above expression for cosine sums: \[ -1\leq \sum_{k=1}^n \frac{\cos(kx)}{k}\quad (0\leq x\leq \pi; n=1,2,\ldots). \quad (2) \] The bounds in (1) and (2) are sharp. It should be pointed out that Brown and Koumandos [Monatsh. Math. 123 (1997), 109--119] proved that if \(n\geq 2\), then the best possible lower bound in (2) is given by \(-5/6\). As a variant of (2), \textit{W. Rogosinski} and \textit{G. Szegő} [Math. Z. 28, 73--94 (1928; JFM 54.0336.03)] established that \[ \sum_{k=1}^n \frac{\cos(kx)}{k+1}\geq -\frac{1}{2}\quad (0\leq x\leq \pi; n=1,2,\ldots), \] where the bound \(-1/2\) is sharp. In this paper, the authors obtain two main results as follows: \[ \sum_{k=1}^n \frac{\sin(kx)}{k+1}\geq \frac{1}{384}(9-\sqrt{137})\sqrt{110-6\sqrt{137}}\quad (0\leq x\leq \pi; n=1,2,\ldots),\tag{i} \] where the equality holds if and only if \(x=\arccos\frac{-3-\sqrt{137}}{16}\) and \(n=2\). \[ \sum_{k=1}^n \frac{\sin(kx)+\cos(kx)}{k+1}\geq -\frac{1}{2}\quad (0\leq x\leq \pi; n=1,2,\ldots),\tag{ii} \] where the equality holds if and only if \(x=\pi\) and \(n=1\).