pith. sign in

arxiv: 1606.07248 · v3 · pith:RNKJNRH6new · submitted 2016-06-23 · 🧮 math.FA

The Carath\'eodory-Fej\'er interpolation problem for the polydisc

classification 🧮 math.FA
keywords theoremalgorithmcarathinterpolationpolydiscproblemsolutionapparent
0
0 comments X
read the original abstract

We give an algorithm for finding a solution to the Carath\'{e}odory-Fej\'{e}r interpolation problem on the polydisc $\mathbb D^n,$ whenever it exists. A necessary condition for the existence of a solution becomes apparent from this algorithm. A generalization of the well-known theorem due to Nehari has been obtained. A proof of the Kor\'{a}nyi--Puk\'{a}nszky theorem is given using the spectral theorem.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.