Metraipolis › archive › dc_82b055bf2aef
The 3-Uniform Hyperclique Hypothesis is False — arXiv:2611.06813
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.06813
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:31:43.940Z
- SHA-256 of the archived text
abf8eb52712c0956b92929ef54b582d9036d21911419613505202b0bf3946aa5- Stable URL of this page
https://metraipolis.com/documento/dc_82b055bf2aef
How to cite
The 3-Uniform Hyperclique Hypothesis is False — arXiv:2611.06813 — arXiv (en), https://arxiv.org/abs/2611.06813 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_82b055bf2aef (Metraipolis archive dc_82b055bf2aef, sha256 abf8eb52712c0956b92929ef54b582d9036d21911419613505202b0bf3946aa5)
BibTeX
@misc{dc82b055bf2aef,
title = {The 3-Uniform Hyperclique Hypothesis is False — arXiv:2611.06813},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.06813},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_82b055bf2aef; sha256 abf8eb52712c0956b92929ef54b582d9036d21911419613505202b0bf3946aa5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06813. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present truly subquartic algorithms for detecting or counting 4-hypercliques in a 3-uniform hypergraph with $n$ vertices, disproving a popular hypothesis in fine-grained complexity. The result immediately implies a faster algorithm for finding a $k$-hyperclique in a 3-uniform hypergraph for all constant $k\ge 4$, and a faster exponential-time algorithm for Max-3-SAT. 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.06813 — 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-05T18:21:04.032Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).