Abstract

We present a technique for reducing the order of polynomial-like iterative equations; in particular, we answer a question asked by Wenmeng Zhang and Weinian Zhang. Our method involves the asymptotic behaviour of the sequence of consecutive iterates of the unknown function at a given point. As an application we solve a generalized problem of Zoltan Boros posed during the 50th ISFE.

Highlights

  • Suppose I ⊂ R is a non-degenerated interval and let g : I → I be a function

  • The main objective of this paper is to give particular conditions under which a converse holds, i.e., we want to find some conditions guaranteeing that if a continuous function g satisfies (1.1), there is a divisor of aN rN + · · · + a1r + a0 such that g is a solution to the corresponding iterative equation of lower order

  • A function g satisfies Eq (1.1) if and only if for every x0 ∈ I the sequencem∈N0 given by xm = g(xm−1) for all m ∈ N satisfies the recurrence relation (1.3)

Read more

Summary

Introduction

Suppose I ⊂ R is a non-degenerated interval and let g : I → I be a function. Assuming g to be continuous we are interested in lowering the order of the equation aN gN (x) + · · · + a1g(x) + a0x = 0,. One of methods for finding solutions to Eq (1.1), and to its nonhomogenous counterpart, where zero on the right-hand side is replaced by an arbitrary continuous function, is based on lowering its order The first such results on the whole real line were obtained in [8] in the case where all roots of the characteristic equation are real and satisfy some special conditions. The main objective of this paper is to give particular conditions under which a converse holds, i.e., we want to find some conditions guaranteeing that if a continuous function g satisfies (1.1), there is a divisor of aN rN + · · · + a1r + a0 such that g is a solution to the corresponding iterative equation of lower order

Preliminaries
Eliminating non-real roots
Eliminating roots of opposite sign
A generalized Zoltan Boros’ problem
Questions and remarks
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.