← 研踪 PaperTrailarXiv:2610.04874 · v2
When the noncommutative AM-GM inequality holds
首次提交 2026-10-04 10:22
版本更新 2026-11-18 05:25
雷达观测 2026-11-19 19:08
摘要
In this note, we prove that the noncommutative AM-GM inequality holds if . The motivation comes from counterexamples constructed in [De Sa, Random reshuffling is not always better, NeurIPS2020]. The proof constructs a vertex measure based on the Chebyshev nodes on the Boolean cube to extract the distinct indices. The main difficulty is that the measure is not positive on non-integer nodes. The key technique comes from [Grigoriev, Complexity of Positivstellensatz proofs for the knapsack, Computational Complexity (2001)] and eventually transforms the problem into a quadrature estimate.
作者备注:typo fixed
期刊信息:Frontiers in Applied Mathematics 2, 25-48, 2026
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-18 05:25 · 最新观测版本
When the noncommutative AM-GM inequality holds
In this note, we prove that the noncommutative AM-GM inequality holds if . The motivation comes from counterexamples constructed in [De Sa, Random reshuffling is not always better, NeurIPS2020]. The proof constructs a vertex measure based on the Chebyshev nodes on the Boolean cube to extract the distinct indices. The main difficulty is that the measure is not positive on non-integer nodes. The key technique comes from [Grigoriev, Complexity of Positivstellensatz proofs for the knapsack, Computational Complexity (2001)] and eventually transforms the problem into a quadrature estimate.
查看此版本解读 →查看此版本原文 ↗