11 citations · 12 across the 3 of their papers we have counts for
3 papers
math.CA2005★ 11 cited
A Computer Proof of Turan's Inequality
S. Gerhold, M. Kauers
We show how Turan's inequality for Legendre polynomials and related inequalities can be proven by means of a computer procedure. The use of th…
math.CO2005★ 1 cited
The Positivity Set of a Recurrence Sequence
Jason P. Bell, Stefan Gerhold
We consider real sequences that satisfy a linear recurrence with constant coefficients. We show that the density of the positivity set of such a sequence always exists. In…
math.NT2005
Point Lattices and Oscillating Recurrence Sequences
Stefan Gerhold
We consider the following question: Which real sequences (a(n)) that satisfy a linear recurrence with constant coefficients are positive for sufficiently large n? We show that the…