The Helly number of Hamming balls and related problems

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Alon, Noga, Jin, Zhihan, Sudakov, Benny
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866929370926415872
author Alon, Noga
Jin, Zhihan
Sudakov, Benny
author_facet Alon, Noga
Jin, Zhihan
Sudakov, Benny
contents We prove the following variant of Helly's classical theorem for Hamming balls with a bounded radius. For $n>t$ and any (finite or infinite) set $X$, if in a family of Hamming balls of radius $t$ in $X^n$, every subfamily of at most $2^{t+1}$ balls have a common point, so do all members of the family. This is tight for all $|X|>1$ and all $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.
format Preprint
id arxiv_https___arxiv_org_abs_2405_10275
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle The Helly number of Hamming balls and related problems
Alon, Noga
Jin, Zhihan
Sudakov, Benny
Combinatorics
05D05, 05D40, 52A35
We prove the following variant of Helly's classical theorem for Hamming balls with a bounded radius. For $n>t$ and any (finite or infinite) set $X$, if in a family of Hamming balls of radius $t$ in $X^n$, every subfamily of at most $2^{t+1}$ balls have a common point, so do all members of the family. This is tight for all $|X|>1$ and all $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.
title The Helly number of Hamming balls and related problems
topic Combinatorics
05D05, 05D40, 52A35
url https://arxiv.org/abs/2405.10275