The generalized order and the generalized type of an entire function in terms of the best approximation
Mykhaylo Z. Dveyrin, Antonina S. Levadnaya

TL;DR
This paper investigates how the generalized order and type of entire functions relate to the speed of their best polynomial approximations in the unit disk, extending previous mathematical results.
Contribution
It establishes new relations linking generalized order and type of entire functions to their best approximation sequences, generalizing prior work.
Findings
Derived formulas connecting generalized order and type with approximation speed
Extended previous results by Reddy, Sato, Ibragimov, and others
Provided a theoretical framework for analyzing entire functions via approximation
Abstract
The paper explores connection between the generalized order and the generalized type of an entire function and the speed of the best polynomial approximation in the unit disk. The relations which define the generalized order and the generalized type of an entire function through the sequence of its best approximations, have been found. The results were obtained by generalization previous results of A.R. Reddy, D. Sato, I.I. Ibragimov and N. I. Shyhaliev, S. B. Vakarchyk, R. Mamadov.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScientific Research and Studies · Meromorphic and Entire Functions
