Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Hilbert function spaces and the Nevanlinna-Pick problem on the polydisc (1104.2533v2)

Published 13 Apr 2011 in math.FA and math.CV

Abstract: In the paper `Distinguished Varieties,' Agler and McCarthy used Hilbert function spaces to study the uniqueness properties of the Nevanlinna-Pick problem on the bidisc. In this work we give a geometric procedure for constructing a Nevanlinna-Pick problems on Dn with a specified set of uniqueness. On the way to establishing this procedure, we prove a result about Hilbert function spaces and partially answer a question posed by Agler and McCarthy.

Summary

We haven't generated a summary for this paper yet.