Related papers: Generalizations of Enestrom-Kakeya Type Theorems f…

This note revisits some majorization inequalities for eigenvalues, special attention is given to an elegant theorem of Hiroshima. An extension of the special case of Hiroshima's theorem is presented. Some discussion and open problems are…

The paper deals with different properties of polynomials in random elements: bounds for characteristics functionals of polynomials, stochastic generalization of the Vinogradov mean value theorem, characterization problem, bounds for…

We give formulae for first and second derivatives of generalized eigenvalues/eigenvectors of symmetric matrices and generalized singular values/singular vectors of rectangular matrices when the matrices are linear or nonlinear functions of…

Here we propose a way to construct generalized Kostka polynomials. Namely, we construct an equivariant filtration on tensor products of irreducible representations. Further, we discuss properties of the filtration and the adjoint graded…

In this paper we partially settle our conjecture from [1] (math.SP/0701143) on roots of eigenpolynomials for degenerate exactly-solvable operators. Namely, for any such operator, we establish a lower bound (which supports our conjecture)…

We develop a new eigenvalue method for solving structured polynomial equations over any field. The equations are defined on a projective algebraic variety which admits a rational parameterization by a Khovanskii basis, e.g., a Grassmannian…

The main purpose of this paper is to make Nakayama's theorem more accessible. We give a proof of Nakayama's theorem based on the negative definiteness of intersection matrices of exceptional curves. In this paper, we treat Nakayama's…

In this paper, we study the polynomial Gauss sums over finite fields, and present an analogue of Davenport-Hasse's theorem for the entire polynomial Gauss sums, which is a generalization of the previous result obtained by Hayes.

We translate inequalities and conjectures for immanants and generalized matrix functions into inequalities in the L\"owner order. These have the form of trace polynomials and generalize the inequalities from [FH, J. Math. Phys. 62 (2021),…

We discuss some extensions and refinements of the variance bounds for both real and complex numbers. The related bounds for the eigenvalues and spread of a matrix are also derived here.

In this paper, we construct explicitely polynomial automorphisms of affine n-space for certain n. More precisely, we construct algebraic subgroups of the general polynomial group GA_n(k) where k is an arbitrary base ring of characteristic…

Using the results on the $1/n$-expansion of the Verblunsky coefficients for a class of polynomials orthogonal on the unit circle with $n$ varying weight, we prove that the local eigenvalue statistic for unitary matrix models is independent…

A generalized eigenvector of a hypermatrix, called the universal (U-) eigenvector, is proposed, which extended the notion of diagonal (D-) eigenvectors in the literature. Using the semi-tensor product, the homogeneous U-eigenequation can be…

In this sequel to arxiv:arXiv:1012.0835 we develop Bezout type theorems for semidegrees (including an explicit formula for {\em iterated semidegrees}) and an inequality for subdegrees. In addition we prove (in case of surfaces) a Bernstein…

We prove a large deviations principle for the largest eigenvalue of Gaussian Kronecker matrices, namely matrices defined as the sum of tensors of independent Gaussian matrices in the regime where the dimension of the Gaussian matrices goes…

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…

We demonstrate lower bounds for the eigenvalues of compact Bakry-Emery manifolds with and without boundary. The lower bounds for the first eigenvalue rely on a generalised maximum principle which allows gradient estimates in the Riemannian…

We obtain a new bound in the uniform version of the Glasner property for matrices with polynomial entries, improving that of K. Bulinski and A. Fish (2021). This improvement is based on a more careful examination of complete rational…

The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…

We investigate the problem of determining the zeros of quaternionic polynomials using matrix method. In a recent paper, Dar et al. \cite{RD} proved that the zeros of a quaternionic polynomial and the left eigenvalues of the corresponding…