Related papers: Improved Cauchy radius for scalar and matrix polyn…

We derive inclusion regions for the eigenvalues of matrix polynomials expressed in a general polynomial basis, which can lead to significantly better results than traditional bounds. We present several applications to engineering problems.

In this paper we investigate bounds for the zeros of a bicomplex polynomial using matrix method. In particular, we find analogue of Gershgorin disk theorem, Cauchy Theorem, theorem of Fujiwara, Walsh and other theorems concerning to zeros…

In this paper, we obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral…

In this paper, we derive new bounds for the zeros of quaternionic polynomials by applying localization theorems, which includes Gershgorin-type theorems for the left eigenvalues of matrices of left monic quaternionic polynomials. These…

In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix. We also apply these bounds to various matrices associated with a graph or a digraph, obtain some new results or known…

We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…

We give a new bound on the number of collinear triples for two arbitrary subsets of a finite field. This improves on existing results which rely on the Cauchy inequality. We then us this to provide a new bound on trilinear and quadrilinear…

Locating the zeros of quaternionic polynomials is a fundamental problem with significant implications across scientific and engineering disciplines, yet the noncommutative nature of quaternion multiplication makes it fundamentally more…

We give upper and lower bounds for the spectral radius of a nonnegative matrix by using its average 2-row sums, and characterize the equality cases if the matrix is irreducible. We also apply these bounds to various nonnegative matrices…

In this paper, we give estimates for both upper and lower bounds of eigenvalues of a simple matrix. The estimates are shaper than the known results.

We improve upon the upper bounds for the cardinality of the value set of a multivariable polynomial map over a finite field using the polytope of the polynomial. This generalizes earlier bounds only dependent on the degree of a polynomial.

We obtain upper bounds for the numerical radius of a product of Hilbert space operators which improve on the existing upper bounds. We generalize the numerical radius inequalities of $n\times n$ operator matrices by using non-negative…

In this work we present some results that allow to improve the decoding radius in solving polynomial linear systems with errors in the scenario where errors are additive and randomly distributed over a finite field. The decoding radius…

In this paper we obtain some refinements of a well-known result of Enestr\"o-Kakeya concerning the bounds for the moduli of the zeros of polynomials with complex coefficients which improve upon some results due to Aziz and Mohammad, Govil…

In this paper, we aim to establish a range of numerical radius inequalities. These discoveries will bring us to a recently validated numerical radius inequality and will present numerical radius inequalities that exhibit enhanced precision…

We study the duality of moduli of k- and (n-k)-dimensional slices of euclidean n-cubes, and establish the optimal upper bound 1.

The Sz\'asz inequality is a classical result that provides a bound for polynomials with zeros in the upper half of the complex plane, expressed in terms of their low-order coefficients. Generalizations of this result to polynomials in…

We estimate the Castelnuovo-Mumford regularity of ideals in a polynomial ring over a field by studying the regularity of certain modules generated in degree zero and with linear relations. In dimension one, this process gives a new type of…

For the Schur polynomials bounded and unbounded generalizations of the Cauchy identities are found.

We define the rectangular additive convolution of polynomials with nonnegative real roots as a generalization of the asymmetric additive convolution introduced by Marcus, Spielman and Srivastava. We then prove a sliding bound on the largest…