186
Views
18
CrossRef citations to date
0
Altmetric
Original Articles

A new Clunie type theorem for difference polynomials

Pages 387-400 | Received 13 Aug 2008, Accepted 07 Apr 2009, Published online: 03 Jan 2011
 

Abstract

It is shown that if w(z) is a finite-order meromorphic solution of the equation

where , , is a homogeneous difference polynomial with meromorphic coefficients, and and are polynomials in w(z) with meromorphic coefficients having no common factors such that
where ord0(P) denotes the order of zero of at x 0 = 0 with respect to the variable x 0, then the Nevanlinna counting function N(r,w) satisfies . This implies that w(z) has a relatively large number of poles. For a smaller class of equations, a stronger assertion is obtained, which means that the pole density of w(z) is essentially as high as the growth of w(z) allows. As an application, a simple necessary and sufficient condition is given in terms of the value distribution pattern of the solution, which can be used as a tool in ruling out the possible existence of special finite-order Riccati solutions within a large class of difference equations containing several known difference equations considered to be of Painlevé type.

AMS Subject Classification::

Acknowledgements

The research reported in this paper was supported in part by the Academy of Finland grant #118314 and #210245. We would like to thank the anonymous referees for their helpful comments on the paper.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.