Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T14:20:47.118Z Has data issue: false hasContentIssue false

Finiteness of Entire Functions Sharing a Finite Set

Published online by Cambridge University Press:  11 January 2016

Hirotaka Fujimoto*
Affiliation:
KOKUCHU-KAI 6-19-18, Ichinoe Edogawaku, Tokyo 132-0024, Japan, h_fujimoto@kokuchukai.or.jp
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For a finite set S = {a1,…, aq }, consider the polynomial PS (w) = (w – a1 )(w – a2 ) … (w – aq ) and assume that has distinct k zeros. Suppose that PS (w) is a uniqueness polynomial for entire functions, namely that, for any nonconstant entire functions ɸ and ψ, the equality PS (ɸ) = cPS (ψ) implies ɸ = ψ, where c is a nonzero constant which possibly depends on ɸ and ψ. Then, under the condition q > k + 2, we prove that, for any given nonconstant entire function g, there exist at most (2q-2)/(q – k – 2) nonconstant entire functions f with f*(S) = g*(S), where f*(S) denotes the pull-back of S considered as a divisor. Moreover, we give some sufficient conditions of uniqueness polynomials for entire functions.

Keywords

Information

Type
Research Article
Copyright
Copyright © Editorial Board of Nagoya Mathematical Journal 2007