Lorentzian entropy, subgaussian matrix concentration, and sharp functional inequalities for all matroids
math.CO, math.PR, quant-ph
Submitted: 2026-10-31
Updated: 2026-10-31
Terminology
Sources
- Matrix concentration inequalities for dependent binary random variables
- Entropic Independence I: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Distributions and High-Temperature Ising Models
- Log-Concave Polynomials II: High-Dimensional Walks and an FPRAS for Counting Bases of a Matroid
- Log-Concave Polynomials III: Mason's Ultra-Log-Concavity Conjecture for Independent Sets of Matroids
- Log-Concave Polynomials I: Entropy and a Deterministic Approximation Algorithm for Counting Bases of Matroids
- Birkhoff's polytope and unistochastic matrices, N=3 and N=4
- Quantum Brascamp-Lieb Dualities
- The Lee-Yang and P'olya-Schur Programs. I. Linear Operators Preserving Stability
- Obstructions to determinantal representability
- Lorentzian polynomials
- Homogeneous multivariate polynomials with the half-plane property
- Modified log-Sobolev inequalities for strongly log-concave distributions
- Quantum concentration inequalities
- An introduction to multivariate Krawtchouk polynomials and their applications
- On a biased edge isoperimetric inequality for the discrete cube
- Fisher Information and Logarithmic Sobolev Inequality for Matrix Valued Functions
- Scalar Poincar'e Implies Matrix Poincar'e
- Pipage Rounding, Pessimistic Estimators and Matrix Concentration
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- Scalar and Matrix Chernoff Bounds from $\ell_{\infty}$-Independence
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality