English

Distinct volume subsets

Combinatorics 2023-10-13 v3 Computational Geometry Metric Geometry

Abstract

Suppose that aa and dd are positive integers with a2a \geq 2. Let ha,d(n)h_{a,d}(n) be the largest integer tt such that any set of nn points in Rd\mathbb{R}^d contains a subset of tt points for which all the non-zero volumes of the (ta){t \choose a} subsets of order aa are distinct. Beginning with Erd\H{o}s in 1957, the function h2,d(n)h_{2,d}(n) has been closely studied and is known to be at least a power of nn. We improve the best known bound for h2,d(n)h_{2,d}(n) and show that ha,d(n)h_{a,d}(n) is at least a power of nn for all aa and dd.

Keywords

Cite

@article{arxiv.1401.6734,
  title  = {Distinct volume subsets},
  author = {David Conlon and Jacob Fox and William Gasarch and David G. Harris and Douglas Ulrich and Samuel Zbarsky},
  journal= {arXiv preprint arXiv:1401.6734},
  year   = {2023}
}

Comments

10 pages

R2 v1 2026-06-22T02:55:08.989Z