2000 character limit reached
Hilbert function spaces and the Nevanlinna-Pick problem on the polydisc II
Published 21 Feb 2013 in math.CV and math.FA | (1302.5406v1)
Abstract: In \cite{ds_hfs}, a geometric procedure for constructing a Nevanlinna-Pick problem on $\Dn$ with a specified set of uniqueness was established. In this sequel we conjecture a necessary and a sufficient condition for a Nevanlinna-Pick problem on $\DT$ to have a unique solution. We use the results of \cite{ds_hfs} and Bezout's theorem to establish three special cases of this conjecture.
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.