Completely Log-Concave Polynomials
summary
Defines completely log-concave polynomials as those positive on a convex cone whose every directional derivative (along cone directions) is log‑concave, and shows stability on the nonnegative orthant implies this property. Key consequences: closure under directional derivatives and initial forms; Newton polytope must be a generalized permutahedron with support filling all integer points; all matroid basis-generating polynomials (including the Fano) are included though not all are real stable. Gives a finite test by reducing to checking certain quadratics have one positive eigenvalue.
AI-written summary · about
chapters (13)
- 0:00Definitions and motivation
- 2:59Completely log-concave
- 4:54Examples and properties
- 8:21Relation to stability
- 10:21Symmetric polynomials
- 13:08Initial forms
- 16:32Newton polytopes
- 22:04Matroids and polynomials
- 26:04Generalized permutahedra
- 28:43Applications to algorithms
- 33:48Testing concavity
- 39:33Necessary conditions
- 45:20Future directions
related talks
27mNonnegative Polynomials, Nonconvex Polynomial Optimization, and Applications to Learning
01h 00mLog-concave Polynomials and Spectral Independence 2
01h 11m(Hidden) Symmetries of Computational Problems (continued)
54mNegative Dependence and Lorentzian Polynomials
01h 12mGeodesic Convexity and Optimization
01h 05mLog-concave Polynomials and Spectral Independence 1
57mHigh Dimensional Geometry and Concentration I
44mStructured Sparsity-Inducing Norms Through Submodular Functions
