A determinantal lower bound

From MaRDI portal





While lower bounds on the determinant of special classes of matrices are known, the principal impact of the authors main theorem may lie in its generality: NEWLINENEWLINENEWLINETheorem: Let \(A\) be any complex invertible \(n\times n\) matrix, and \(\ell,u,\kappa \) be positive reals so that \([\ell, u]\) contains the moduli of the eigenvalues of \(A,\) \(|\text{tr}(A)|\geq n\ell,\) and \(\kappa=(nu-|\text{tr}(A)|)/(u-\ell).\) Then \(|\det(A)|\geq \ell^\kappa u^{n-\kappa}.\) NEWLINENEWLINENEWLINEAn interesting linear programming proof for a slightly weaker result is also given. The theorem's corollaries include also determinantal upper bounds; its applications, proofs for limit formulae for irrational numbers, and approximation formulae for roots of complex polynomials, to be published in detail by the first author.











This page was built for publication: A determinantal lower bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932208)