The Entropic Discriminant
arXiv:1108.2925 · doi:10.1016/j.aim.2013.05.019
Abstract
The entropic discriminant is a non-negative polynomial associated to a matrix. It arises in contexts ranging from statistics and linear programming to singularity theory and algebraic geometry. It describes the complex branch locus of the polar map of a real hyperplane arrangement, and it vanishes when the equations defining the analytic center of a linear program have a complex double root. We study the geometry of the entropic discriminant, and we express its degree in terms of the characteristic polynomial of the underlying matroid. Singularities of reciprocal linear spaces play a key role. In the corank-one case, the entropic discriminant admits a sum of squares representation derived from the discriminant of a characteristic polynomial of a symmetric matrix.
24 pages, minor revisions
References in corpus (5)
Cited by in corpus (17)
- Likelihood Equations and Scattering Amplitudes
- Maximum entropy distributions on graphs
- Real Fibered Morphisms and Ulrich Sheaves
- The Chow form of a reciprocal linear space
- Modular decomposition of the Orlik-Terao algebra of a hyperplane arrangement
- Inverses of symmetric, diagonally dominant positive matrices and applications
- The Kazhdan-Lusztig polynomial of a matroid
- Flawlessness of -vectors of broken circuit complexes
- Reciprocal maximum likelihood degrees of diagonal linear concentration models
- Toric and tropical compactifications of hyperplane complements
- Positive Ulrich Sheaves
- Intersection cohomology of the symmetric reciprocal plane
- On the geometry of the set of symmetric matrices with repeated eigenvalues
- Hermitian matrices with a bounded number of eigenvalues
- Invariant theoretic characterization of subdiscriminants of matrices
- The Orlik-Terao algebra and the cohomology of configuration space
- Semi-inverted linear spaces and an analogue of the broken circuit complex