Method for solving the Delsarte problem for weighted designs on compact homogeneous spaces
https://doi.org/10.22405/2226-8383-2024-25-4-53-73
Abstract
A method for solving the Delsarte extremal problem 𝐴𝑠 for weighted designs is proposed. The value of 𝐴𝑠 is defined as the supremum of 𝑓(1) over the class of continuous nonnegative functions 𝑓 on [−1, 1] that can be represented by a Fourier–Jacobi expansion with a unit zero
coefficient and nonpositive coefficients starting from the (𝑠 + 1)th term. The main application of the problem 𝐴𝑠 lies in providing a lower bound for the number of nodes of weighted 𝑠-designs (or quadrature formulas, exact on a subspace of polynomials of degree at most 𝑠) in compact homogeneous Riemannian spaces of rank 1, where the zonal functions are Jacobi polynomials. The method for solving 𝐴𝑠 is based on convex an alysis and builds on the results of V.V. Arestov and A.G. Babenko for the case of spherical codes, as well as on specific cases developed by I.A. Martyanov and the author. The method involves several steps, including the formulation of a dual problem for the Stieltjes measure, proving the existence of the extremal function
and measure, deriving the duality relations, characterizing the extremal function and measure based on these relations, reducing the problem to a polynomial system of equations, and demonstrating the existence of a unique real analytic solution of the system in the vicinity of a numerical solution in the studied cases. This step is carried out by certifying the solution using the HomotopyContinuation.jl package, which implements the Krawczyk interval method. A uniform estimate for Jacobi polynomials of the Stieltjes–Bernstein type is also applied. Using this approach, two new Delsarte problems were solved as examples. Additionally, for the case corresponding to projective spaces, it is proven that the extremal function is a polynomial.
For the case corresponding to the sphere, this remains an open problem. These results are useful for the problem of discretizing the integral norm when estimating the number of nodes in discrete norms.
Keywords
Delsarte problem,
Jacobi polynomial,
homogeneous space,
weighted design,
polynomial system,
certification of the solution.
Supporting agencies: The study was carried out with the financial support of the Ministry of Science and Higher Education of the Russian Federation in the framework of a scientific project under agreement № . 075-15-2024-631.
About the Author
Dmitry Viktorovich Gorbachev
Saint Petersburg State University; Lomonosov Moscow State University; Moscow Center of Fundamental and Applied Mathematics
Russian Federation
Russian Federation
doctor of physical and mathematical sciences
References
1. Szeg¨o, G. 1975, “Orthogonal polynomials”, 4th ed., Providence, RI, Amer. Math. Soc.
2. Koornwinder, T. 1973, “The addition formula for Jacobi polynomials and spherical harmonics”, SIAM J. Appl. Math., vol. 25, no. 2, pp. 236–246.
3. Koornwinder, T. 1974, “Jacobi polynomials, II. An analytic proof of the product formula”, SIAM J. Math. Anal., vol. 5, no. 1, pp. 125–137.
4. Levenshtein, V. 1998, “On designs in compact metric spaces and a universal bound on their size”, Discrete Math., vol. 192, no. 1–3, pp. 251–271.
5. Gorbachev, D. V. & Ivanov, V. I. 2022, “Lectures on quadrature formulas and their application in extremal problems”, Tula, Tula State University. (In Russ.)
6. Yudin, V. A. 1997, “Lower bounds for spherical designs”, Izv. Math., vol. 61, no. 3, pp. 673–683.
7. Gorbachev, D. V. 2000, “On lower bounds for the cardinalities of designs in projective spaces”, Izvestiya of the Tula State University. Ser. Math., vol. 5, no. 3, pp. 33–37. (In Russ.)
8. Lyubich, Y. I. 2009, “Lower bounds for projective designs, cubature formulas and related isometric embeddings”, European J. Combin., vol. 30, no. 4, pp. 841–852.
9. Delsarte, P., Goethals, J. M. & Seidel, J. J. 1977, “Spherical codes and designs”, Geom. Dedicata, vol. 6, pp. 363–388.
10. Mysovskikh, I.P. 1981, “Interpolation cubature formulas”, Moscow, Nauka. (In Russ.)
11. Dai, F., Prymak, A., Temlyakov, V.N. & Tikhonov, S.Yu. 2019, “Integral norm discretization and related problems”, Russian Math. Surveys, vol. 74, no. 4, pp. 579–630.
12. Bondarenko, A., Radchenko, D. & Viazovska, M. 2013, “Optimal asymptotic bounds for spherical designs”, Ann. of Math., vol. 178, no. 2, pp. 443–452.
13. Etayo, U., Marzo, J. & Ortega-Cerd`a, J. 2018, “Asymptotically optimal designs on compact algebraic manifolds”, Monatsh. Math., vol. 186, no. 2, pp. 235–248.
14. Andreev, N. N. 2000, “A minimal design of order 11 on the 3-sphere”, Math. Notes, vol. 67, no. 4, pp. 417–424.
15. Boyvalenkov, P. & Nikova, S. 1998, “Improvements of the lower bounds on the size of some spherical designs”, Mathematica Balkanica, vol. 12, pp. 151–160.
16. Arestov, V. V. & Babenko, A. G. 1997, “On Delsarte scheme of estimating the contact numbers”, Proc. Steklov Inst. Math., vol. 219, pp. 36–65.
17. Gol’shtein, E. G. 1971, “Theory of duality in mathematical programming and its applications”. Moscow, Nauka. (In Russ.)
18. Shtrom, D. V. 2002, “The Delsarte method in the problem of the contact numbers of Euclidean spaces of high dimensions”, Proc. Steklov Inst. Math., Suppl. 2, pp. S162–S189.
19. Kuklin, N. A. 2014, “Delsarte method in the problem on kissing numbers in high-dimensional spaces”, Proc. Steklov Inst. Math. (Suppl.), vol. 284, suppl. 1, pp. 108–123.
20. Musin, O. R. 2008, “The kissing number in four dimensions”, Ann. of Math. (2), vol. 168, no. 1, pp. 1–32.
21. Martyanov, I. A. 2021, “Solving the Delsarte problem for 4-designs on the sphere 𝑆2”, Chebyshevskii Sbornik, vol. 22, no. 3, pp. 154–165. (In Russ.)
22. Gorbachev, D. V. & Martyanov, I.A. 2022, “Delsarte problem for 4-designs on the unit 3-sphere”, Chebyshevskii Sbornik, vol. 23, no. 4, pp. 157–161. (In Russ.)
23. Bondarenko, A.V. & Gorbachev, D.V. 2012, “Minimal weighted 4-designs on the sphere 𝑆2”, Math. Notes, vol. 91, no. 5, pp. 738–741.
24. Luenberger, D. G. 1997, “Optimization by vector space methods”, John Wiley & Sons.
25. Gon¸calves, F., Oliveira e Silva, D. & Steinerberger S. 2017, “Hermite polynomials, linear flows on the torus, and an uncertainty principle for roots”, J. Math. Anal. Appl., vol. 451, no. 2, pp. 678–711.
26. Odlyzko, A. M. & Sloane, N. J. A. 1979, “New bounds on the number of unit spheres that can touch a unit sphere in 𝑛 dimensions”, J. Combin. Theory Ser. A., vol. 26, no. 2, pp. 210–214.
27. Cohn, H., de Laat, D. & Leijenhorst, N. 2024, “Optimality of spherical codes via exact semidefinite programming bounds”, arXiv:2403.16874.
28. Breiding, P., Rose, K. & Timme, S. 2023, “Certifying zeros of polynomial systems using interval arithmetic”, ACM Trans. Math. Software, vol. 49, no. 1, art. id. 11.
29. Krawczyk, R. 1969, “Newton-algorithmen zur bestimmung von nullstellen mit fehlerschranken”, Computing, vol. 4, no. 3, pp. 187–201.
30. Haagerup, U. & Schlichtkrull, H. 2014, “Inequalities for Jacobi polynomials”, Ramanujan J., vol. 33, pp. 227–246.
Review
For citations:
Gorbachev D.V. Method for solving the Delsarte problem for weighted designs on compact homogeneous spaces. Chebyshevskii Sbornik. 2024;25(4):53-73. (In Russ.) https://doi.org/10.22405/2226-8383-2024-25-4-53-73
Views:
100
Email this article 