EUVIMEDEUVIMED entdecken
Crossref

The Helly number of Hamming balls and related problems

Noga Alon, Zhihan Jin, Benjamin Sudakov

Transactions of the American Mathematical Society · 20.08.2026

DOI: 10.1090/tran/9730 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Transactions of the American Mathematical Society, online erschienen am 20.08.2026. Verfasst von Noga Alon und 2 weiteren Autor:innen. Die Arbeit nennt 42 Literaturangaben. Gefördert von: Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We prove the following variant of Helly’s classical theorem for Hamming balls with a bounded radius. For n > t n>t and any (finite or infinite) set X X , if in a family of Hamming balls of radius t t in X n X^{n} , every subfamily of at most 2 t + 1 2^{t+1} balls has a common point, so does the whole family. This is tight for all | X | > 1 |X|>1 and all n > t n>t . The proof of the main result is based on a novel variant of the so-called dimension argument, which allows one to prove upper bounds that do not depend on the dimension of the ambient space. We also discuss several related questions and connections to problems and results in extremal finite set theory and graph theory.

Förderung

  • Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung

Zitieren

APA

Alon, N., Jin, Z., & Sudakov, B. (2026). The Helly number of Hamming balls and related problems. Transactions of the American Mathematical Society. https://doi.org/10.1090/tran/9730

Vancouver

Alon N, Jin Z, Sudakov B. The Helly number of Hamming balls and related problems. Transactions of the American Mathematical Society. 2026. doi:10.1090/tran/9730

BibTeX
@article{Alon2026,
  author = {Alon, Noga and Jin, Zhihan and Sudakov, Benjamin},
  title = {The Helly number of Hamming balls and related problems},
  journal = {Transactions of the American Mathematical Society},
  year = {2026},
  doi = {10.1090/tran/9730}
}
Kostenlos starten →