Improved Bounds for the Expected Number of k-Sets
Improved Bounds for the Expected Number of k-Sets
复制标题
改进 k 集预期数量的界限
DOI:
10.1007/s00454-022-00469-7
复制
发表时间:
2023
影响因子:
0.8
通讯作者:
Rademacher, Luis
中科院分区:
文献类型:
--
作者:
Leroux, Brett;Rademacher, Luis
Given a finite set of points, ak-setofSis a subsetof sizekwhich can be strictly separated fromby a hyperplane. Similarly, ak-facetof a point setSin general position is a subsetof sizedsuch that the hyperplane spanned byhaskpoints fromSon one side. For a probability distributionPon, we study, the expected number ofk-facets of a sample ofnrandom points fromP. WhenPis a distribution onsuch that the measure of every line is 0, we show that. Our argument is based on a technique by Bárány and Steiger. We study how it may be possible to improve this bound using the continuous version of the polynomial partitioning theorem. This motivates a question concerning the points of intersection of an algebraic curve and thek-edge graph of a set of points. We also study a variation on thek-set problem for the set system whose set of ranges consists of all translations of some strictly convex body in the plane. The motivation is to show that the technique by Bárány and Steiger is tight for a natural family of set systems. For any such set system, we determine bounds for the expected number ofk-sets which are tight up to logarithmic factors.
登录
查看更多内容
DOI:
10.1090/ulect/064
发表时间:
2016-07
期刊:
--
影响因子:
--
作者:
L. Guth
通讯作者:
L. Guth
影响因子:
0.8
作者:
M. Naszódi;Steven Taschuk
通讯作者:
Steven Taschuk
影响因子:
0.8
作者:
T. Dey
通讯作者:
T. Dey
DOI:
--
发表时间:
1997
期刊:
Proceedings 38th Annual Symposium on Foundations of Computer Science
影响因子:
--
作者:
T. Dey
通讯作者:
T. Dey
DOI:
--
发表时间:
2006
期刊:
影响因子:
--
作者:
Gabriel Nivasch
通讯作者:
Gabriel Nivasch