Related papers: Four-point distortion theorem for complex polynomi…
A precise tie between a univariate spline's knots and its zeros abundance and dissemination is formulated. As an application, a conjecture formulated by De Concini and Procesi is shown to be true in the special univariate, unimodular case.…
We establish a discrepancy theorem for signed measures, with a given positive part, which are supported on an arbitrary convex curve. As a main application, we obtain a result concerning the distribution of zeros of polynomials orthogonal…
Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…
A number of sharp inequalities are proved for the space ${\mathcal P}\left(^2D\left(\frac{\pi}{4}\right)\right)$ of 2-homogeneous polynomials on ${\mathbb R}^2$ endowed with the supremum norm on the sector…
In the first five sections, we deal with the class of probability measures with asymptotically periodic Verblunsky coefficients of p-type bounded variation. The goal is to investigate the perturbation of the Verblunsky coefficients when we…
Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean…
We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…
We use modular invariance and crossing symmetry of conformal field theory to reveal approximate reflection symmetries in the spectral decompositions of the partition function in two dimensions in the limit of large central charge and of the…
The classical theory of the cross-ratio is a beautiful case study of the moduli of ordered points of the projective line and of invariants of the action of $PGL_2$. We generalize the theory of the cross-ratio to the setting of $S$-valued…
In this paper, we study the perturbation of the extreme singular values of a matrix in the particular case where it is obtained after appending an arbitrary column vector. Such results have many applications in bifurcation theory, signal…
Sequences of discrete random variables are studied whose probability generating functions are zero-free in a sector of the complex plane around the positive real axis. Sharp bounds on the cumulants of all orders are stated, leading to…
Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms of worst-case relative overestimation of the maximum…
A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…
In this paper, we shall present an interesting and significant refinement of a classical result of Cauchy about the moduli of the zeros of a quaternionic polynomial. As an application of this result we shall obtain zero-free regions of…
Suppose that $f: \bR^n\to\bR^n$ is a mapping of $K$-bounded $p$-mean distortion for some $p>n-1$. We prove the equivalence of the following properties of $f$: doubling condition for $J(x,f)$ over big balls centered at origin, boundedness of…
Using a lemma of Davis on Gram matrices applied to the classical Orthogonal Polynomials to generate reproducing kernel interpolation over the classical domains for polynomials. These kernels have terms which are exact over the rational…
The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be bounded from below in terms of the degree and the height…
We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…
In this paper, we show that for a unicritical polynomial having a priori bounds, the unique conformal measure of minimal exponent has no atom at the critical point. For a conformal measure of higher exponent, we give a necessary and…
We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…