Solvability of the Nevanlinna-Pick interpolation problem

doi:10.4213/sm9826e

Viktor Ivanovich Buslaev

Solvability of the Nevanlinna-Pick interpolation problem

Algebra and Number Theory

A solvability theorem is proved for the Nevanlinna-Pick interpolation problem. Its extreme cases are Carathéodory's and Sсhur's criteria on the one hand (when all interpolation points coincide) and the Krein-Rekhtman theorem on the other (when the interpolation points are pairwise distinct). Bibliography: 19 titles.

Need a simple solution for managing your BibTeX entries? Explore CiteDrive!

Web-based, modern reference management
Collaborate and share with fellow researchers
Integration with Overleaf
Comprehensive BibTeX/BibLaTeX support
Save articles and websites directly from your browser
Search for new articles from a database of tens of millions of references

Try out CiteDrive

Solvability of the Nevanlinna-Pick interpolation problem

Need a simple solution for managing your BibTeX entries? Explore CiteDrive!

More from our Archive

Modified Two-Parameter Liu Estimator for Addressing Multicollinearity in the Poisson Regression Model

Homology of transitive digraphs and discrete spaces

A remark on 0-cycles as modules over algebras of finite correspondences

Solvability of the Nevanlinna-Pick interpolation problem

Knot as a complete invariant of a Morse-Smale 3-diffeomorphism with four fixed points

Explicit deformation of the horospherical variety of type $\mathrm{G}_2$

Existence of polynomial solutions of degree 4 of the Monge-Ampère equation. Large deflections of thin plates

On the weighted Bojanov-Chebyshev problem and the sum of translates method of Fenton

Symmetric matrices and maximal Nijenhuis pencils

Special Issue “Optimisation Models and Applications”