Distinct Volume Subsets
Author(s)
Conlon, David; Fox, Jacob; Gasarch, William; Harris, David G.; Ulrich, Douglas; Zbarsky, Samuel; ... Show more Show less
DownloadConlon-2015-Distinct volume.pdf (170.5Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
Suppose that a and d are positive integers with a ≥ 2. Let h[subscript a,d](n) be the largest integer t such that any set of n points in R[superscript d] contains a subset of t points for which all the nonzero volumes of the ([t over a]) subsets of order a are distinct. Beginning with Erdos in 1957, the function h[subscript 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[subscript 2,d](n) and show that h[subscript a,d](n) is at least a power of n for all a and d.
Date issued
2015-03Department
Massachusetts Institute of Technology. Department of MathematicsJournal
SIAM Journal on Discrete Mathematics
Publisher
Society for Industrial and Applied Mathematics
Citation
Conlon, David, Jacob Fox, William Gasarch, David G. Harris, Douglas Ulrich, and Samuel Zbarsky. “Distinct Volume Subsets.” SIAM J. Discrete Math. 29, no. 1 (January 2015): 472–480. © 2015 Society for Industrial and Applied Mathematics
Version: Final published version
ISSN
0895-4801
1095-7146