Metraipolis › archive › dc_f3e450a079df

Distortion of Random Max Filters over Reflection Groups — arXiv:2611.00305

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.00305
License (as archived)
CC0-1.0
Archived
2026-11-03T11:34:45.668Z
SHA-256 of the archived text
ec363957b6135d86ce828c14704b30a599784ba5dff3e0b013eaa1292b40274b
Stable URL of this page
https://metraipolis.com/documento/dc_f3e450a079df

How to cite

Distortion of Random Max Filters over Reflection Groups — arXiv:2611.00305 — arXiv (en), https://arxiv.org/abs/2611.00305 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f3e450a079df (Metraipolis archive dc_f3e450a079df, sha256 ec363957b6135d86ce828c14704b30a599784ba5dff3e0b013eaa1292b40274b)
BibTeX
@misc{dcf3e450a079df,
  title = {Distortion of Random Max Filters over Reflection Groups — arXiv:2611.00305},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.00305},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f3e450a079df; sha256 ec363957b6135d86ce828c14704b30a599784ba5dff3e0b013eaa1292b40274b},
  year = {2026}
}

Archived text

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

A max filter with Gaussian templates $a_1,\dots,a_D$ is a $G$-invariant map $\R^d\to\R^D$, where $G$ is a finite reflection group. As $D\to\infty$ its distortion converges a.s to the condition number of $M_G^{1/2}$, where $M_G$ is the second-moment matrix of a standard Gaussian vector moved into a fundamental chamber of $G$. We compute this limit exactly for the sign and dihedral groups, and show it grows as $\Theta(\sqrt d)$, $\Theta(d^{3/2})$ and $\Theta(k)$ for the sign, symmetric and dihedral groups of order $2k$. The symmetric case bound uses a lower bound on the covariance of order statistics. For any finite $G$ we also show that the infimum defining the optimal lower Lipschitz constant of a piecewise-linear $G$-invariant map is a minimum.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Representation Theory (math.RT) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2611.00305 — 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-03T11:04:52.286Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).