Lower bounds for spherical designs

被引：18
|
作者：
Yudin, VA [1 ]
机构：
[1] MOSCOW ENERGY INST,MOSCOW,RUSSIA
来源：
IZVESTIYA MATHEMATICS | 1997年 / 61卷 / 03期
关键词：
D O I：
10.1070/IM1997v061n03ABEH000132
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A new lower bound is obtained for the cardinality of spherical designs. In its dependence on dimension it improves the well-known bound of Delsarte by an exponential factor as the degree of the design tends to infinity.
引用
收藏
页码：673 / 683
页数：11
相关论文
共 50 条
  • [21] Lower bounds for the asymptotic minimax risk with spherical data
    Klemelä, J
    JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 2003, 113 (01) : 113 - 136
  • [22] UPPER AND LOWER BOUNDS FOR EIGENVALUES OF THE LAPLACIAN ON A SPHERICAL CAP
    BAGINSKI, FE
    QUARTERLY OF APPLIED MATHEMATICS, 1990, 48 (03) : 569 - 573
  • [23] Universal Lower Bounds for Potential Energy of Spherical Codes
    Boyvalenkov, P. G.
    Dragnev, P. D.
    Hardin, D. P.
    Saff, E. B.
    Stoyanova, M. M.
    CONSTRUCTIVE APPROXIMATION, 2016, 44 (03) : 385 - 415
  • [24] Energy bounds for weighted spherical codes and designs via linear programming
    Borodachov, S. V.
    Boyvalenkov, P. G.
    Dragnev, P. D.
    Hardin, D. P.
    Saff, E. B.
    Stoyanova, M. M.
    ANALYSIS AND MATHEMATICAL PHYSICS, 2025, 15 (01)
  • [25] Some new lower bounds to various discrepancies on combined designs
    Ou, Zujun
    Qin, Hong
    Chatterjee, Kashinath
    COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 2017, 46 (07) : 3244 - 3254
  • [26] Lower bounds of projection weighted symmetric discrepancy on uniform designs
    Zheng, Hao
    Fu, Kang
    Xiao, Yao
    AUSTRALIAN & NEW ZEALAND JOURNAL OF STATISTICS, 2025,
  • [27] Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere
    Jones, Chris
    McPartlon, Matt
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 874 - 891
  • [28] Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere
    Jones, Chris
    McPartlon, Matt
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 874 - 891
  • [29] A Sharpening of the Welch Bounds and the Existence of Real and Complex Spherical t-Designs
    Waldron, Shayne
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (11) : 6849 - 6857
  • [30] Lower Bounds on Randomly Preconditioned Lasso via Robust Sparse Designs
    Kelner, Jonathan A.
    Koehler, Frederic
    Meka, Raghu
    Rohatgi, Dhruv
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35, NEURIPS 2022, 2022,
12345