Please use this identifier to cite or link to this item: http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/9918
Title: Distinguished varieties and the Nevanlinna–Pick problem on the symmetrized bidisk
Authors: Das, B. Krishna
Kumar, Poornendu
SAU, HARIPADA
Dept. of Mathematics
Keywords: Nevanlinna–Pick Interpolation
Uniqueness Varieties
Distinguished Varieties
Realization Formulae
Reproducing Kernels
Admissible Kernels
Inner Functions
2025-MAY-WEEK2
TOC-MAY-2025
2025
Issue Date: Jul-2025
Publisher: Springer Nature
Citation: Mathematische Zeitschrift, 310(03).
Abstract: We study the uniqueness of the solutions of a solvable Pick interpolation problem in the symmetrized bidisk. The uniqueness set is the largest set in where all the solutions to a solvable Pick problem coincide. There is a canonical construction of an algebraic variety, which coincides with the uniqueness set in . The algebraic variety is called the uniqueness variety. A solvable Pick problem is called extremal if it has no solutions of supremum norm (over ) less than one. We show that if an N-point extremal Pick problem is such that none of the -point sub-problems is extremal, then the uniqueness variety contains a distinguished variety that contains all the initial nodes. Here, a distinguished variety is an algebraic variety that intersects the domain and exits through its distinguished boundary. The proof of the first main result requires a thorough understanding of distinguished varieties. Indeed, this article is as much a study of the Nevanlinna-Pick interpolation problem as it is about distinguished varieties. We obtain complete algebraic and geometric characterizations of distinguished varieties solving an unsettled problem left open by Pal and Shalit, J. Funct. Anal. 2014.
URI: https://doi.org/10.1007/s00209-025-03740-8
http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/9918
ISSN: 0025-5874
1432-1823
Appears in Collections:JOURNAL ARTICLES

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.