Related papers: Computing polynomial conformal models for low-degr…
In this paper, we study complex analytic aspects of the moduli space $\Bcal_d^{fm}$ of degree $d\ge2$ fixed-point-marked Blaschke products. We define a complex structure on $\Bcal_d^{fm}$ and prove the simultaneous uniformization theorem…
We give a survey of results on zero distribution and factorization of analytic functions in the unit disc in classes defined by the growth of $\log|f(re^{i\theta})|$ in the uniform and integral metrics. We restrict ourself by the case of…
We consider the problem of reconstructing a function given its values on a set of points with finite density. We prove that with probability one, the values of an almost periodic function on a random array of points (with finite density)…
Let A be a matrix, c be any linear objective function and x be a fractional vector, say an LP solution to some discrete optimization problem. Then a recurring task in theoretical computer science (and in approximation algorithms in…
We consider maps between commutative groups and their functional degrees. These degrees are defined based on a simple idea -- the functional degree should decrease if a discrete derivative is taken. We show that the maps of finite…
We estimate the number of possible types degree patterns of $k$-lacunary polynomials of degree $t < p$ which split completely modulo $p$. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with…
It is be shown that the sequence of Bernstein polynomials for a function of several variables converges to this function uniformly along with every partial derivative of any order, provided that the latter derivative is well defined and…
Given a multivariate real (or complex) polynomial $p$ and a domain $\cal D$, we would like to decide whether an algorithm exists to evaluate $p(x)$ accurately for all $x \in {\cal D}$ using rounded real (or complex) arithmetic. Here…
We prove that the composition of two indestructible Blaschke products is again an indestructible Blaschke product. We also show that if an indestructible Blaschke product is the composition of two bounded analytic functions, then both…
We investigate asymptotic polynomial approximation for a class of weighted Bloch functions in the unit disc. Our main result is a structural theorem on asymptotic polynomial approximation in the unit disc, in the flavor of the classical…
Let $\mathbb{F}_p$ be the finite field of prime order $p$. For any function $f \colon \mathbb{F}_p{}^n \to \mathbb{F}_p$, there exists a unique polynomial over $\mathbb{F}_p$ having degree at most $p-1$ with respect to each variable which…
Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on…
We prove some new results about the spacing between neighboring zeros of paraorthogonal polynomials on the unit circle. Our methods also provide new proofs of some existing results. The main tool we will use is a formula for the phase of…
A classical result due to Blaschke states that for every analytic self-map $f$ of the open unit disk of the complex plane there exists a Blaschke product $B$ such that the zero sets of $f$ and $B$ agree. In this paper we show that there is…
Several conditions are known for a self-inversive polynomial that ascertain the location of its roots, and we present a framework for comparison of those conditions. We associate a parametric family of polynomials $p_\alpha$ to each such…
Numerical and theoretical aspects of conformal mappings from a disk to a circular-arc quadrilateral, symmetric with respect to the coordinate axes, are developed. The problem of relating the accessory parameters (prevertices together with…
We characterize the connected components of the subset $\cni$ of $H^\infty$ formed by the products $bh$, where $b$ is Carleson-Newman Blaschke product and $h\in H^\infty$ is an invertible function. We use this result to show that, except…
In this paper, we consider approximations of principal component projection (PCP) without explicitly computing principal components. This problem has been studied in several recent works. The main feature of existing approaches is viewing…
We study a family of polynomials in two variables having moduli up to bilipschitz equivalence: two distinct polynomials of this family are not bilipschitz equivalent. However any level curve of the first polynomial is bilipschitz equivalent…
The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…