A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points

被引：29

作者：

Kral', Daniel ^{[1
]}

Mach, Lukas ^{[1
]}

Sereni, Jean-Sebastien ^{[2
,3
]}

机构：

[1] Charles Univ Prague, Fac Math & Phys, Inst Comp Sci, Prague 11800 1, Czech Republic

[2] Univ Paris 07, CNRS, LIAFA, Paris, France

[3] Charles Univ Prague, Fac Math & Phys, Dept Appl Math KAM, Prague 11800 1, Czech Republic

来源：

DISCRETE & COMPUTATIONAL GEOMETRY | 2012年 / 48卷 / 02期

基金：

欧洲研究理事会;

关键词：

Flag algebras; Covering points by simplicies; Cofilling profiles; Boros-Furedi-Barany-Pach-Gromov theorem;

D O I：

10.1007/s00454-012-9419-3

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Boros and Furedi (for d=2) and Barany (for arbitrary d) proved that there exists a positive real number c (d) such that for every set P of n points in R (d) in general position, there exists a point of R (d) contained in at least d-simplices with vertices at the points of P. Gromov improved the known lower bound on c (d) by topological means. Using methods from extremal combinatorics, we improve one of the quantities appearing in Gromov's approach and thereby provide a new stronger lower bound on c (d) for arbitrary d. In particular, we improve the lower bound on c (3) from 0.06332 to more than 0.07480; the best upper bound known on c (3) being 0.09375.

引用

下载

页码：487 / 498

页数：12

共 50 条

[21] On reducing the Cramer-Rao lower bound of localization by selecting base stations based on convex relaxation
Zhang, Tie-Nan
Xin, Liang
Liu, Jian-xin
Mao, Xing-Peng
2017 8TH IEEE ANNUAL INFORMATION TECHNOLOGY, ELECTRONICS AND MOBILE COMMUNICATION CONFERENCE (IEMCON), 2017, : 338 - 342
[22] New theory and numerical results for Gromov's method for stochastic particle flow filters
Daum, Fred
Huang, Jim
Noushin, Arjang
2018 21ST INTERNATIONAL CONFERENCE ON INFORMATION FUSION (FUSION), 2018, : 108 - 115
[23] The lower bound finite element method based on stress gradients expansion
China State Key Laboratory of Geomechanics and Geotechnical Engineering, Institute of Rock and Soil Mechanics, Chinese Academy of Sciences, Wuhan
430071, China
Gongcheng Lixue, 10 (38-43 and 59):
[24] AAR-based decomposition method for lower bound limit analysis
Munoz, Jose J.
Rabiei, Nima
PROCEEDINGS OF THE INSTITUTION OF CIVIL ENGINEERS-ENGINEERING AND COMPUTATIONAL MECHANICS, 2015, 168 (04) : 169 - 177
[25] A New Samples Selecting Method based on K Nearest Neighbors
Yang, Kai
Cai, Yi
Cai, Zhiwei
Tan, Xingwei
Xie, Haoran
Wong, Tak Lam
Chan, Wai Hong
2017 IEEE INTERNATIONAL CONFERENCE ON BIG DATA AND SMART COMPUTING (BIGCOMP), 2017, : 457 - 462
[26] A new lower bound on the t-parameter of (t, s)-sequences
Schuerer, Rudolf
MONTE CARLO AND QUASI-MONTE CARLO METHODS 2006, 2008, : 623 - 632
[27] A new method to construct fuzzy systems based on rule selecting
Sun, HR
Han, P
Zhou, LH
PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 1855 - 1858
[28] New calculation method for lower nodal points in large oil tank structures
Wu, Tianyun, 1600, Petrochem Eng Corp, Luoyang, China (25):
[29] A New Precision Evaluation Method for Signals of Opportunity Based on CRAMER-RAO Lower Bound in Finite Error
Zheng, Yuanxun
Li, Qinghua
Wang, Changhong
Shao, Xuehui
Yang, Baisheng
PROCEEDINGS OF THE 38TH CHINESE CONTROL CONFERENCE (CCC), 2019, : 3934 - 3939
[30] The extended perturbation method: With applications to the New Keynesian model and the zero lower bound
Andreasen, Martin M.
Kronborg, Anders F.
QUANTITATIVE ECONOMICS, 2022, 13 (03) : 1171 - 1202

← 1 2 3 4 5 →