Tverberg theorems over discrete sets of points

  • J. A. De Loera
  • , T. A. Hogan
  • , F. Meunier
  • , N. H. Mustafa

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

Abstract

This paper discusses Tverberg-type theorems with coordinate constraints (i.e., versions of these theorems where all points lie within a subset S ⊂ Rd and the intersection of convex hulls is required to have a non-empty intersection with S). We determine the m-Tverberg number, when m ≥ 3, of any discrete subset S of R2 (a generalization of an unpublished result of J.-P. Doignon). We also present improvements on the upper bounds for the Tverberg numbers of Z3 and Zj × Rk and an integer version of the well-known positive-fraction selection lemma of J. Pach.

Original languageEnglish
Title of host publicationPolytopes and Discrete Geometry
EditorsGabriel Cunningham, Mark Mixer, Egon Schulte
PublisherAmerican Mathematical Society
Pages57-69
Number of pages13
ISBN (Print)9781470448974
DOIs
Publication statusPublished - 1 Jan 2021
EventSpecial Session on Polytopes and Discrete Geometry, 2018 - Boston, United States
Duration: 21 Apr 201822 Apr 2018

Publication series

NameContemporary Mathematics
Volume764
ISSN (Print)0271-4132
ISSN (Electronic)1098-3627

Conference

ConferenceSpecial Session on Polytopes and Discrete Geometry, 2018
Country/TerritoryUnited States
CityBoston
Period21/04/1822/04/18

Fingerprint

Dive into the research topics of 'Tverberg theorems over discrete sets of points'. Together they form a unique fingerprint.

Cite this