Pach’s Selection Theorem Does Not Admit a Topological Extension

Imre Bárány; Roy Meshulam; Eran Nevo; Martin Tancer

doi:10.1007/s00454-018-9998-8

Pach’s Selection Theorem Does Not Admit a Topological Extension

Imre Bárány
, Roy Meshulam^*
, Eran Nevo
, Martin Tancer

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

Let U₁, … , U_d ₊ ₁ be n-element sets in R^d. Pach’s selection theorem says that there exist subsets Z₁⊂ U₁, … , Z_d ₊ ₁⊂ U_d ₊ ₁ and a point u∈ R^d such that each | Z_i| ≥ c₁(d) n and u∈ conv { z₁, … , z_d ₊ ₁} for every choice of z₁∈ Z₁, … , z_d ₊ ₁∈ Z_d ₊ ₁. Here we show that this theorem does not admit a topological extension with linear size sets Z_i. However, there is a topological extension where each | Z_i| is of order (log n) ¹ ^/ ^d.

Original language	English
Pages (from-to)	420-429
Number of pages	10
Journal	Discrete and Computational Geometry
Volume	60
Issue number	2
DOIs	https://doi.org/10.1007/s00454-018-9998-8
State	Published - 1 Sep 2018

Bibliographical note

Publisher Copyright:
© 2018, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords

Gromov’s Overlap Theorem
Pach’s Selection Theorem

Access to Document

10.1007/s00454-018-9998-8

Cite this

@article{3749888064bb498facaca1ffe48645cc,

title = "Pach{\textquoteright}s Selection Theorem Does Not Admit a Topological Extension",

abstract = "Let U1, … , Ud + 1 be n-element sets in Rd. Pach{\textquoteright}s selection theorem says that there exist subsets Z1⊂ U1, … , Zd + 1⊂ Ud + 1 and a point u∈ Rd such that each | Zi| ≥ c1(d) n and u∈ conv \{ z1, … , zd + 1\} for every choice of z1∈ Z1, … , zd + 1∈ Zd + 1. Here we show that this theorem does not admit a topological extension with linear size sets Zi. However, there is a topological extension where each | Zi| is of order (log n) 1 / d.",

keywords = "Gromov{\textquoteright}s Overlap Theorem, Pach{\textquoteright}s Selection Theorem",

author = "Imre B{\'a}r{\'a}ny and Roy Meshulam and Eran Nevo and Martin Tancer",

note = "Publisher Copyright: {\textcopyright} 2018, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2018",

month = sep,

day = "1",

doi = "10.1007/s00454-018-9998-8",

language = "אנגלית",

volume = "60",

pages = "420--429",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - Pach’s Selection Theorem Does Not Admit a Topological Extension

AU - Bárány, Imre

AU - Meshulam, Roy

AU - Nevo, Eran

AU - Tancer, Martin

PY - 2018/9/1

Y1 - 2018/9/1

N2 - Let U1, … , Ud + 1 be n-element sets in Rd. Pach’s selection theorem says that there exist subsets Z1⊂ U1, … , Zd + 1⊂ Ud + 1 and a point u∈ Rd such that each | Zi| ≥ c1(d) n and u∈ conv { z1, … , zd + 1} for every choice of z1∈ Z1, … , zd + 1∈ Zd + 1. Here we show that this theorem does not admit a topological extension with linear size sets Zi. However, there is a topological extension where each | Zi| is of order (log n) 1 / d.

AB - Let U1, … , Ud + 1 be n-element sets in Rd. Pach’s selection theorem says that there exist subsets Z1⊂ U1, … , Zd + 1⊂ Ud + 1 and a point u∈ Rd such that each | Zi| ≥ c1(d) n and u∈ conv { z1, … , zd + 1} for every choice of z1∈ Z1, … , zd + 1∈ Zd + 1. Here we show that this theorem does not admit a topological extension with linear size sets Zi. However, there is a topological extension where each | Zi| is of order (log n) 1 / d.

KW - Gromov’s Overlap Theorem

KW - Pach’s Selection Theorem

UR - https://www.scopus.com/pages/publications/85045235826

U2 - 10.1007/s00454-018-9998-8

DO - 10.1007/s00454-018-9998-8

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85045235826

SN - 0179-5376

VL - 60

SP - 420

EP - 429

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 2

ER -

Pach’s Selection Theorem Does Not Admit a Topological Extension

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this