Rational Functions with Fixed Poles

• Rational functions with fixed poles are meromorphic functions defined by preset pole locations and orders, offering structured insights into cyclotomic arithmetic and interpolation theory.
• They enable sharp Bernstein-Markov and Chebyshev-type inequalities, yielding optimal derivative bounds and best uniform approximations through precise analytic techniques.
• Their applications span coding theory, error-correcting algorithms, and system interpolation, where fixed-pole constraints facilitate robust signal processing and decoding methods.

A rational function with fixed poles is a meromorphic function on the complex plane (or on a domain in a field or over a finite field) whose polar divisor is prescribed: the locations and orders of the poles are specified a priori and do not vary within the function class. This constraint leads to a rich array of analytic, arithmetic, geometric, and algorithmic structures that sharply distinguish fixed-pole rational functions from their pole-free or variable-pole counterparts. Research on arXiv in the past decade has elucidated the central role of fixed-pole rational functions in approximation theory, coding theory, interpolation, potential theory, and arithmetic geometry.

1. Structural Theory and Classification: Arithmetic and Cyclotomic Aspects

Fixed-pole rational functions are often classified according to pole locations and residue data. In the arithmetic context, particularly for generating functions of specialized combinatorial or arithmetic sequences, the class of rational $s$-functions (as defined after Schwarz–Vologodsky–Walcher) constrains the residue and pole data to root-of-unity configurations whenever the sequence coefficients satisfy higher-order supercongruence relations. Müller proved for $s=2$ that any such rational 2-function,

$F(z) = \frac{P(z)}{Q(z)} \in K(z),$

whose Maclaurin expansion defines a 2-sequence with suitable $p$-adic and Frobenius congruence properties, must have all poles simple and situated at roots of unity, and all residues rational. Explicitly,

$$F(z) = \sum_{\zeta^N=1} \frac{r_{\zeta}}{1 - z/\zeta}, \quad r_\zeta \in \mathbb{Q},$$

and the coefficient sequence

$a_n = \sum_{\zeta^N=1} r_{\zeta} \zeta^{-n}$

lies in $\mathbb{Q}(\zeta_N)$, an abelian extension of $\mathbb{Q}$ (Müller, 2020). This cyclotomic rigidity is the sharpest form of the link between fixed-pole rationality and abelian number fields for such functions.

2. Inequalities and Extremal Properties: Bernstein-Markov Theory with Prescribed Poles

The classical theory for polynomials—Bernstein, Lax, Malik, and Markov type derivative inequalities—has been systematically generalized to rational functions with arbitrary but fixed poles. In particular, given a set of prescribed poles $\{a_j\}$ outside a compact region (e.g., outside the unit disk), and defining

$w(z) = \prod_{j=1}^n (z-a_j),$

the space $s=2$0 of functions $s=2$1 with $s=2$2, sharp sup-norm derivative bounds can be established: $s=2$3 where $s=2$4 is the associated finite Blaschke product. If zeros are further restricted, stronger inequalities hold, such as

$s=2$5

New refined inequalities incorporate positional zero restrictions and parameterized balance terms, achieving exact sharpness for extremal functions of explicit form (Rather et al., 1 Feb 2026).

Further, for rational functions with fixed poles on smooth Jordan curves and arcs, sharp Bernstein- and Markov-type inequalities have been derived in terms of the normal derivatives of the Green's function at the pole locations. For a $s=2$6 smooth Jordan curve $s=2$7 with prescribed poles $s=2$8,

$s=2$9

with sharpness in the limit as $F(z) = \frac{P(z)}{Q(z)} \in K(z),$0 (Kalmykov et al., 2016).

3. Interpolation, Lebesgue Constants, and Convergence

In the setting of Lagrange interpolation by rational functions with fixed poles, the choice of interpolation nodes and distribution of poles critically influence interpolation stability and convergence. For rational functions of the form

$F(z) = \frac{P(z)}{Q(z)} \in K(z),$1

with prescribed pole matrix $F(z) = \frac{P(z)}{Q(z)} \in K(z),$2 inside the unit disk, and for nodes on a union of finite intervals, Lebesgue constants $F(z) = \frac{P(z)}{Q(z)} \in K(z),$3 exhibit classical $F(z) = \frac{P(z)}{Q(z)} \in K(z),$4 growth under mild regularity conditions—even when pole sequences have finite accumulations within the interpolation region: $F(z) = \frac{P(z)}{Q(z)} \in K(z),$5 where $F(z) = \frac{P(z)}{Q(z)} \in K(z),$6 is a weighted sum of harmonic measures reflecting pole proximity. Key to the proofs is a rational analogue of the inverse polynomial image method, which enables multi-interval constructions and extension to cases with accumulation at finite sets inside the interpolation intervals (Kalmykov et al., 2022).

4. Approximation Theory: Rational Chebyshev Systems and Best Uniform Approximations

Best uniform approximation of functions by rational functions with fixed poles presents a Chebyshev-system structure. Notably, approximation of $F(z) = \frac{P(z)}{Q(z)} \in K(z),$7 on two symmetric intervals by odd rational functions with prescribed poles (e.g., at $F(z) = \frac{P(z)}{Q(z)} \in K(z),$8 and $F(z) = \frac{P(z)}{Q(z)} \in K(z),$9) is solved explicitly via conformal mappings onto specific comb-type domains, producing an extremal function

$p$0

with the minimal error decaying as

$p$1

for $p$2. The fixed pole constraint slows the convergence rate compared to unconstrained rational approximation, a direct reflection of the rigidity imposed by the prescribed pole structure (Lukashov et al., 2014). In Bergman kernel approximation on the unit circle, the unique best approximant in $p$3 and weighted $p$4 is efficiently constructed via the orthonormal Takenaka–Malmquist basis indexed by fixed pole sequences, and the approximation error is given explicitly in terms of Blaschke products of the pole sequence (Chaichenko, 2017).

5. Applications in Error-Correcting Codes and Positive Real Interpolation

In contemporary coding theory, simultaneous rational function codes with prescribed poles have advanced the understanding of list decoding and unique decoding beyond classical bounds. Given evaluation multiplicities and a fixed choice of zeros of denominators (fixed poles) over finite fields, the multi-precision encoding and corresponding decoding algorithms make use of shifted-Laurent expansions at each pole. The minimum distance is governed by the sum of multiplicities minus the degree bounds, and the high-probability decoding radius can be pushed beyond half the minimum distance while retaining exponential decay of the decoding failure probability in $p$5-interleaved settings. Critically, the impact of fixed poles on decoding complexity is minimal; only mild increase in failure probability occurs, and computational complexity remains dominated by polynomial-matrix reduction akin to the pole-free case (Abbondati et al., 7 Aug 2025).

In the field of interpolation and realization theory, the convex geometry of generalized positive rational functions (generalized positive-real functions) is stratified via fixed-pole cones: $p$6 where $p$7 encodes the pole-zero template. Each fixed-pole cone in the right half-plane forms a maximal invariant convex cone inside the class of all generalized positive functions with the prescribed pole-zero configuration. Classical Nevanlinna–Pick interpolation, in this context, reduces to a two-step process: division by the template to reduce to positive-real interpolation, and classical Pick matrix solvability for the internal parameter $p$8. This geometric organization is critical for parametrization, realization, and system-theoretic interpretations (Alpay et al., 2010).

6. Theoretical Implications and Future Research Directions

Fixed-pole rational functions serve as a bridge between algebraic, analytic, and algorithmic disciplines. Their pole-residue structure encodes significant arithmetic (cyclotomic and abelian extension) content in special settings. In analysis, fixed-pole contexts enable the sharpest possible control of extremal constants in inequalities, and are the backbone of approximation-theoretic constructions with Chebyshev alternation, conformal mapping, and potential theory. In applied algebra and signal processing, they are indispensable in the parametrization and solution of interpolation problems with prescribed singularities and loci of positivity.

Current directions emphasize robustness against pole accumulation in interpolation and approximation, extensions of extremal and probabilistic decoding bounds in rational codes, and new partitionings of positivity classes in system theory by fixed-pole data. The rigidity, sharpness, and universality of fixed-pole structures constitute a focal point of ongoing research in applied and theoretical mathematics.