Distinct Volume Subsets

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

[1]  P. Erdös Some remarks on set theory , 1943 .

[2]  Rom Pinchasi,et al.  The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane , 2008, SIAM J. Discret. Math..

[3]  Vojtech Rödl On a problem in combinatorial geometry , 1983, Discret. Math..

[4]  P. ERDijS ON SOME METRIC AND COMBINATORIAL GEOMETRIC PROBLEMS , 1986 .

[5]  Paul Erdös,et al.  On a problem in combinatorial geometry , 1982, Discret. Math..

[6]  József Solymosi,et al.  Near optimal bounds for the Erdős distinct distances problem in high dimensions , 2008, Comb..

[7]  George B. Purdy,et al.  The Directions Determined by n Points in the Plane , 1979 .

[8]  Marcos Charalambides,et al.  A note on distinct distance subsets , 2012, 1211.1776.

[9]  Csaba D. Tóth,et al.  On the number of tetrahedra with minimum, unit, and distinct volumes in three-space , 2007, SODA '07.

[10]  Henry Ernest Dudeney Amusements in Mathematics , 1917, Nature.

[11]  P. Erdös On Sets of Distances of n Points , 1946 .

[12]  Paul Erdös,et al.  Distinct Distances Determined By Subsets of a Point Set in Space , 1991, Comput. Geom..

[13]  Riccardo Dondi,et al.  Algorithmic Aspects in Information and Management , 2016, Lecture Notes in Computer Science.

[14]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[15]  T. Willmore Algebraic Geometry , 1973, Nature.

[16]  Noga Alon,et al.  Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints , 2003, Random Struct. Algorithms.

[17]  Larry Guth,et al.  On the Erdos distinct distance problem in the plane , 2010, 1011.4105.

[18]  Endre Szemerédi,et al.  Linear problems in combinatorial number theory , 1975 .

[19]  Hanno Lefmann No lGrid-Points in Spaces of Small Dimension , 2008, AAIM.

[20]  G. Purdy Some extremal problems in geometry , 1971 .

[21]  Hanno Lefmann,et al.  Point sets with distinct distances , 1995, Comb..

[22]  Csaba D. Tóth,et al.  Extremal problems on triangle areas in two and three dimensions , 2007, SCG '08.

[23]  P. Erdos,et al.  Extremal problems in combinatorial geometry , 1996 .

[24]  Csaba D. Tóth,et al.  Distinct Triangle Areas in a Planar Point Set , 2007, IPCO.