Searcharxiv⌕ Search

arXiv subjects

Horst Alzer

Publications and source records attributed to Horst Alzer.

11 recordsLinked to original sources
arXiv2024

Inequalities for 1/(1-cos(x)) and its derivatives

We prove that the function $g(x)= 1 / \bigl( 1 - \cos(x) \bigr)$ is completely monotonic on $(0,\pi]$ and absolutely monotonic on $[\pi, 2\pi)$, and we determine the best possible bounds $\lambda_n$ and $\mu_n$ such that the inequalities $$ \lambda_n \leq g^{(n)}(x)+g^{(n)}(y)-g^{(n)}(x+y) \quad (n \geq 0 \,\,\, \mbox{even}) $$ and $$ \mu_n \leq g^{(n)}(x+y)-g^{(n)}(x)-g^{(n)}(y) \quad (n \geq 1 \,\,\, \mbox{odd}) $$ hold for all $x,y\in (0,\pi)$ with $x+y\leq \pi$.

math.CA↗
arXiv2023

Inequalities for trigonometric sums

We present several new inequalities for trigonometric sums. Among others, we show that the inequality $$ \sum_{k=1}^n (n-k+1)(n-k+2)k\sin(kx) > \frac{2}{9} \sin(x) \bigl( 1+2\cos(x) \bigr)^2 $$ holds for all $n\geq 1$ and $x\in (0, 2\pi/3)$. The constant factor $2/9$ is sharp. This refines the classical Szeg\"o-Schweitzer inequality which states that the sine sum is positive for all $n\geq 1$ and $x\in (0,2 \pi/3)$. Moreover, as an application of one of our results, we obtain a two-parameter class of absolutely monotonic functions.

math.CA↗
arXiv2022

Identities for combinatorial sums involving trigonometric functions

Let $$ A_{m,n}(a)=\sum_{j=0}^m (-4)^j {m+j\choose 2j}\sum_{k=0}^{n-1} \sin(a+2kπ/n) \cos^{2j}(a+2kπ/n) $$ and $$ B_{m,n}(a)=\sum_{j=0}^m (-4)^j {m+j+1\choose 2j+1}\sum_{k=0}^{n-1} \sin(a+2kπ/n) \cos^{2j+1}(a+2kπ/n), $$ where $m\geq 0$ and $n\geq 1$ are integers and $a$ is a real number. We present two proofs for the following results: (i) If $2m+1 \equiv 0 \, (\mbox{mod} \, n)$, then $$ A_{m,n}(a)=(-1)^m n \sin((2m+1)a). $$ (ii) If $2m+1 \not\equiv 0 \, (\mbox{mod} \, n)$, then $A_{m,n}(a)=0$. (iii) If $2(m+1) \equiv 0 \, (\mbox{mod} \, n)$, then $$ B_{m,n}(a)=(-1)^m \frac{n}{2} \sin(2(m+1)a). $$ (iv) If $2(m+1) \not\equiv 0 \, (\mbox{mod} \, n)$, then $B_{m,n}(a)=0$.

math.CA↗
arXiv2022

On a combinatorial identity of Chaundy and Bullard

We give two new proofs of the Chaundy-Bullard formula $$ (1-x)^{n+1} \sum_{k=0}^m {n+k\choose k} x^k +x^{m+1}\sum_{k=0}^n {m+k\choose k} (1-x)^k=1 $$ and we prove the "twin formula" $$ \frac{ (1-x)^{(n+1)}}{(n+1)!} \sum_{k=0}^m \frac{n+1}{n+k+1} \frac{ x^{(k)}}{k!} + \frac{ x^{(m+1)}}{(m+1)!} \sum_{k=0}^n \frac{m+1}{m+k+1} \frac{ (1-x)^{(k)}}{k!}=1, $$ where $z^{(n)}$ denotes the rising factorial. Moreover, we present identities involving the incomplete beta function and a certain combinatorial sum.

math.GM↗
arXiv2020

Inequalities for Taylor series involving the divisor function

Let $$ T(q)=\sum_{k=1}^\infty d(k) q^k, \quad |q|<1, $$ where $d(k)$ denotes the number of positive divisors of the natural number $k$. We present monotonicity properties of functions defined in terms of $T$. More specifically, we proved that $$ H(q) := T(q)- \frac{\log(1-q)}{\log(q)} $$ is strictly increasing in $ (0,1) $ while $$ F(q) := \frac{1-q}{q} \,H(q) $$ is strictly decreasing in $ (0,1) $. These results are then applied to obtain various inequalities, one of which states that the double-inequality $$ α\,\frac{q}{1-q}+\frac{\log(1-q)}{\log(q)} < T(q)< β\,\frac{q}{1-q}+\frac{\log(1-q)}{\log(q)}, \quad 0<q<1, $$ holds with the best possible constant factors $α=γ$ and $β=1$. Here, $γ$ denotes Euler's constant. This refines a result of Salem, who proved the inequalities with $α=1/2$ and $β=1$.

math.NT↗
arXiv2019

Sharp Bounds for the Arc Lemniscate Sine Function

The arc lemniscate sine function is given by $$ \mbox{arcsl}(x)=\int_0^x \frac{1}{\sqrt{1-t^4}}dt. $$ In 2017, Mahmoud and Agarwal presented bounds for $\mbox{arcsl}$ in terms of the Lerch zeta function $$ Φ(z,s,a)=\sum_{k=0}^\infty \frac {z^k}{(k+a)^s}. $$ They proved $$ \frac{1}{8} \, x \, Φ(x^4, 3/2, 1/4) < \mbox{arcsl}(x)< \frac{1}{4} \, x \, Φ(x^4,3/2,1/4)\qquad{(0<x<1)}. $$ We %use the monotone form of l'Hopital's rule to show that the factor $1/4$ can be replaced by $\mbox{arcsl}(1)/Φ(1,3/2,1/4)=0.12836...$. This constant is best possible.

math.CA↗
arXiv2017

Identities involving Bernoulli and Euler polynomials

We present various identities involving the classical Bernoulli and Euler polynomials. Among others, we prove that $$ \sum_{k=0}^{[n/4]}(-1)^k {n\choose 4k}\frac{B_{n-4k}(z) }{2^{6k}} =\frac{1}{2^{n+1}}\sum_{k=0}^{n} (-1)^k \frac{1+i^k}{(1+i)^k} {n\choose k}{B_{n-k}(2z)} $$ and $$ \sum_{k=1}^{n} 2^{2k-1} {2n\choose 2k-1} B_{2k-1}(z) = \sum_{k=1}^n k \, 2^{2k} {2n\choose 2k} E_{2k-1}(z). $$ Applications of our results lead to formulas for Bernoulli and Euler numbers, like, for instance, $$ n E_{n-1} =\sum_{k=1}^{[n/2]} \frac{2^{2k}-1}{k} (2^{2k}-2^n){n\choose 2k-1} B_{2k}B_{n-2k}. $$

math.CA↗
arXiv2016

On a Sine Polynomial of Turan

In 1935, P. Turán proved that $$ S_{n,a}(x)= \sum_{j=1}^n{n+a-j\choose n-j} \sin(jx)>0 \quad{(n,a\in\mathbf{N}; 0<x<π).} $$ We present various related inequalities. Among others, we show that the refinements $$ S_{2n-1,a}(x)\geq \sin(x) \quad\mbox{and} \quad{S_{2n,a}(x)\geq 2\sin(x)(1+\cos(x))} $$ are valid for all integers $n\geq 1$ and real numbers $a\geq 1$ and $x\in(0,π)$. Moreover, we apply our theorems on sine sums to obtain inequalities for the Chebyshev polynomials of the second kind.

math.CA↗
arXiv2014

Sturm Theorem and a Refinement of Vietoris Inequality for Cosine Polynomials

In a recent work, the authors established a refinement of the well-known 1958 result of Vietoris on nonnegative cosine polynomials. In four places of the proof, use was made of the classical Sturm Theorem on determining the number of real roots of an algebraic polynomials in a given interval. Although absolutely rigorous, the Sturm procedure involves lengthy technical computations carried out with the help of the software MAPLE 13. This article provides such details which were omitted in the article presenting the recent work.

math.CA↗