Related papers: Four-point distortion theorem for complex polynomi…
We study the problem of reconstructing a function on a manifold satisfying some mild conditions, given data on the values and some derivatives of the function at arbitrary points on the manifold. While the problem of finding a polynomial of…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
We consider the problem of sensitivity of threshold risk, defined as the probability of a function of a random variable falling below a specified threshold level $\delta >0.$ We demonstrate that for polynomial and rational functions of that…
We study the number of real critical points of a cyclotomic polynomial $\Phi_{n}(x)$, that is, the real roots of $\Phi_{n}^{\prime}(x)$. As usual, one can, without losing generality, restrict $n$ to be the product of distinct odd primes,…
Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…
We study the boundary of the cone of real polynomials that can be decomposed as a sum of squares (SOS) of real polynomials. This cone is included in the cone of nonnegative polynomials and both cones share a part of their boundary, which…
We utilize Cauchy's argument principle in combination with the Jacobian of a holomorphic function in several complex variables and the first moment of a ratio of two correlated complex normal random variables to prove explicit formulas for…
We prove an upper bound for pointwise rotation of mappings with $p$-exponentially integrable distortion. We also show that this bound is essentially optimal by providing examples which attain this rotation up to a constant multiplication.
We give a solution of the problem on trigonometric polynomials $f_n$ with the given leading harmonic $y\cos nt$ that deviate the least from zero in measure, more precisely, with respect to the functional $\mu(f_n)=mes\{t\in[0,2\pi]:…
We prove that zeros and critical points of a random polynomial $p_N$ of degree $N$ in one complex variable appear in pairs. More precisely, if $p_N$ is conditioned to have $p_N(\xi)=0$ for a fixed $\xi \in \C\backslash\set{0},$ we prove…
In this paper, we mainly investigate distortion and covering theorems on some classes of pluriharmonic mappings.
We study the minimal degrees and gonalities of curves on complete intersections. We prove a classical conjecture which asserts that the degree of any curve on a general complete intersection $X \subseteq \mathbb{P}^N$ cut out by polynomials…
We use the theory of self-similar groups to enumerate all combinatorial classes of non-exceptional quadratic Thurston maps with fewer than five postcritical points. The enumeration relies on our computation that the corresponding maps on…
We obtain a Central Limit Theorem for the normalized number of real roots of a square Kostlan-Shub-Smale random polynomial system of any size as the degree goes to infinity. A study of the asymptotic variance of the number of roots is…
Two-point functions related to the pion weak decay constant f_\pi are calculated from the generating functional of chiral perturbation theory in the mean-field approximation and the heavy-baryon limit. The aim is to demonstrate that Lorentz…
Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…
In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (\dmm), on the isolated roots of polynomial systems, specifically on the minimum distance between any two such roots. The bounds exploit the…
This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.
We examine the maximal number of zeros a polynomial of degree at most n with constrained coefficients may have at 1. Our results are essentially sharp and extend earlier results of this variety. An interesting connection to certain…
In this paper we relate the location of the complex zeros of the reliability polynomial to parameters at which a certain family of rational functions derived from the reliability polynomial exhibits chaotic behaviour. We use this connection…