The Van der Waerden conjecture for mixed discriminants
From MaRDI portal
Publication:818049
DOI10.1016/j.aim.2004.12.002zbMath1093.15011arXivmath/0406420OpenAlexW2054615143WikidataQ123110159 ScholiaQ123110159MaRDI QIDQ818049
Publication date: 24 March 2006
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0406420
Hermitian matricesmixed volumedeterminantpermanentconvex analysisdoubly stochastic matricesmixed discriminantAlexandrov-Fechel inequalitysemidefinite complex matricesVan der Waerden conjecture
Determinants, permanents, traces, other special matrix functions (15A15) Hermitian, skew-Hermitian, and related matrices (15B57) Stochastic matrices (15B51)
Related Items
Concentration of the mixed discriminant of well-conditioned matrices, Improved bounds in Weaver and Feichtinger conjectures, Derivatives for antisymmetric tensor powers and perturbation bounds, An approximation algorithm for counting contingency tables, Enumerating Contingency Tables via Random Permanents, Higher order derivatives and perturbation bounds for determinants, A new series of conjectures and open questions in optimization and matrix analysis, A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor, Bézout-Type Inequality in Convex Geometry, Tensor slice rank and Cayley's first hyperdeterminant, Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed discriminants of positive semidefinite matrices
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- The solution of van der Waerden's problem for permanents
- Geometric algorithms and combinatorial optimization
- A lower bound for the permanent of a doubly stochastic matrix
- A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary
- Some notes on the van der Waerden conjecture
- A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement
- Permanents
- Convex Analysis