Skip to main content Accessibility help
×
Home
Hostname: page-component-747cfc64b6-rxvp8 Total loading time: 0.307 Render date: 2021-06-16T15:43:25.818Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true }

An Improved Bound for k-Sets in Four Dimensions

Published online by Cambridge University Press:  20 May 2010

MICHA SHARIR
Affiliation:
School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel and Courant Institute of Mathematical Sciences, New York University, New York, NY 10012, USA (e-mail: michas@post.tau.ac.il)
Corresponding
E-mail address:

Abstract

We show that the number of halving sets of a set of n points in ℝ4 is O(n4−1/18), improving the previous bound of [10] with a simpler (albeit similar) proof.

Type
Paper
Copyright
Copyright © Cambridge University Press 2010

Access options

Get access to the full version of this content by using one of the access options below.

References

[1]Agarwal, P., Aronov, B., Chan, T. and Sharir, M. (1998) On levels in arrangements of lines, segments, planes, and triangles. Discrete Comput. Geom. 19 315331.CrossRefGoogle Scholar
[2]Ajtai, M., Chvátal, V., Newborn, M. M. and Szemerédi, E. (1982) Crossing-free subgraphs. Ann. Discrete Math. 12 912.Google Scholar
[3]Andrzejak, A. and Welzl, E. (2003) In between k-sets, j-facets, and i-faces: (i, j)-partitions. Discrete Comput. Geom. 29 105131.CrossRefGoogle Scholar
[4]Blagojeviç, V. M., Matschke, B. and Ziegler, G. M. Optimal bounds for the colored Tverberg problem. arXiv:0910.4987Google Scholar
[5]Dey, T. (1998) Improved bounds for planar k-sets and related problems. Discrete Comput. Geom. 19 373382.CrossRefGoogle Scholar
[6]Erdős, P., Lovász, L., Simmons, A. and Strauss, E. G. (1973) Dissection graphs of planar point sets. In Survey Combinat. Theory, Sympos. (Colorado State University 1971), pp. 139149.CrossRefGoogle Scholar
[7]Leighton, F. T. (1983) Complexity Issues in VLSI, Foundations of Computing series, MIT Press.Google Scholar
[8]Lovász, L. (1971) On the number of halving lines. Ann. Univ. Sci. Budapest Rolando Eötvös Nom., Sec. Math. 14 107108.Google Scholar
[9]Matoušek, J. (2002) Lectures on Discrete Geometry, Graduate Texts in Mathematics, Springer.CrossRefGoogle Scholar
[10]Matoušek, J., Sharir, M., Smorodinsky, S. and Wagner, U. (2006) On k-sets in four dimensions. Discrete Comput. Geom. 35 177191.CrossRefGoogle Scholar
[11]Nivasch, G. (2008) An improved, simple construction of many halving edges. In Surveys on Discrete and Computational Geometry: Twenty Years Later (Goodman, J. E. et al. , eds), Vol. 453 of Contemporary Mathematics, AMS, pp. 299305.CrossRefGoogle Scholar
[12]Sharir, M., Smorodinsky, S. and Tardos, G. (2001) An improved bound for k-sets in three dimensions. Discrete Comput. Geom. 26 195204.CrossRefGoogle Scholar
[13]Tóth, G. (2001) Point sets with many k-sets. Discrete Comput. Geom. 26 187194.CrossRefGoogle Scholar
[14]Živaljević, R. T. and Vrećica, S. T. (1992) The colored Tverberg theorem and complexes of injective functions. J. Combin. Theory Ser. A 61 309318.CrossRefGoogle Scholar
5
Cited by

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

An Improved Bound for k-Sets in Four Dimensions
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

An Improved Bound for k-Sets in Four Dimensions
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

An Improved Bound for k-Sets in Four Dimensions
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *