2000 character limit reached
Complete Nevanlinna-Pick kernels
Published 6 Oct 2016 in math.FA | (1610.01997v1)
Abstract: We give a new treatment of Quiggin's and McCullough's characterization of complete Nevanlinna-Pick kernels. We show that a kernel has the matrix-valued Nevanlinna-Pick property if and only if it has the vector-valued Nevanlinna-Pick property. We give a representation of all complete Nevanlinna-Pick kernels, and show that they are all restrictions of a universal complete Nevanlinna-Pick kernel.
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.
