Next Article in Journal
Profiling Social Sentiment in Times of Health Emergencies with Information from Social Networks and Official Statistics
Previous Article in Journal
A Forward–Backward Simheuristic for the Stochastic Capacitated Dispersion Problem
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Property (A) and Oscillation of Higher-Order Trinomial Differential Equations with Retarded and Advanced Arguments

by
Blanka Baculikova
Department of Mathematics and Theoretical Informatics, Faculty of Electrical Engineering and Informatics, Technical University of Košice, Letná 9, 042 00 Košice, Slovakia
Mathematics 2024, 12(6), 910; https://doi.org/10.3390/math12060910
Submission received: 6 February 2024 / Revised: 10 March 2024 / Accepted: 18 March 2024 / Published: 20 March 2024
(This article belongs to the Section Difference and Differential Equations)

Abstract

:
In this paper, a new effective technique for the investigation of the higher-order trinomial differential equations y ( n ) ( t ) + p ( t ) y ( τ ( t ) ) + q ( t ) y ( σ ( t ) ) = 0 is established. We offer new criteria for so-called property (A) and oscillation of the considered equation. Examples are provided to illustrate the importance of our results.

1. Introduction

Consider the functional differential equation of the form
y ( n ) ( t ) + p ( t ) y ( τ ( t ) ) + q ( t ) y ( σ ( t ) ) = 0 ,
where n is odd or even number and the following conditions are assumed to hold:
( H 1 )
p ( t ) , q ( t ) C ( [ t 0 , ) ) , p ( t ) > 0 , q ( t ) > 0 ,
( H 2 )
τ ( t ) C 1 ( [ t 0 , ) ) ,   τ ( t ) > 0 , τ ( t ) t ,   lim t τ ( t ) = ,
( H 3 )
σ ( t ) C 1 ( [ t 0 , ) ) ,   σ ( t ) > 0 , σ ( t ) t .
Usually, by a solution of Equation (1), we mean a function y : [ T y , ) R which satisfies (1) for all sufficiently large t and sup { y ( t ) : t T } > 0 for all T T y .
The oscillatory character of the solutions is understood in the standard way, that is, a proper solution is termed oscillatory or nonoscillatory according to whether it does or does not have infinitely many zeros.
In recent years, there has been increasing interest in studying the oscillation of solutions to different classes of differential equations, see e.g., [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15]. This is due to the fact that they have numerous applications in natural sciences and engineering—see, for instance, the papers [13,14] for models from mathematical biology where oscillation and/or delay actions may be formulated by means of cross-diffusion terms.
By the well-known result of Kiguradze [5] (Lemma 1), one can easily classify the possible nonoscillatory solutions of (1). As a matter of fact, the set N of all nonoscillatory solutions of (1) has the following decomposition
N = N 0 N 2 N n 1 , n odd , N = N 1 N 3 N n 1 , n even .
where y ( t ) N means that there exists t 0 T y such that
y ( t ) y ( i ) ( t ) > 0 on [ t 0 , ) for 0 i , ( 1 ) i y ( t ) y ( i ) ( t ) > 0 on [ t 0 , ) for i n .
Such a y ( t ) is said to be a solution of degree .
Following the classical results of Kiguradze [5], we say that Equation (1) enjoys property ( A ) if
N = N 0 , n odd , N = , n even .
This definition formulates the fact that (1) with τ ( t ) = σ ( t ) t and n odd always possesses a solution of degrees 0 that is N 0 in this case.
The initial effort of mathematicians was oriented towards establishing criteria for property (A) of (1), which means to empty all classes N for all 0 .
We recall the excellent criteria of Koplatadze et al. [9] that have been formulated for binomial differential equations.
Theorem 1
(Theorem 2.1 in [9]). If q ( t ) 0 and
lim sup t τ ( t ) t [ τ ( s ) ] n 2 p ( s ) d s + τ ( t ) t [ τ ( s ) ] n 1 p ( s ) d s + 1 τ ( t ) 0 τ ( t ) s [ τ ( s ) ) ] n 1 p ( s ) d s > ( n 1 ) ! ,
then (1) has property (A).
Theorem 2
(Theorem 2.2 in [9]). If p ( t ) 0 , n is even and
lim sup t σ ( t ) σ ( t ) s n 2 p ( s ) d s + t σ ( t ) s n 1 p ( s ) d s + 1 σ ( t ) 0 t s n 1 σ ( t ) p ( s ) d s > ( n 1 ) ! ,
then (1) has property (A).
Theorem 3
(Theorem 2.3 in [9]). If p ( t ) 0 , n is odd and
lim sup t σ ( t ) σ ( t ) σ ( s ) s n 3 p ( s ) d s + t σ ( t ) s n 2 σ ( s ) p ( s ) d s + 1 σ ( t ) 0 t s n 2 [ σ ( t ) ] 2 p ( s ) d s > 2 ( n 2 ) ! ,
and
lim sup t σ ( t ) σ ( t ) [ σ ( s ) ] n 2 p ( s ) d s + t σ ( t ) s [ σ ( s ) ] n 2 p ( s ) d s + 1 σ ( t ) 0 t s [ σ ( t ) ] n 1 p ( s ) d s > ( n 1 ) ! ,
then (1) has property (A).
The first aim of this paper is to extend the above-mentioned criteria known for binomial differential equations to more general trinomial equations. The second aim of this paper is to establish criteria for the class N 0 = , which leads to the oscillation of (1) also for n odd, which are new phenomena for (1).

2. Results

As an auxiliary statements, we recall the following result from [9].
Lemma 1.
Let y ( t ) N for some { 1 , , n 1 } and
t n | y ( n ) ( t ) | d t = .
Then there exists t * t 0 such that for t t *
y ( t ) t , y ( t ) t 1
and
y ( t ) t ! ( n ) ! t s n 1 p ( s ) y ( τ ( s ) ) + q ( s ) y ( σ ( s ) ) d s + t 1 ! ( n ) ! t * t s n p ( s ) y ( τ ( s ) ) + q ( s ) y ( σ ( s ) ) d s .
Moreover, if y ( t ) N , then y ( t ) c t 1 for some c > 0 . Since
t n | y ( n ) ( t ) | = t n p ( t ) y ( τ ( t ) ) + q ( t ) y ( σ ( t ) ) c t n p ( t ) τ 1 ( t ) + q ( t ) σ 1 ( t ) c p ( t ) τ n 1 ( t ) + q ( t ) t n 1 ,
we can replace nonstandard condition (7) by the following easily verifiable one.
τ n 1 ( s ) p ( s ) + s n 1 q ( s ) d s = .
which follows from the fact that if y ( t ) N , then y ( t ) c t 1 , c > 0 .
Now, we are prepared to formulate the first criterion for property (A) of (1).
Theorem 4.
Assume that for n even
lim sup t τ ( t ) t τ n 1 ( s ) p ( s ) d s + τ ( t ) t τ n 2 ( s ) p ( s ) + s n 2 q ( s ) d s + τ ( t ) τ ( t ) t s n 2 q ( s ) d s + 1 τ ( t ) t * τ ( t ) s τ n 1 ( s ) p ( s ) + s n q ( s ) d s > ( n 1 ) ! ,
and for n odd
lim sup t τ ( t ) t τ n 1 ( s ) p ( s ) d s + τ ( t ) t τ n 2 ( s ) p ( s ) + s n 3 σ ( s ) q ( s ) d s + τ ( t ) τ ( t ) t s n 3 σ ( s ) q ( s ) d s + 1 τ ( t ) t * τ ( t ) s τ n 1 ( s ) p ( s ) + s n 1 σ ( s ) q ( s ) d s > ( n 1 ) ! ,
then (1) has property (A).
Proof. 
Suppose, to contrary, that y ( t ) is an eventually positive solution of (1) such that y ( t ) N for some { 1 , , n 1 } such that n + is odd. To be able to use results of Lemma 1, we shall show that (11) and (12) implies (10). Really, if we admit that
τ n 1 ( s ) p ( s ) + s n 1 q ( s ) d s < ,
then for given ε > 0 , there exists a t 1 such that
t 1 τ n 1 ( s ) p ( s ) + s n 1 q ( s ) d s < ε ,
If we consider τ ( t ) t 1 , then
τ ( t ) t τ n 1 ( s ) p ( s ) d s + τ ( t ) τ ( t ) t s n 3 σ ( s ) q ( s ) d s τ ( t ) t τ n 1 ( s ) p ( s ) + s n 1 q ( s ) d s < ε .
On the other hand, for t t 1
τ ( t ) t τ n 2 ( s ) p ( s ) + s n 2 σ ( s ) q ( s ) d s t τ n 1 ( s ) p ( s ) + s n 1 q ( s ) d s < ε ,
and finally for t * t 1
1 τ ( t ) t * τ ( t ) s τ n 1 ( s ) p ( s ) + s n q ( s ) d s t * τ ( t ) τ n 1 ( s ) p ( s ) + s n 1 q ( s ) d s < ε .
Combining (13)–(15) one gets
lim t τ ( t ) t τ n 1 ( s ) p ( s ) d s + τ ( t ) t τ n 2 ( s ) p ( s ) + s n 2 q ( s ) d s + τ ( t ) τ ( t ) t s n 2 q ( s ) d s + 1 τ ( t ) t * τ ( t ) s τ n 1 ( s ) p ( s ) + s n q ( s ) d s = 0 .
This contradicts (11) and we conclude that (10) holds true. Therefore, taking into account (9), we get
y ( τ ( t ) ) τ ( t ) ( n ) ! ! τ ( t ) t s n 1 p ( s ) y ( τ ( s ) ) τ ( s ) τ ( s ) + s n 1 q ( s ) y ( σ ( s ) ) σ 1 ( s ) σ 1 ( s ) d s + τ ( t ) ( n ) ! ! t s n 1 p ( s ) y ( τ ( s ) ) τ 1 ( s ) τ 1 ( s ) + s n 1 q ( s ) y ( σ ( s ) ) σ 1 ( s ) σ 1 ( s ) d s + τ 1 ( t ) ( n ) ! ! t * τ ( t ) s n p ( s ) y ( τ ( s ) ) τ ( s ) τ ( s ) + s n q ( s ) y ( σ ( s ) ) σ 1 ( s ) σ 1 ( s ) d s .
Employing (8), that is
y ( τ ( t ) ) τ ( t ) , y ( τ ( t ) ) τ 1 ( t ) , y ( σ ( t ) ) σ 1 ( t ) y ( t ) t 1 y ( τ ( t ) ) τ 1 ( t ) ,
we are led to
( n ) ! ! y ( τ ( t ) ) y ( τ ( t ) ) τ ( t ) t s n 1 τ ( s ) p ( s ) d s + τ ( t ) τ ( t ) t s n 1 σ 1 ( s ) y ( s ) s 1 q ( s ) d s + τ ( t ) y ( τ ( t ) ) t s n 1 τ 1 ( s ) p ( s ) d s + τ ( t ) t s n 1 σ 1 ( s ) y ( τ ( s ) ) τ 1 ( s ) q ( s ) d s + y ( τ ( t ) ) τ ( t ) t * τ ( t ) s n τ ( s ) p ( s ) d s + τ 1 ( t ) t * τ ( t ) s n + 1 σ 1 ( s ) y ( s ) s q ( s ) d s .
Therefore, we get
( n ) ! ! τ ( t ) t s n 1 τ ( s ) p ( s ) d s + τ ( t ) τ ( t ) t s n 1 σ 1 ( s ) q ( s ) d s + τ ( t ) t s n 1 τ 1 ( s ) p ( s ) d s + τ ( t ) t s n 1 σ 1 ( s ) q ( s ) d s + 1 τ ( t ) t * τ ( t ) s n τ ( s ) p ( s ) d s + 1 τ ( t ) t * τ ( t ) s n + 1 σ 1 ( s ) q ( s ) d s .
The following considerations are intended to eliminate parameter . We use the fact that τ ( t ) t σ ( t ) . We shall distinguish the parity of n. For n even, we have { 1 , 3 , , n 1 } , and it follows from (16) that
( n 1 ) ! τ ( t ) t τ n 1 ( s ) p ( s ) d s + τ ( t ) τ ( t ) t s n 2 q ( s ) d s + τ ( t ) t τ n 2 ( s ) p ( s ) + s n 2 q ( s ) d s + 1 τ ( t ) t * τ ( t ) s τ n 1 ( s ) p ( s ) + s n q ( s ) d s .
The last inequality contradicts (11).
Now, we consider n even. Then, { 2 , 4 , , n 1 } and (16) yields
( n 1 ) ! τ ( t ) t τ n 1 ( s ) p ( s ) d s + τ ( t ) τ ( t ) t s n 3 σ ( s ) q ( s ) d s + τ ( t ) t τ n 2 ( s ) p ( s ) + s n 3 σ ( s ) q ( s ) d s + 1 τ ( t ) t * τ ( t ) s τ n 1 ( s ) p ( s ) + s n 1 σ ( s ) q ( s ) d s .
The last inequality contradicts (12) and the proof is complete. □
The main idea of the proof of Theorem 4 is to nominate delay argument τ ( t ) into (9). Now, we are about to substitute advanced argument σ ( t ) into (9) to obtain another (independent) criterion for property (A).
Theorem 5.
Assume that for n even
lim sup t 1 σ ( t ) t σ ( t ) s τ n 1 ( s ) p ( s ) d s + σ ( t ) σ ( t ) τ n 1 ( s ) s p ( s ) + s n 2 q ( s ) d s + t σ ( t ) s n 1 q ( s ) d s + 1 σ ( t ) t * t s τ n 1 ( s ) p ( s ) + σ ( s ) s n 1 q ( s ) d s > ( n 1 ) ! ,
and for n odd
lim sup t 1 σ ( t ) t σ ( t ) s τ n 1 ( s ) p ( s ) d s + σ ( t ) σ ( t ) τ n 1 ( s ) s p ( s ) + σ ( s ) s n 3 q ( s ) d s + t σ ( t ) σ ( s ) s n 2 q ( s ) d s + 1 σ ( t ) t * t s τ n 1 ( s ) p ( s ) + σ 2 ( s ) s n 2 q ( s ) d s > ( n 1 ) ! ,
then (1) has property (A).
Proof. 
Suppose, to contrary, that (1) does not enjoy property (A). This means that (1) possesses an eventually positive solution y ( t ) N for some { 1 , , n 1 } with n + odd. It follows from (9) that
y ( σ ( t ) ) σ ( t ) ( n ) ! ! σ ( t ) s n 1 p ( s ) y ( τ ( s ) ) τ ( s ) τ ( s ) + s n 1 q ( s ) y ( σ ( s ) ) σ 1 ( s ) σ 1 ( s ) d s + σ 1 ( t ) ( n ) ! ! t σ ( t ) s n p ( s ) y ( τ ( s ) ) τ ( s ) τ ( s ) + s n q ( s ) y ( σ ( s ) ) σ 1 ( s ) σ 1 ( s ) d s + σ 1 ( t ) ( n ) ! ! t * t s n p ( s ) y ( τ ( s ) ) τ ( s ) τ ( s ) + s n q ( s ) y ( σ ( s ) ) σ ( s ) σ ( s ) d s .
Condition (8) implies that
y ( σ ( t ) ) σ ( t ) , y ( σ ( t ) ) σ 1 ( t ) , y ( τ ( t ) ) τ ( t ) y ( t ) t y ( σ ( t ) ) σ ( t ) ,
Therefore,
( n 1 ) ! y ( σ ( t ) ) σ ( t ) σ ( t ) s n 1 p ( s ) y ( s ) s ( s ) τ ( s ) d s + σ ( t ) y ( σ ( t ) ) σ ( t ) s n 1 q ( s ) σ 1 ( s ) d s + σ 1 ( t ) t σ ( t ) s n p ( s ) y ( s ) s ( s ) τ ( s ) d s + y ( σ ( t ) ) t σ ( t ) s n q ( s ) σ 1 ( s ) d s + σ 1 ( t ) t * t s n p ( s ) y ( s ) s ( s ) τ ( s ) d s + y ( σ ( s ) ) σ ( s ) t * t s n q ( s ) σ ( s ) d s .
Employing (8), one gets
( n 1 ) ! σ ( t ) σ ( t ) s n 2 τ ( s ) p ( s ) + s n 1 σ 1 ( s ) q ( s ) d s + 1 σ ( t ) t σ ( t ) s n τ ( s ) p ( s ) d s + t σ ( t ) s n σ 1 ( s ) q ( s ) d s + 1 σ ( t ) t * t s n τ ( s ) p ( s ) d s + s n σ ( s ) q ( s ) d s .
For n even we have { 1 , 3 , , n 1 } and (19) in view of τ ( t ) t σ ( t ) implies
( n 1 ) ! σ ( t ) σ ( t ) τ n 1 ( s ) s p ( s ) + s n 2 q ( s ) d s + 1 σ ( t ) t σ ( t ) s τ n 1 ( s ) p ( s ) d s + t σ ( t ) s n 1 q ( s ) d s + 1 σ ( t ) t * t s τ n 1 ( s ) p ( s ) d s + s n 1 σ ( s ) q ( s ) d s
which contradicts (17).
On the other hand, for n even, we have { 2 , 4 , , n 1 } , and now (19) yields
( n 1 ) ! σ ( t ) σ ( t ) τ n 1 ( s ) s p ( s ) + σ ( s ) s n 3 q ( s ) d s + 1 σ ( t ) t σ ( t ) s τ n 1 ( s ) p ( s ) d s + t σ ( t ) σ ( s ) s n 2 q ( s ) d s + 1 σ ( t ) t * t s τ n 1 ( s ) p ( s ) d s + s n 2 σ 2 ( s ) q ( s ) d s .
This contradicts (18), and the proof is finished. □
The following example is intended to show that the criteria for property (A) presented in Theorems 4 and 5 are independent.
Example 1.
Consider the equation
y ( n ) ( t ) + p 0 t n y ( λ t ) + q 0 t n y 1 λ t = 0 ,
where p 0 > 0 ,   q 0 > 0 , λ ( 0 , 1 ) .
Easy computations show that conditions (11) and (17) applied to (20) reduce to
p 0 λ n 1 ( 2 ln λ ) + 2 q 0 > ( n 1 ) !
and
2 p 0 λ n 1 + q 0 ( 2 ln λ ) > ( n 1 ) ! ,
respectively. It is easy that (21) and (22) are independent, since
p 0 λ n 1 ( 2 ln λ ) > 2 p 0 λ n 1 and 2 q 0 < q 0 ( 2 ln λ ) .
On the other hand, conditions (12) and (18) applied to (20) take the form
p 0 λ n 1 ( 2 ln λ ) + 2 q 0 λ > ( n 1 ) !
and
2 p 0 λ n 1 + 2 q 0 λ ( 2 ln λ ) > ( n 1 ) ! ,
respectively, and again, (23) and (24) are independent. Therefore, by Theorems 4 and 5 if
(i)
for n even (21) or (22) holds,
( i i )
for n odd (23) or (24) is satisfied,
then, (20) has property (A). For the particular case when n = 3 ,   λ = 0.5 criterion (24) is satisfied, e.g., for
p 0 = q 0 > 0.1774 .
Now, we turn our attention to the class N 0 , where of course n is odd. It is easy to see that ( H 2 ) guaranties the existence of the inverse function τ 1 ( t ) , and therefore, the auxiliary function ξ ( t ) C 1 ( [ t 0 , ) )
ξ ( ξ ( t ) ) = τ 1 ( t ) .
is well defined. The following lemma is elementary but very useful in our next considerations.
Lemma 2.
Assume that ξ ( t ) satisfies (25). Then
ξ 1 ( ξ 1 ( t ) ) = τ ( t ) , ξ ( t ) = τ 1 ( ξ 1 ( t ) ) , ξ 1 ( t ) = τ ( ξ ( t ) ) .
Now, our aim is to establish a criterion for N 0 = for (1) for n odd. To simplify our notation, we employ the following functions:
P 1 ( t ) = t ξ ( t ) ( s t ) n 1 ( n 1 ) ! p ( s ) d s , P 2 ( t ) = ξ ( t ) τ 1 ( t ) ( s t ) n 1 ( n 1 ) ! p ( s ) d s , P 3 ( t ) = τ 1 ( t ) τ 1 ( ξ ( t ) ) ( s t ) n 1 ( n 1 ) ! p ( s ) d s .
and
Q 1 ( t ) = t ξ ( t ) ( s t ) n 1 ( n 1 ) ! q ( s ) d s , Q 2 ( t ) = ξ ( t ) τ 1 ( t ) ( s t ) n 1 ( n 1 ) ! q ( s ) d s .
We assume that there exist positive constants P i ,   i = 1 , 2 , 3 and Q i ,   i = 1 , 2 such that
P i ( t ) P i , i = 1 , 2 , 3 and Q i ( t ) Q i , i = 1 , 2 .
Moreover, we set
P i * = P i 1 P 2 , i = 1 , 3 , Q i * = Q i 1 P 2 , i = 1 , 2 ,
and
M = P 1 * 2 1 P 1 * P 3 * , N = P 1 * 1 P 1 * P 3 * P 1 * Q 1 * M .
Theorem 6.
Assume that there exists a function ξ ( t ) satisfying (25) and τ 1 ( t ) σ ( t ) . If
P 3 * N + M N Q 1 * + P 1 * Q 2 * + P 1 * P 1 * + P 3 * + P 1 * Q 1 * N + Q 2 * M N > 1 ,
then N 0 = for (1) for n odd.
Proof. 
Suppose, to contrary, that y ( t ) is an eventually positive solution of (1) for n odd such that y ( t ) N 0 . Integrating (1) twice from t to and changing the order of integration, we are led to
y ( n 2 ) ( t ) t ( s t ) p ( s ) y ( τ ( s ) ) + ( s t ) q ( s ) y ( σ ( s ) ) d s .
By repeated integration above inequality from t to and changing the order of integration, we get
y ( t ) t ( s t ) n 1 ( n 1 ) ! p ( s ) y ( τ ( s ) ) + ( s t ) n 1 ( n 1 ) ! q ( s ) y ( σ ( s ) ) d s t ( s t ) n 1 ( n 1 ) ! p ( s ) y ( τ ( s ) ) + ( s t ) n 1 ( n 1 ) ! q ( s ) y ( τ 1 ( s ) ) d s .
Consequently,
y ( t ) t ξ ( t ) ( s t ) n 1 ( n 1 ) ! p ( s ) y ( τ ( s ) ) d s + ξ ( t ) τ 1 ( t ) ( s t ) n 1 ( n 1 ) ! p ( s ) y ( τ ( s ) ) d s + τ 1 ( t ) τ 1 ( ξ ( t ) ) ( s t ) n 1 ( n 1 ) ! p ( s ) y ( τ ( s ) ) d s + t ξ ( t ) ( s t ) n 1 ( n 1 ) ! q ( s ) y τ 1 ( s ) d s + ξ ( t ) τ 1 ( t ) ( s t ) n 1 ( n 1 ) ! q ( s ) y τ 1 ( s ) d s .
Using the fact that y ( t ) is a decreasing function, we are led to
y ( t ) P 1 y ( ξ 1 ( t ) ) + P 2 y ( t ) + P 3 y ( ξ ( t ) ) + Q 1 y τ 1 ( ξ ( t ) ) + Q 2 y τ 1 τ 1 ( t )
which is equivalent to
y ( t ) P 1 * y ( ξ 1 ( t ) ) + P 3 * y ( ξ ( t ) ) + Q 1 * y τ 1 ( ξ ( t ) ) + Q 2 * y τ 1 τ 1 ( t ) .
We are about to evaluate y ( t ) in terms of P i * and Q i * . For all that, we step by step set
t = ξ 1 ( t ) , t = ξ ( t ) , t = τ 1 ( ξ ( t ) ) , t = τ 1 τ 1 ( t )
into (33). Before executing all that, to simplify our notation, we set
Y = y ( t ) , A = y ( ξ 1 ( t ) ) , B = y ( ξ ( t ) ) , C = y τ 1 ( ξ ( t ) ) , D = y τ 1 τ 1 ( t ) , E = y ( τ 1 ( t ) ) .
Finally, we are led to the following linear algebraic inequalities
Y P 1 * A + P 3 * B + Q 1 * C + Q 2 * D , A P 1 * + P 3 * Y + Q 1 * E + Q 2 * C , B P 1 * Y + P 3 * E + Q 1 * D , C P 1 * E + P 3 * D , D P 1 * C , E P 1 * B .
Elimination of variables D and E leads to
Y P 1 * A + P 3 * B + Q 1 * + P 1 * Q 2 * C , A P 1 * + P 3 * Y + P 1 * Q 1 * B + Q 2 * C , B P 1 * Y + P 1 * P 3 * B + P 1 * Q 1 * C , C P 1 * 2 B + P 1 * P 3 * C .
Thus,
C P 1 * 2 1 P 1 * P 3 * B = M B
which implies
B P 1 * 1 P 1 * P 3 * P 1 * Q 1 * M Y = N Y .
Consequently, our system reduces onto the couple of inequalities
Y P 1 * A + P 3 * N Y + M N Q 1 * + P 1 * Q 2 * Y , A P 1 * + P 3 * Y + P 1 * Q 1 * N Y + Q 2 * M N Y
which means that
y ( t ) 1 P 3 * N M N Q 1 * + P 1 * Q 2 * P 1 * P 1 * + P 3 * + P 1 * Q 1 * N + Q 2 * M N > 0 .
This contradicts (29), and we conclude that N 0 = .
The following criteria follows immediately from the proof of Theorem 6.
Corollary 1.
Assume that there exists a function ξ ( t ) satisfying (26) and τ 1 ( t ) σ ( t ) . If
P 2 > 1 , o r P 1 P 3 + P 1 Q 1 M > 1 ,
then N 0 = for (1).
Example 2.
Consider once more the equation
y ( n ) ( t ) + p 0 t n y ( λ t ) + q 0 t n y 1 λ t = 0 ,
where p 0 > 0 ,   q 0 > 0 , λ ( 0 , 1 ) .
We have already presented criteria for property (A) of (20). If for n odd, we join on condition (29), we obtain oscillation of (20). It remains to evaluate constants P i and Q j for (20). We set ξ ( t ) = t / λ . Now,
P 1 ( t ) = p 0 ( n 1 ) ! t t / λ ( s t ) n 1 s n d s = | x = 1 t s | = p 0 ( n 1 ) ! 0 1 λ x n 1 1 x d x = p 0 ( n 1 ) ! ln λ i = 1 n 1 1 λ i i = P 1 .
Similarly, we evaluate
P 2 = p 0 ( n 1 ) ! ln λ i = 1 n 1 1 λ i 1 λ i i , P 3 = p 0 ( n 1 ) ! ln λ i = 1 n 1 1 λ λ i 1 λ i i , Q 1 = q 0 ( n 1 ) ! ln λ i = 1 n 1 1 λ i i , Q 2 = q 0 ( n 1 ) ! ln λ i = 1 n 1 1 λ i 1 λ i i .
Employing mathematical software (Matlab R2019), we see that for the particular case when n = 3 and λ = 0.5 , criterion (29) is satisfied, e.g., for
p 0 = q 0 > 17.3
which guarantees oscillation of (20) for this case. By the way, the well-known criterion of Koplatadze and Chanturija [10] (see also [11]) requires p 0 > 29.3482 to ensure oscillation of (20) for n = 3 and λ = 0.5 . The progress is outstanding.

3. Discussion

In this paper, we have established a new technique for the investigation of trinomial differential equations with retarded and advanced argument. First, we extended some results from binomial to trinomial differential equation. For the second, we introduced a new technique for classes N 0 and N n to be empty, which leads to the oscillation of (1). This fact has not be considered in [9]. The open problem remains how to extend our criteria for more general differential equations (nonlinear, neutral).

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable for studies not involving humans or animals.

Informed Consent Statement

Not applicable for studies not involving humans.

Data Availability Statement

The data presented in this study are available on request from the corresponding author.

Conflicts of Interest

The author declare no conflicts of interest.

References

  1. Agarwal, R.P.; Grace, S.R.; O’Regan, D. Oscillation Theory for Second Order Linear, Half-linear, Superlinear and Sublinear Dynamic Equations; Kluver Academic Publishers: Dotrecht, The Netherlands, 2002. [Google Scholar]
  2. Baculikova, B. New monotonicity properties and oscillation of n-order functional differential equations with deviating argument. Electron. J. Qual. Theory Differ. Equ. 2023, 30, 1–10. [Google Scholar] [CrossRef]
  3. Baculikova, B. Oscillation of even order linear functional differential equations with mixed deviating arguments. Opusc. Math. 2019, 42, 549–560. [Google Scholar] [CrossRef]
  4. Baculikova, B. Oscillatory behavior of the second order functional differential equations. Appl. Math. Lett. 2017, 42, 35–41. [Google Scholar] [CrossRef]
  5. Kiguradze, I.T. On the oscillation of solutions of the equation d m u d t m + a ( t ) | u | n s i g n   u = 0 . Mat. Sb. 1964, 65, 172–187. (In Russian) [Google Scholar]
  6. Kiguradze, I.T.; Chaturia, T.A. Asymptotic Properties of Solutions of Nonatunomous Ordinary Differential Equations; Kluver Academic Publishers: Dotrecht, The Netherlands, 1993. [Google Scholar]
  7. Koplatadze, R. On differential equations with a delayed argument having properties A and B. Differ. Uravn. 1989, 25, 1897–1909. [Google Scholar]
  8. Koplatadze, R. On oscillatory properties of solutions of functional differential equations. Mem. Differ. Equ. Math. Phys. 1994, 3, 170–179. [Google Scholar]
  9. Koplatadze, R.; Kvinkadze, G.; Stavroulakis, I.P. Properties A and B of n-th order linear differential equations with deviating argument. Georgian Math. J. 1999, 6, 553–566. [Google Scholar] [CrossRef]
  10. Koplatadze, R.; Chanturia, T.A. On Oscillatory Properties of Differential Equations with Deviating Arguments; Tbilisi University Press: Tbilisi, GA, USA, 1977. [Google Scholar]
  11. Kusano, T. On even order functional differential equations with advanced and retarded arguments. J. Differ. Equ. 1982, 45, 75–84. [Google Scholar] [CrossRef]
  12. Kusano, T. Oscillation of even order linear functional differential equations with deviating arguments of mixed type. J. Math. Anal. Appl. 1984, 98, 341–347. [Google Scholar] [CrossRef]
  13. Li, T.; Pintus, N.; Viglialoro, G. Properties of solutions to porous medium problems with different sources and boundary conditions. Z. Angew. Math. Phys. 2019, 70, 86. [Google Scholar] [CrossRef]
  14. Li, T.; Viglialoro, G. Boundedness for a nonlocal reaction chemotaxis model even in the attreaction-dominated regime. Differ. Integral Equ. 2021, 34, 315–336. [Google Scholar]
  15. Laddas, G.; Lakshmikantham, V.; Papadakis, J.S. Oscillation of Higher-Order Retarded Differential Equations Generated by Retarded Argument; Academic Press: New York, NY, USA, 1972. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Baculikova, B. Property (A) and Oscillation of Higher-Order Trinomial Differential Equations with Retarded and Advanced Arguments. Mathematics 2024, 12, 910. https://doi.org/10.3390/math12060910

AMA Style

Baculikova B. Property (A) and Oscillation of Higher-Order Trinomial Differential Equations with Retarded and Advanced Arguments. Mathematics. 2024; 12(6):910. https://doi.org/10.3390/math12060910

Chicago/Turabian Style

Baculikova, Blanka. 2024. "Property (A) and Oscillation of Higher-Order Trinomial Differential Equations with Retarded and Advanced Arguments" Mathematics 12, no. 6: 910. https://doi.org/10.3390/math12060910

APA Style

Baculikova, B. (2024). Property (A) and Oscillation of Higher-Order Trinomial Differential Equations with Retarded and Advanced Arguments. Mathematics, 12(6), 910. https://doi.org/10.3390/math12060910

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop