Concentration of the mixed discriminant of well-conditioned matrices
Abstract
We call an n-tuple Q1, ..., Qn of positive definite nxn matrices alpha-conditioned for some alpha > 1 if the ratio of the largest among the eigenvalues of Q1, ..., Qn to the smallest among the eigenvalues of Q1, ..., Qn does not exceed alpha. An n-tuple is called doubly stochastic if the sum of Qi is the identity matrix and the trace of each Qi is 1. We prove that for any fixed alpha > 1 the mixed discriminant of an alpha-conditioned doubly stochastic n-tuple is nO(1) e-n. As a corollary, for any alpha > 1 fixed in advance, we obtain a polynomial time algorithm approximating the mixed discriminant of an alpha-conditioned n-tuple within a polynomial in n factor.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.