Metraipolis › archive › dc_0c18eb07fdb0

Economical lattice coverings by determined segments — arXiv:2608.03301

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.03301
License (as archived)
CC0-1.0
Archived
2026-10-31T12:55:48.632Z
SHA-256 of the archived text
8778c17bcf13f0c5de5d7338297e7694c020c1e4543f57992487dda4be08d139
Stable URL of this page
https://metraipolis.com/documento/dc_0c18eb07fdb0

How to cite

Economical lattice coverings by determined segments — arXiv:2608.03301 — arXiv (en), https://arxiv.org/abs/2608.03301 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0c18eb07fdb0 (Metraipolis archive dc_0c18eb07fdb0, sha256 8778c17bcf13f0c5de5d7338297e7694c020c1e4543f57992487dda4be08d139)
BibTeX
@misc{dc0c18eb07fdb0,
  title = {Economical lattice coverings by determined segments — arXiv:2608.03301},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.03301},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0c18eb07fdb0; sha256 8778c17bcf13f0c5de5d7338297e7694c020c1e4543f57992487dda4be08d139},
  year = {2026}
}

Archived text

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

For fixed $d\geq 2$, let $\tau_d(n)$ be the minimum size of a set $S\subseteq\{0,\ldots,n\}^d$ such that the affine lines determined by pairs of distinct points of $S$ cover the grid. Let $\sigma_d(n)$ be the analogous minimum when every grid point must lie on the closed segment joining two distinct points of $S$. A celebrated result of Alon [GAFA, 1991] proved that $\tau_d(n)$ is of order between $\Omega_d(n^{\alpha_d})$ and $O_d(n^{\alpha_d}\log n)$, where $\alpha_d=\frac{d(d-1)}{2d-1}$, and asked whether the logarithm term is necessary. We prove that $$c_d n^{\alpha_d}\leq\tau_d(n)\leq\sigma_d(n)\leq C_d n^{\alpha_d}$$ for every fixed $d\geq 2$, thereby resolving Alon's problem in a stronger form.

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