arXiv (All)
open access
Finite Free Information Inequalities
We develop finite free information theory for real-rooted polynomials, establishing finite free analogues of entropy and Fisher information monotonicity, as well as the Stam and entropy power inequalities. These results resolve conjectures by Shlyakhtenko and Gribinski and recover inequalities in fr
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Another Argument Towards Inequivivalence of Complexity Classes#104881
- Entropy Maximization and Weak Gibbsianity of Quasi-Free Fermionic States#652233
- Entropy Maximization and Weak Gibbsianity of Quasi-Free Fermionic States#650780
- A constructive violation of additivity of minimum output von Neumann entropy#1050135
- A Frame-Spread Lower Bound for Quantum Entropy Estimation under Fixed Rank-One Measurements#1154893
Record · ID 1014613
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive