An algorithm for finding low degree rational solutions to the Schur coefficient problem
Abstract
We present an algorithm producing all rational functions f with prescribed n+1 Taylor coefficients at the origin and such that \|f\|∞ 1 and f k for every fixed k n. The case where k<n is also discussed.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.