On Helly Numbers of Exponential Lattices

Gergely Ambrus, Martin Balko, Nóra Frankl, Attila Jung, Márton Naszódi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Given a set S ⊆ R2, define the Helly number of S, denoted by H(S), as the smallest positive integer N, if it exists, for which the following statement is true: for any finite family F of convex sets in R2 such that the intersection of any N or fewer members of F contains at least one point of S, there is a point of S common to all members of F. We prove that the Helly numbers of exponential lattices {αn : n ∈ N0}2 are finite for every α > 1 and we determine their exact values in some instances. In particular, we obtain H({2n : n ∈ N0}2) = 5, solving a problem posed by Dillon (2021). For real numbers α, β > 1, we also fully characterize exponential lattices L(α, β) = {αn : n ∈ N0} × {βn : n ∈ N0} with finite Helly numbers by showing that H(L(α, β)) is finite if and only if logα(β) is rational.

Original languageEnglish
Title of host publication39th International Symposium on Computational Geometry, SoCG 2023
EditorsErin W. Chambers, Joachim Gudmundsson
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772730
DOIs
StatePublished - 1 Jun 2023
Externally publishedYes
Event39th International Symposium on Computational Geometry, SoCG 2023 - Dallas, United States
Duration: 12 Jun 202315 Jun 2023

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume258
ISSN (Print)1868-8969

Conference

Conference39th International Symposium on Computational Geometry, SoCG 2023
Country/TerritoryUnited States
CityDallas
Period12/06/2315/06/23

Keywords

  • Diophantine approximation
  • exponential lattices
  • Helly numbers

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'On Helly Numbers of Exponential Lattices'. Together they form a unique fingerprint.

Cite this