Metraipolis › archive › dc_e3f0808fcf95

Superlogarithmic-Rank Matrix Rigidity for the Walsh-Hadamard Transform — arXiv:2608.06592

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.06592
License (as archived)
CC0-1.0
Archived
2026-10-23T15:22:23.075Z
SHA-256 of the archived text
2c20104acb33c3e7d8520316fde71352b73aeb35b2e846f2df812e3922282f39
Stable URL of this page
https://metraipolis.com/documento/dc_e3f0808fcf95

How to cite

Superlogarithmic-Rank Matrix Rigidity for the Walsh-Hadamard Transform — arXiv:2608.06592 — arXiv (en), https://arxiv.org/abs/2608.06592 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e3f0808fcf95 (Metraipolis archive dc_e3f0808fcf95, sha256 2c20104acb33c3e7d8520316fde71352b73aeb35b2e846f2df812e3922282f39)
BibTeX
@misc{dce3f0808fcf95,
  title = {Superlogarithmic-Rank Matrix Rigidity for the Walsh-Hadamard Transform — arXiv:2608.06592},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.06592},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e3f0808fcf95; sha256 2c20104acb33c3e7d8520316fde71352b73aeb35b2e846f2df812e3922282f39},
  year = {2026}
}

Archived text

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

For sufficiently large $N$ which is a power of 2, we prove that changing at most one percent of the entries of the $N\times N$ Walsh-Hadamard Transform cannot reduce its rank over $\mathbb{F}_3$ to $\lfloor \log^2 N/80\rfloor$ or below. To the best of our knowledge, this is the first constant-fraction rigidity lower bound for an explicit matrix family at a superlogarithmic target rank over any choice of field, inching toward the parameters in Razborov's program for communication complexity lower bounds.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-10 in cs.CC).
Categorie arXiv: Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2608.06592 — 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-10-23T15:09:54.745Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-08-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).