Metraipolis › archive › dc_62352836cfde

Low discrepancy and spectral gap for directed hypergraphs via spectral regularity lemma for tensors — arXiv:2609.37912

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.37912
License (as archived)
CC0-1.0
Archived
2026-10-07T18:33:48.157Z
SHA-256 of the archived text
37840f1d6400e7caa6abedda26795efd823c6746b995ae6c75f33f7ab4ee8a5f
Stable URL of this page
https://metraipolis.com/documento/dc_62352836cfde

How to cite

Low discrepancy and spectral gap for directed hypergraphs via spectral regularity lemma for tensors — arXiv:2609.37912 — arXiv (en), https://arxiv.org/abs/2609.37912 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_62352836cfde (Metraipolis archive dc_62352836cfde, sha256 37840f1d6400e7caa6abedda26795efd823c6746b995ae6c75f33f7ab4ee8a5f)
BibTeX
@misc{dc62352836cfde,
  title = {Low discrepancy and spectral gap for directed hypergraphs via spectral regularity lemma for tensors — arXiv:2609.37912},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.37912},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_62352836cfde; sha256 37840f1d6400e7caa6abedda26795efd823c6746b995ae6c75f33f7ab4ee8a5f},
  year = {2026}
}

Archived text

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

We show that low discrepancy is equivalent to spectral gap for directed $k$-uniform hypergraphs. For undirected hypergraphs this recovers a theorem of Lenz and Mubayi, with a considerably shorter proof. At the heart of our argument is a Frieze--Kannan type spectral regularity lemma for hypergraphs based on the variational notion of hypergraph eigenvalues by Friedman--Wigderson, which decomposes any tensor into a bounded number of rank-one tensors plus a quasi-random tensor with small top eigenvalue. This lemma may be of independent interest, and we prove it for complex-valued, not necessarily symmetric tensors. We also briefly discuss a Szemerédi-type variant and the regularization of Cayley-type hypergraphs over finite abelian groups.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.37912 — 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-07T17:59:19.248Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).