Metraipolis › archive › dc_2c5d40dd5ecb

A Graph-Theoretic Approach to Matrix AM-GM: Counterexamples and Sharp Exponential Bounds — arXiv:2611.07649

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.07649
License (as archived)
CC0-1.0
Archived
2026-11-06T14:51:59.267Z
SHA-256 of the archived text
b486a4a9889bd336d1c2b41981efa22141525e9d844668c5818cd8dda2b53096
Stable URL of this page
https://metraipolis.com/documento/dc_2c5d40dd5ecb

How to cite

A Graph-Theoretic Approach to Matrix AM-GM: Counterexamples and Sharp Exponential Bounds — arXiv:2611.07649 — arXiv (en), https://arxiv.org/abs/2611.07649 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2c5d40dd5ecb (Metraipolis archive dc_2c5d40dd5ecb, sha256 b486a4a9889bd336d1c2b41981efa22141525e9d844668c5818cd8dda2b53096)
BibTeX
@misc{dc2c5d40dd5ecb,
  title = {A Graph-Theoretic Approach to Matrix AM-GM: Counterexamples and Sharp Exponential Bounds — arXiv:2611.07649},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.07649},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2c5d40dd5ecb; sha256 b486a4a9889bd336d1c2b41981efa22141525e9d844668c5818cd8dda2b53096},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07649. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We develop a graph-theoretic approach to the expected-norm matrix arithmetic--geometric mean inequality. By encoding matrix interactions with a path-supported Gram matrix, we obtain a projection family whose product is nonzero exactly when the transition graph of its index sequence is a path. This gives an intuitive explanation for failure: repeated indices can create cycles or branches that annihilate products, an effect absent for positive scalars. We prove the universal lower bound $(n)_m/n^m$ for the ratio of the with-replacement to the without-replacement mean and show that it is asymptotically sharp on the exponential scale when $m=n$. Specifically, our construction gives a ratio $\exp(-n+O(\sqrt n))$, matching the lower bound's leading exponential rate over unrestricted dimensions. We also determine an explicit overlap threshold, derive exact six-factor counterexamples, and show that exponential failure can coexist with vanishing pairwise commutators.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2611.07649 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:23:27.649Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).