2000 character limit reached
Nevanlinna-Pick problem and uniqueness of left inverses in convex domains, symmetrized bidisc and tetrablock
Published 3 Mar 2013 in math.CV and math.FA | (1303.0482v2)
Abstract: In the paper we discuss the problem of uniqueness of left inverses (solutions of two point Nevanlinna-Pick problem) in bounded convex domains, strongly linearly convex domains, the symmetrized bidisc and the tetrablock.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.