Related papers: Estimations of zeros of a polynomial using numeric…

We consider the spectrum of a two-dimensional Pauli operator with a compactly supported electric potential and a variable magnetic field with a positive mean value. The rate of accumulation of eigenvalues to zero is described in terms of…

We prove an inequality for polynomials applied in a symmetric way to non-commuting operators.

By the help of power series f we can naturally construct another power series that has as coefficients the absolute values of the coefficients of f. Utilising these functions we prove some inequalities for the spectral radius of the bounded…

We prove some eigenvalue inequalities for positive semidefinite matrices partitioned into four blocks. The inradius of the numerical range of the off-diagonal block contributes to these estimates. Some related norm inequalities are given…

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.

We prove new upper bounds for the degrees in Hilbert's Nullstellensatz and for the Noether exponent of polynomial ideals in terms of the monomial structure of the polynomials involved. Our bounds improve the previously known bounds in the…

Several spectral radii formulas for infinite bounded nonnegative matrices in max algebra are obtained. We also prove some Perron-Frobenius type results for such matrices. In particular, we obtain results on block triangular forms, which are…

We establish an inequality of different metrics for algebraic polynomials.

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

We consider periodic Jacobi operators and obtain upper and lower estimates on the sizes of the spectral bands. Our proofs are based on estimates on the logarithmic capacities and connections between the Chebyshev polynomials and logarithmic…

Many applications, including rank aggregation, crowd-labeling, and graphon estimation, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and/or columns. We consider the problem of estimating…

Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…

Explicit expressions are given for the actions and radial matrix elements of basic radial observables on multi-dimensional spaces in a continuous sequence of orthonormal bases for unitary SU(1,1) irreps. Explicit expressions are also given…

Using classical results of Rogers bounding the $L^2$-norm of Siegel transforms, we give bounds on the heights of approximate integral solutions of quadratic equations and error terms in the quantiative Oppenheim theorem of…

The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…

For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…

We establish a version of the Pommerenke-Levin-Yoccoz inequality for the modulus of a polynomial-like restriction of a global polynomial and give two applications. First it is shown that if the modulus of a polynomial-like restriction of an…

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

The research on spectral inequalities for discrete Schrodinger Operators has proved fruitful in the last decade. Indeed, several authors analysed the operator's canonical relation to a tridiagonal Jacobi matrix operator. In this paper, we…