Metraipolis › archive › dc_8dcdcb3a3476

The Hyperclique Hypothesis is False — arXiv:2611.03880

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03880
License (as archived)
CC0-1.0
Archived
2026-11-04T19:06:56.922Z
SHA-256 of the archived text
80b0eacc0eeb63f149bd2b8fccf00ee3e9dccfc19f4cce5621802353383297c5
Stable URL of this page
https://metraipolis.com/documento/dc_8dcdcb3a3476

How to cite

The Hyperclique Hypothesis is False — arXiv:2611.03880 — arXiv (en), https://arxiv.org/abs/2611.03880 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8dcdcb3a3476 (Metraipolis archive dc_8dcdcb3a3476, sha256 80b0eacc0eeb63f149bd2b8fccf00ee3e9dccfc19f4cce5621802353383297c5)
BibTeX
@misc{dc8dcdcb3a3476,
  title = {The Hyperclique Hypothesis is False — arXiv:2611.03880},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03880},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8dcdcb3a3476; sha256 80b0eacc0eeb63f149bd2b8fccf00ee3e9dccfc19f4cce5621802353383297c5},
  year = {2026}
}

Archived text

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

The Hyperclique Hypothesis postulates that, for all constants $k > h \geq 3$, detecting a $k$-clique in an $h$-uniform hypergraph with $n$ vertices requires time $n^{k-o(1)}$. This hypothesis is false: there is an algebraic algorithm that detects (and even counts) $k$-cliques in $h$-uniform hypergraphs in time $O(n^{(1-\epsilon_h)k})$. Via known reductions, this also refutes the recently proposed $k$-AP Hypothesis. As a consequence, many problems with conditional lower bounds based on these two hypotheses may admit faster algorithms after all. This result is almost entirely due to AI.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2611.03880 — 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-04T18:40:52.424Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).