Hostname: page-component-74656f9884-8r8nv Total loading time: 0 Render date: 2026-11-09T08:36:31.370Z Has data issue: false hasContentIssue false

Primeable entire functions

Published online by Cambridge University Press:  22 January 2016

Fred Gross
Affiliation:
Mathematics Research Center, Naval Research Laboratory, and University of Maryland, Baltimore County.
Chung-Chun Yang
Affiliation:
Mathematics Research Center, Naval Research Laboratory.
Charles Osgood
Affiliation:
Mathematics Research Center, Naval Research Laboratory.
Rights & Permissions [Opens in a new window]

Extract

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.

An entire function F(z) = f(g(z)) is said to have f(z) and g(z) as left and right factors respe2tively, provided that f(z) is meromorphic and g(z) is entire (g may be meromorphic when f is rational). F(z) is said to be prime (pseudo-prime) if every factorization of the above form implies that one of the functions f and g is bilinear (a rational function). F is said to be E-prime (E-pseudo prime) if every factorization of the above form into entire factors implies that one of the functions f and g is linear (a polynomial). We recall here that an entire non-periodic function f is prime if and only if it is E-prime [5]. This fact will be useful in the sequel.

Information

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