Abstract
In this paper we study composite rational functions which have at most a given number of distinct zeros and poles. A complete algorithmic characterization of all such functions and decompositions is given. This can be seen as a multiplicative analog of a result due to Zannier on polynomials that are lacunary in the sense that they have a bounded number of non-constant terms.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
