References
B. S. Kashin, Math. USSR-Izv. 11 (2), 317 (1977).
Yu. Lyubarskii and R. Vershynin, IEEE Trans. Inform. Theory 56 (7), 3491 (2010).
W. Lim, N. Luong, and D. Hoang, IEEE Comm. Surv. Tut. 22 (3), 2031 (2020).
W. Chen, P. Kairouz, and A. Ozgur, IEEE Trans. Inform. Theory 69 (2), 1261 (2023).
S. Vargaftik, R. B. Basat, A. Portnoy, G. Mendelson, Y. Ben-Itzhak, and M. Mitzenmacher, Adv. Neural Inform. Proc. Sys. 34 (2021).
V. N. Temlyakov, Greedy Approximation, in Cambridge Monogr. Appl. Comput. Math. (Cambridge Univ. Press, Cambridge, 2011), Vol. 20.
F. Mezzadri, Notices Amer. Math. Soc. 54 (5), 592 (2007).
Funding
The research on Theorem 1 was carried out by B. S. Kashin and was supported by the Russian Science Foundation under grant no. 21-11-00131 (https://rscf.ru/en/project/21-11-00131/) at Lomonosov Moscow State University. The work on computer implementation and numerical experiments carried out by D. G. Romskii was supported by the Foundation for the Development of Theoretical Physics and Mathematics.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The authors of this work declare that they have no conflicts of interest.
Additional information
Translated from Matematicheskie Zametki, 2023, Vol. 114, pp. 945–948 https://doi.org/10.4213/mzm14132.
Publisher’s note. Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Kashin, B.S., Romskii, D.G. An Efficient Algorithm for Decomposing a Vector into Two Vectors with a Small Uniform Norm. Math Notes 114, 1484–1487 (2023). https://doi.org/10.1134/S0001434623110755
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434623110755