Distinct volume subsets
Combinatorics
2023-10-13 v3 Computational Geometry
Metric Geometry
Abstract
Suppose that and are positive integers with . Let be the largest integer such that any set of points in contains a subset of points for which all the non-zero volumes of the subsets of order are distinct. Beginning with Erd\H{o}s in 1957, the function has been closely studied and is known to be at least a power of . We improve the best known bound for and show that is at least a power of for all and .
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