Related papers: Estimations of zeros of a polynomial using numeric…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
We present a new technique to obtain polynomial decay estimates for the matrix coefficients of unitary operators. Our approach, based on commutator methods, applies to nets of unitary operators, unitary representations of topological…
We study various inequalities for numerical radius and Berezin number of a bounded linear operator on a Hilbert space. It is proved that the numerical radius of a pure two-isometry is 1 and the Crawford number of a pure two-isometry is 0.…
We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…
We develop a new refinement of the Kato's inequality and using this refinement we obtain several upper bounds for the numerical radius of a bounded linear operator as well as the product of operators, which improve the well known existing…
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…
In this work, we are dealing with some properties relating the zeros of a polynomial and its Mahler measure. We provide estimates on the number of real zeros of a polynomial, lower bounds on the distance between the zeros of a polynomial…
The paper considers bounded linear radial operators on the polyanalytic Fock spaces $\mathcal{F}_n$ and on the true-polyanalytic Fock spaces $\mathcal{F}_{(n)}$. The orthonormal basis of normalized complex Hermite polynomials plays a…
The aim of this paper is to prove a uniform Fourier restriction estimate for certain $2-$dimensional surfaces in $\mathbb R^{2n}$. These surfaces are the image of complex polynomial curves $\gamma(z) = (p_1(z), \dots, p_n(z))$, equipped…
We prove optimal sparsity oracle inequalities for the estimation of covariance matrix under the Frobenius norm. In particular we explore various sparsity structures on the underlying matrix.
Some new Frobenius norm bounds of the unique solution to certain structured Sylvester equation are derived. Based on the derived norm upper bounds, new multiplicative perturbation bounds are provided both for subunitary polar factors and…
Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…
Solutions to optimization problems involving the numerical radius often belong to a special class: the set of matrices having field of values a disk centered at the origin. After illustrating this phenomenon with some examples, we…
In this article we study the limiting empirical measure of zeros of higher derivatives for sequences of random polynomials. We show that these measures agree with the limiting empirical measure of zeros of corresponding random polynomials.…
Motivated by problems arising in random sampling of trigonometric polynomials, we derive exponential inequalities for the operator norm of the difference between the sample second moment matrix $n^{-1}U^*U$ and its expectation where $U$ is…
Let $\mu_\alpha$ be the Lebesgue plane measure on the unit disk with the radial weight $\frac{\alpha+1}{\pi}(1-|z|^2)^\alpha$. Denote by $\mathcal{A}^{2}_{n}$ the space of the $n$-analytic functions on the unit disk, square-integrable with…
This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…
This article has two interpenetrating motifs. One is an exposition of some major ideas and techniques behind the use of block matrices, and especially their positivity properties. This is done by focussing on one major problem:…
In [Jalowy, Kabluchko, Marynych, arXiv:2504.11593v1, 2025], the authors discuss a user-friendly approach to determine the limiting empirical zero distribution of a sequence of real-rooted polynomials, as the degree goes to $\infty$. In this…
We discuss and compare upper and lower bounds obtained by two different methods for the positive zero of the ultraspherical polynomial $C_{n}^{(\lambda)}$ that is greater than $1$ when $-3/2 < \lambda < -1/2.$ Our first approach uses mixed…