×

Uniqueness of meromorphic functions and differential polynomials. (English) Zbl 1165.30360

Summary: We study the uniqueness theorem of meromorphic functions concerning differential polynomials, and obtain two theorems, which improve and generalize the related results of Fang, S.S. Bhoosnurmath and R.S. Dyavanal and Xiao-Yu Zhang and Wei-Chuan Lin.

MSC:

30D35 Value distribution of meromorphic functions of one complex variable, Nevanlinna theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Yang, C. C.; Yi, H. X., Uniqueness Theory of Meromorphic Functions (2006), Science Press: Science Press Beijing · Zbl 0799.30019
[2] Wang, Y. F., On Mues conjecture and Picard values, Sci. China, 36, 1, 28-35 (1993) · Zbl 0777.30017
[3] Fang, M. L., Uniqueness and value-sharing of entire function, Comput. Math. Appl., 44, 828-831 (2002)
[4] Zhang, X.-Y.; Lin, W.-C., Uniqueness and value-sharing of entire functions, J. Math. Anal. Appl. (2008)
[5] Yang, L., Value Distribution Theory (1993), Spring-Verlag: Spring-Verlag Berlin
[6] Yang, C. C., On deficiencies of differential polynomials, Math. Z., 125, 107-112 (1972) · Zbl 0217.38402
[7] Frank, G., Eine vermutung von hayman uber nullstellen meromorpher function, Math. Z., 149, 29-36 (1976) · Zbl 0312.30032
[8] Bhoosnurmath, S. S.; Dyavanal, R. S., Uniqueness and value-sharing of meromorphic functions, Comput. Math. Appl., 53, 1191-1205 (2007) · Zbl 1170.30011
[9] Lahiri, I., Uniqueness of a meromorphic function and its derivate, J. Inequal. Pure Appl. Math., 5, 1 (2004), Art 20
[10] Zhang, Q. C., Meromorphic function that share one small function with its derivative, J. Inequal. Pure Appl. Math., 6, 4 (2005), Art 116
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.