Uniqueness of meromorphic functions sharing two sets with least possible cardinalities
Author(s) -
Arindam Sarkar
Publication year - 2019
Publication title -
annals of west university of timisoara - mathematics and computer science
Language(s) - English
Resource type - Journals
eISSN - 1841-3307
pISSN - 1841-3293
DOI - 10.2478/awutm-2019-0019
Subject(s) - meromorphic function , cardinality (data modeling) , uniqueness , fang , mathematics , set (abstract data type) , finite set , pure mathematics , combinatorics , discrete mathematics , computer science , mathematical analysis , data mining , ecology , biology , programming language
Let f and g be two nonconstant meromorphic functions sharing two finite sets, namely S ⊂ ℂ and {∞}. We prove two uniqueness theorems under weaker conditions on ramification indices, reducing the cardinality of the shared set S and weakening the nature of sharing of the set {∞} which improve results of Fang-Lahiri [7], Lahiri [17], Banerjee -Majumder-Mukherjee [5] and others.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom