Metraipolis › archive › dc_df0b81f657d5
The Three-Dimensional Erdős Box Problem Has Exponent $11/4$ — arXiv:2609.22381
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.22381
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T21:44:32.625Z
- SHA-256 of the archived text
c1208ebc1aff99ef315155093f86e4a6b03e4f07c3413a932d988ee4ff44f846- Stable URL of this page
https://metraipolis.com/documento/dc_df0b81f657d5
How to cite
The Three-Dimensional Erdős Box Problem Has Exponent $11/4$ — arXiv:2609.22381 — arXiv (en), https://arxiv.org/abs/2609.22381 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_df0b81f657d5 (Metraipolis archive dc_df0b81f657d5, sha256 c1208ebc1aff99ef315155093f86e4a6b03e4f07c3413a932d988ee4ff44f846)
BibTeX
@misc{dcdf0b81f657d5,
title = {The Three-Dimensional Erdős Box Problem Has Exponent $11/4$ — arXiv:2609.22381},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.22381},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_df0b81f657d5; sha256 c1208ebc1aff99ef315155093f86e4a6b03e4f07c3413a932d988ee4ff44f846},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22381. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $z(n)$ be the maximum number of edges in a tripartite $3$-uniform hypergraph with $n$ vertices in each part and no copy of $K_{2,2,2}^{(3)}$ (a ``box''). Erdős (1964) proved that $z(n) = O(n^{11/4})$, whereas the best previous lower bound, due to Katz, Krop, and Maggioni (2002), was $\Omega(n^{8/3})$. For each $q = 2^m$, we construct a box-free hypergraph with $q^4$ vertices in each part and $q^{11}$ edges, showing that $z(n) = \Theta(n^{11/4})$. The construction uses the power map $\tau(s) = s^{q^2-q+1}$ on $\F_{q^3}$, which sends the fibers of $s \mapsto \tau(s+1) + \tau(s)$ to pairwise skew affine lines over $\F_q$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.22381 — 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-09T21:26:41.088Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).