arXiv (All)
open access
Majorization Inequalities from Logarithmic Convexity
Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Baudhāyana's Śulbasūtra and Euclid's Elements in the first millenium BCE, through classical results of Newton, Muirhead and Gantmacher,
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
- Enhancement technologies and inequality#100589
- New, Newer, and Newest Inequalities#1179820
- Optimal Shallow Circuits for Majority#1119102
- A special concavity property for positive Hessian quotient operators#927163
- The double descent and Runge phenomena in overparametrized polynomial interpolation#1141970
Record · ID 1076874
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