Related papers: Pade interpolation by F-polynomials and transfinit…
The Kac polynomial $$f_n(x) = \sum_{i=0}^{n} \xi_i x^i$$ with independent coefficients of variance 1 is one of the most studied models of random polynomials. It is well-known that the empirical measure of the roots converges to the uniform…
We establish effective bounds on the number of periodic points of degree-$d$ polynomials $\phi$ defined over $p$-adic fields and number fields, under a mild reduction hypothesis that is satisfied by all unicritical polynomials $X^d + c$…
In this paper, we provide an efficient method for computing the Taylor coefficients of $1-p_n f$, where $p_n$ denotes the optimal polynomial approximant of degree $n$ to $1/f$ in a Hilbert space $H^2_\omega$ of analytic functions over the…
A set of orthogonal polynomials on the unit disk $B(0,1)$ known as Zernike polynomials are commonly used in the analysis and evaluation of optical systems. Here Zernike polynomials are used to construct wavelets for polynomial subspaces of…
We identify all uniform limits of polynomials on the closed unit disc with respect to the chordal metric \c{hi} . One such limit is f=oo. The other limits are holomorphic functions f:-->C so that for every {\zeta} in the boundary of unit…
If L is a complete ortholattice, f any partial function from L^n to L, then there is a complete ortholattice L* containing L as a subortholattice, and an ortholattice polynomial with coefficients in L* which represents f on L^n. Iterating…
We study partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained…
Given a finite number of samples of a continuous set-valued function F, mapping an interval to compact subsets of the real line, we develop good approximations of F, which can be computed efficiently.
The influence of low-spatial frequency errors of an optical component of an imaging system on the point spread function can be quantified using Zernike polynomials. High-spatial frequency errors cause strong scattering due to which the…
The aim of this article is to present a time-frequency theory for orthogonal polynomials on the interval [-1,1] that runs parallel to the time-frequency analysis of bandlimited functions developed by Landau, Pollak and Slepian. For this…
We give the connections among the Fekete sets, the zeros of orthogonal polynomials, $1(w)$-normal point systems, and the nodes of a stable and most economical interpolatory process via the Fej\'er contants. Finally the convergence of a…
We study the dimensional continuation of the sphere free energy in conformal field theories. In continuous dimension $d$ we define the quantity $\tilde F=\sin (\pi d/2)\log Z$, where $Z$ is the path integral of the Euclidean CFT on the…
We study Chebyshev constants and transfinite diameter on the graph of a polynomial mapping $f\colon\mathbb{C}^2\to\mathbb{C}^2$. We show that two transfinite diameters of a compact subset of the graph (i.e., defined with respect to two…
In this paper, we propose two new deterministic interpolation algorithms for a sparse multivariate polynomial given as a standard black-box by introducing new Kronecker type substitutions. Let $f\in \RB[x_1,\dots,x_n]$ be a sparse black-box…
Motivated by recent interest in permutation arrays, we introduce and investigate the more general concept of frequency permutation arrays (FPAs). An FPA of length n=m lambda and distance d is a set T of multipermutations on a multiset of m…
We study the footprint function, with respect to a monomial order, of complete intersection graded ideals in a polynomial ring with coefficients in a field. For graded ideals of dimension one, whose initial ideal is a complete intersection,…
In this paper, we construct the supersymmetric spinning polynomials. These are orthogonal polynomials that serve as an expansion basis for the residue or discontinuity of four-point scattering amplitudes, respecting four-dimensional super…
Consider a sparse multivariate polynomial f with integer coefficients. Assume that f is represented as a "modular black box polynomial", e.g. via an algorithm to evaluate f at arbitrary integer points, modulo arbitrary positive integers.…
In this paper, we study the problem of interpolating a continuous function at $(n+1)$ equally-spaced points in the interval $[0,1]$, using shifts of a kernel on the $(1/n)$-spaced infinite grid. The archetypal example here is approximation…
The paper concerns the uniform polynomial approximation of a function $f$, continuous on the unit Euclidean sphere of ${\mathbb R}^3$ and known only at a finite number of points that are somehow uniformly distributed on the sphere. First we…