A sharp oscillation criterion for a difference equation with constant delay

Advances in Difference Equations, 2020

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.1186/s13662-020-03016-x
Data confidence 85 high
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Abstract It is known that all solutions of the difference equation $$\Delta x(n)+p(n)x(n-k)=0, \quad n\geq0, $$ Δ x ( n ) + p ( n ) x ( n − k ) = 0 , n ≥ 0 , where $\{p(n)\}_{n=0}^{\infty}$ { p ( n ) } n = 0 ∞ is a nonnegative sequence of reals and k is a natural number, oscillate if $\liminf_{n\rightarrow\infty}\sum_{i=n-k}^{n-1}p(i)> ( \frac {k}{k+1} ) ^{k+1}$ lim inf n → ∞ ∑ i = n − k n − 1 p ( i ) > ( k k + 1 ) k + 1 . In the case that $\sum_{i=n-k}^{n-1}p(i)$ ∑ i = n − k n − 1 p ( i ) is slowly varying at infinity, it is proved that the above result can be essentially improved by replacing the above condition with $\limsup_{n\rightarrow\infty}\sum_{i=n-k}^{n-1}p(i)> ( \frac{k}{k+1} ) ^{k+1}$ lim sup n → ∞ ∑ i = n − k n − 1 p ( i ) > ( k k + 1 ) k + 1 . An example illustrating the applicability and importance of the result is presented.