<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2024-3-316-337</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-1880</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Discrete Mathematics in Relation to Computer Science</subject></subj-group></article-categories><title-group><article-title>Oценивание  интерполяционных проекторов с применением  многочленов Лежандра</article-title><trans-title-group xml:lang="en"><trans-title>Estimation of interpolation projectors using Legendre polynomials</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-6392-7618</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Невский</surname><given-names>Михаил Викторович</given-names></name><name name-style="western" xml:lang="en"><surname>Nevskii</surname><given-names>Mikhail V.</given-names></name></name-alternatives><email xlink:type="simple">mnevsk55@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Ярославский государственный университет им. П.Г. Демидова</institution><country>Россия</country></aff><aff xml:lang="en"><institution>P.G. Demidov Yaroslavl State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2024</year></pub-date><pub-date pub-type="epub"><day>13</day><month>09</month><year>2024</year></pub-date><volume>31</volume><issue>3</issue><fpage>316</fpage><lpage>337</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Невский М.В., 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Невский М.В.</copyright-holder><copyright-holder xml:lang="en">Nevskii M.V.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.mais-journal.ru/jour/article/view/1880">https://www.mais-journal.ru/jour/article/view/1880</self-uri><abstract><p>Приводятся оценки для минимальной нормы проектора при линейной интерполяции на компакте в ${\mathbb R}^n$. Пусть $\Pi_1({\mathbb R}^n)$ - пространство многочленов от $n$ переменных степени не выше $1$, $\Omega$ - компакт в ${\mathbb R}^n$, $K={\rm conv}(E)$. Будем предполагать, что ${\rm vol}(K)&gt;0$. Пусть точки $x^{(j)}\in \Omega$, $1\leq j\leq n+1,$ являются вершинами $n$-мерного невырожденного симплекса. Интерполяционный проектор $P:C(\Omega)\to \Pi_1({\mathbb R}^n)$ с узлами $x^{(j)}$ определяется равенствами $Pf\left(x^{(j)}\right)=f\left(x^{(j)}\right)$. Под $\|P\|_\Omega$ будем понимать норму $P$ как оператора из $C(\Omega)$ в $C(\Omega$. Через $\theta_n(\Omega)$ обозначим минимальную норму $\|P\|_\Omega$ из~всех операторов $P$ с узлами, принадлежащими $\Omega$. Через ${\rm simp}(\Omega)$ обозначим максимальный объём симплекса с вершинами в  $\Omega.$ Устанавливаются неравенства $\chi_n^{-1}\left(\frac{{\rm vol}(K)}{{\rm simp}(\Omega)}\right)\leq \theta_n(\Omega)\leq n+1.$ Здесь $\chi_n$ - стандартизованный многочлен Лежандра степени $n$. Нижняя оценка доказывается с применением полученной характеризации многочленов Лежандра через объёмы выпуклых многогранников. Именно, мы показываем, что при $\gamma\ge 1$ объём многогранника $\left\{x=(x_1,...,x_n)\in{\mathbb R}^n : \sum |x_j| +\left|1- \sum x_j\right|\le\gamma\right\}$ равен ${\chi_n(\gamma)}/{n!}$. В случае, когда $\Omega$ - $n$-мерный куб или $n$-мерный шар, нижняя оценка даёт возможность получить неравенства вида $\theta_n(\Omega)\geqslant c\sqrt{n}$.  Формулируются некоторые открытые вопросы.</p></abstract><trans-abstract xml:lang="en"><p>We give some estimates for the minimum projector norm under linear interpolation on a compact set in ${\mathbb R}^n$. Let $\Pi_1({\mathbb R}^n)$ be the space of polynomials in $n$ variables of degree at most $1$, $\Omega$ is a compactum in ${\mathbb R}^n$, $K={\rm conv}(\Omega)$. We will assume that ${\rm vol}(K)&gt;0$. Let the points $x^{(j)}\in \Omega$, $1\leq j\leq n+1,$ be the vertices of an $n$-dimensional nondegenerate simplex. The interpolation projector $P:C(\Omega)\to \Pi_1({\mathbb R}^n)$ with the nodes $x^{(j)}$ is defined by the equations $Pf\left(x^{(j)}\right)=f\left(x^{(j)}\right)$. By $\|P\|_\Omega$ we mean the norm of $P$ as an operator from $C(\Omega)$ to $C(\Omega)$. By $\theta_n(\Omega)$ we denote the minimal norm $\|P\|_\Omega$ of all operators $P$ with nodes belonging to $\Omega$. By ${\rm simp}(E)$ we denote the maximal volume of the simplex with vertices in $E$. We establish the inequalities $\chi_n^{-1}\left(\frac{{\rm vol}(K)}{{\rm simp}(\Omega)}\right)\leq \theta_n(\Omega)\leq n+1.$ Here $\chi_n$ is the standardized Legendre polynomial of degree $n$. The lower estimate is proved using the obtained characterization of Legendre polynomials through the volumes of convex polyhedra. More specifically, we show that for every $\gamma\ge 1$ the volume of the set $\left\{x=(x_1,...,x_n)\in{\mathbb R}^n : \sum |x_j| +\left|1- \sum x_j\right|\le\gamma\right\}$ is equal to ${\chi_n(\gamma)}/{n!}$. In the case when $\Omega$ is an $n$-dimensional cube or an $n$-dimensional ball, the lower estimate gives the possibility to obtain the inequalities of the form $\theta_n(\Omega)\geqslant c\sqrt{n}$. Also we formulate some open questions.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>полиномиальная интерполяция</kwd><kwd>проектор</kwd><kwd>норма</kwd><kwd>оценка</kwd><kwd>многочлены Лежандра</kwd></kwd-group><kwd-group xml:lang="en"><kwd>polynomial interpolation</kwd><kwd>projector</kwd><kwd>norm</kwd><kwd>esimate</kwd><kwd>Legendre polynomials</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">R. A. DeVore and G. G. Lorentz, Constructive Approximation. Springer-Verlag: Berlin -- Heidelberg, 1993.</mixed-citation><mixed-citation xml:lang="en">R. A. DeVore and G. G. Lorentz, Constructive Approximation. Springer-Verlag: Berlin -- Heidelberg, 1993.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">V. Barthelmann, E. Novak, and K. Ritter, “High dimensional polynomial interpolation on sparse grids,” Advances in Computational Mathematics, vol. 12, no. 4, pp. 273–288, 2000, doi: 10.1023/A:1018977404843.</mixed-citation><mixed-citation xml:lang="en">V. Barthelmann, E. Novak, and K. Ritter, “High dimensional polynomial interpolation on sparse grids,” Advances in Computational Mathematics, vol. 12, no. 4, pp. 273–288, 2000, doi: 10.1023/A:1018977404843.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">C. De Boor, “Polynomial Interpolation in Several Variables,” in Studies in Computer Science, Plenum Press, 1994, pp. 87–119.</mixed-citation><mixed-citation xml:lang="en">C. De Boor, “Polynomial Interpolation in Several Variables,” in Studies in Computer Science, Plenum Press, 1994, pp. 87–119.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">S. De Marchi, Lectures on Multivariate Polynomial Interpolation. G"ottingen -- Padova, 2015.</mixed-citation><mixed-citation xml:lang="en">S. De Marchi, Lectures on Multivariate Polynomial Interpolation. G"ottingen -- Padova, 2015.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">M. Gasca and R. Sauer, “Polynomial interpolation in several variables,” Advances in Computational Mathematics, vol. 12, no. 4, pp. 377–410, 2000, doi: 10.1023/A:1018981505752.</mixed-citation><mixed-citation xml:lang="en">M. Gasca and R. Sauer, “Polynomial interpolation in several variables,” Advances in Computational Mathematics, vol. 12, no. 4, pp. 377–410, 2000, doi: 10.1023/A:1018981505752.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">M. Gunzburger and A. Teckentrup, “Optimal Point Sets for Total Degree Polynomial Interpolation in Moderate Dimensions.” 2014, [Online]. Available: https://arxiv.org/abs/1407.3291.</mixed-citation><mixed-citation xml:lang="en">M. Gunzburger and A. Teckentrup, “Optimal Point Sets for Total Degree Polynomial Interpolation in Moderate Dimensions.” 2014, [Online]. Available: https://arxiv.org/abs/1407.3291.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">V. Kaarnioja, “On applying the maximum volume principle to a basis selection problem in multivariate polynomial interpolation.” 2017, [Online]. Available: https://arxiv.org/abs/1512.07424.</mixed-citation><mixed-citation xml:lang="en">V. Kaarnioja, “On applying the maximum volume principle to a basis selection problem in multivariate polynomial interpolation.” 2017, [Online]. Available: https://arxiv.org/abs/1512.07424.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">S. Pashkovskij, Vychislitel'nye Primeneniya Mnogochlenov i Ryadov Chebysheva. Nauka, 1983.</mixed-citation><mixed-citation xml:lang="en">S. Pashkovskij, Vychislitel'nye Primeneniya Mnogochlenov i Ryadov Chebysheva. Nauka, 1983.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">T. J. Rivlin, The Chebyshev Polynomials. John Wiley &amp; Sons, 1974.</mixed-citation><mixed-citation xml:lang="en">T. J. Rivlin, The Chebyshev Polynomials. John Wiley &amp; Sons, 1974.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">M. Nevskii, “Optimal Lagrange Interpolation Projectors and Legendre Polynomials.” 2024, [Online]. Available: https://arxiv.org/abs/2405.01254.</mixed-citation><mixed-citation xml:lang="en">M. Nevskii, “Optimal Lagrange Interpolation Projectors and Legendre Polynomials.” 2024, [Online]. Available: https://arxiv.org/abs/2405.01254.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">M. Nevskii, “Geometric Estimates in Linear Interpolation on a Cube and a Ball.” 2024, [Online]. Available: https://arxiv.org/abs/2402.11611.</mixed-citation><mixed-citation xml:lang="en">M. Nevskii, “Geometric Estimates in Linear Interpolation on a Cube and a Ball.” 2024, [Online]. Available: https://arxiv.org/abs/2402.11611.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii, Geometricheskie Ocenki v Polinomial'noj Interpolyacii. P. G. Demidov Yaroslavl State University, 2012.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii, Geometricheskie Ocenki v Polinomial'noj Interpolyacii. P. G. Demidov Yaroslavl State University, 2012.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii, “Inequalities for the norms of interpolation projectors,” Modeling and Analysis of Information Systems., vol. 15, no. 3, pp. 28–37, 2008.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii, “Inequalities for the norms of interpolation projectors,” Modeling and Analysis of Information Systems., vol. 15, no. 3, pp. 28–37, 2008.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">M. Hall Jr., Combinatorial Theory. Blaisdall Publishing Company, 1967.</mixed-citation><mixed-citation xml:lang="en">M. Hall Jr., Combinatorial Theory. Blaisdall Publishing Company, 1967.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">K. J. Horadam, Hadamard Matrices and Their Applications. Princeton University Press, 2007.</mixed-citation><mixed-citation xml:lang="en">K. J. Horadam, Hadamard Matrices and Their Applications. Princeton University Press, 2007.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">P. K. Manjhi and M. K. Rama, “Some new examples of circulant partial Hadamard matrices of type $4 - H(ktimes n)$,” Advances and Applications in Mathe-matical Sciences, vol. 21, no. 5, pp. 2559–2564, 2022.</mixed-citation><mixed-citation xml:lang="en">P. K. Manjhi and M. K. Rama, “Some new examples of circulant partial Hadamard matrices of type $4 - H(ktimes n)$,” Advances and Applications in Mathe-matical Sciences, vol. 21, no. 5, pp. 2559–2564, 2022.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">M. Hudelson, V. Klee, and D. Larman, “Largest j-simplices in d-cubes: some relatives of the Hadamard maximum determinant problem,” Linear Algebra and its Applications, vol. 241--243, pp. 519–598, 1996.</mixed-citation><mixed-citation xml:lang="en">M. Hudelson, V. Klee, and D. Larman, “Largest j-simplices in d-cubes: some relatives of the Hadamard maximum determinant problem,” Linear Algebra and its Applications, vol. 241--243, pp. 519–598, 1996.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">J. Hadamard, “ R'esolution d'une question relative aux d'eterminants,” Bulletin des Sciences Mathématiques, vol. 2, pp. 240–246, 1893.</mixed-citation><mixed-citation xml:lang="en">J. Hadamard, “ R'esolution d'une question relative aux d'eterminants,” Bulletin des Sciences Mathématiques, vol. 2, pp. 240–246, 1893.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">G. F. Clements and B. Lindstr"om, “A sequence of $(pm 1)$ determinants with large values,” Proceedings of the American Mathematical Society, vol. 16, no. 3, pp. 548–550, 1965.</mixed-citation><mixed-citation xml:lang="en">G. F. Clements and B. Lindstr"om, “A sequence of $(pm 1)$ determinants with large values,” Proceedings of the American Mathematical Society, vol. 16, no. 3, pp. 548–550, 1965.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">G. M. Fikhtengol'ts, Kurs Differencial'nogo i Integral'nogo Ischisleniya. Tom 3. Moskva: Fizmatlit, 2001.</mixed-citation><mixed-citation xml:lang="en">G. M. Fikhtengol'ts, Kurs Differencial'nogo i Integral'nogo Ischisleniya. Tom 3. Moskva: Fizmatlit, 2001.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">L. Fejes T'ot, Regular Figures. New York: Macmillan/Pergamon, 1964.</mixed-citation><mixed-citation xml:lang="en">L. Fejes T'ot, Regular Figures. New York: Macmillan/Pergamon, 1964.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">D. Slepian, “The content of some extreme simplices,” Pacific Journal of Mathematics, vol. 31, pp. 795–808, 1969.</mixed-citation><mixed-citation xml:lang="en">D. Slepian, “The content of some extreme simplices,” Pacific Journal of Mathematics, vol. 31, pp. 795–808, 1969.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">D. Vandev, “A minimal volume ellipsoid around a simplex,” Proceedings of the Bulgarian Academy of Sciences, vol. 45, no. 6, pp. 37–40, 1992.</mixed-citation><mixed-citation xml:lang="en">D. Vandev, “A minimal volume ellipsoid around a simplex,” Proceedings of the Bulgarian Academy of Sciences, vol. 45, no. 6, pp. 37–40, 1992.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">M. Lassak, “Approximation of convex bodies by inscribed simplices of maximum volume,” Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry, vol. 52, pp. 389–394, 2011, doi: 10.1007/s13366-011-0026-x.</mixed-citation><mixed-citation xml:lang="en">M. Lassak, “Approximation of convex bodies by inscribed simplices of maximum volume,” Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry, vol. 52, pp. 389–394, 2011, doi: 10.1007/s13366-011-0026-x.</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">P. K. Suetin, Klassicheskie ortogonal'nye mnogochleny. Nauka, 1979.</mixed-citation><mixed-citation xml:lang="en">P. K. Suetin, Klassicheskie ortogonal'nye mnogochleny. Nauka, 1979.</mixed-citation></citation-alternatives></ref><ref id="cit26"><label>26</label><citation-alternatives><mixed-citation xml:lang="ru">G. Szeg"o, Orthogonal Polynomials. American Mathematical Society: Providence, 1975.</mixed-citation><mixed-citation xml:lang="en">G. Szeg"o, Orthogonal Polynomials. American Mathematical Society: Providence, 1975.</mixed-citation></citation-alternatives></ref><ref id="cit27"><label>27</label><citation-alternatives><mixed-citation xml:lang="ru">A. P. Prudnikov, Y. A. Brychkov, and O. I. Marichev, Integraly i Ryady. Nauka, 2002.</mixed-citation><mixed-citation xml:lang="en">A. P. Prudnikov, Y. A. Brychkov, and O. I. Marichev, Integraly i Ryady. Nauka, 2002.</mixed-citation></citation-alternatives></ref><ref id="cit28"><label>28</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii, “Geometric estimates in interpolation on an n-dimensional ball,” Modeling and Analysis of Information Systems, vol. 26, no. 3, pp. 441–449, 2019, doi: 10.18255/1818-1015-2019-3-441-449.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii, “Geometric estimates in interpolation on an n-dimensional ball,” Modeling and Analysis of Information Systems, vol. 26, no. 3, pp. 441–449, 2019, doi: 10.18255/1818-1015-2019-3-441-449.</mixed-citation></citation-alternatives></ref><ref id="cit29"><label>29</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii, “On the minimal norm of the projection operator for linear interpolation on an n-dimensional ball,” Matematicheskie Zametki, vol. 114, no. 3, pp. 477–480, 2023, doi: 10.4213/mzm14044.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii, “On the minimal norm of the projection operator for linear interpolation on an n-dimensional ball,” Matematicheskie Zametki, vol. 114, no. 3, pp. 477–480, 2023, doi: 10.4213/mzm14044.</mixed-citation></citation-alternatives></ref><ref id="cit30"><label>30</label><citation-alternatives><mixed-citation xml:lang="ru">H. Bauer, “Minimalstellen von Funktionen und Extremal punkte,” Archiv der Mathematik, vol. 9, no. 4, pp. 389–393, 1958, doi: 10.1023/A:1018977404843.</mixed-citation><mixed-citation xml:lang="en">H. Bauer, “Minimalstellen von Funktionen und Extremal punkte,” Archiv der Mathematik, vol. 9, no. 4, pp. 389–393, 1958, doi: 10.1023/A:1018977404843.</mixed-citation></citation-alternatives></ref><ref id="cit31"><label>31</label><citation-alternatives><mixed-citation xml:lang="ru">M. Nevskii, “Properties of axial diameters of a simplex,” Discrete &amp; Computational Geometry , vol. 46, no. 2, pp. 301–312, 2011, doi: 10.1007/s00454-011-9355-7.</mixed-citation><mixed-citation xml:lang="en">M. Nevskii, “Properties of axial diameters of a simplex,” Discrete &amp; Computational Geometry , vol. 46, no. 2, pp. 301–312, 2011, doi: 10.1007/s00454-011-9355-7.</mixed-citation></citation-alternatives></ref><ref id="cit32"><label>32</label><citation-alternatives><mixed-citation xml:lang="ru">M. Nevskii and A. Ukhalov, “Perfect simplices in R⁵,” Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry, vol. 59, no. 3, pp. 501–521, 2018, doi: 10.1007/s13366-018-0386-6.</mixed-citation><mixed-citation xml:lang="en">M. Nevskii and A. Ukhalov, “Perfect simplices in R⁵,” Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry, vol. 59, no. 3, pp. 501–521, 2018, doi: 10.1007/s13366-018-0386-6.</mixed-citation></citation-alternatives></ref><ref id="cit33"><label>33</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii, “On a certain relation for the minimal norm of an interpolation projector,” Modeling and Analysis of Information Systems., vol. 16, no. 1, pp. 24–43, 2009.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii, “On a certain relation for the minimal norm of an interpolation projector,” Modeling and Analysis of Information Systems., vol. 16, no. 1, pp. 24–43, 2009.</mixed-citation></citation-alternatives></ref><ref id="cit34"><label>34</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii, “On some estimate for the norm of an interpolation projector,” Modeling and Analysis of Information Systems, vol. 29, no. 2, pp. 92–103, 2022, doi: 10.18255/1818-1015-2022-2-92-103.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii, “On some estimate for the norm of an interpolation projector,” Modeling and Analysis of Information Systems, vol. 29, no. 2, pp. 92–103, 2022, doi: 10.18255/1818-1015-2022-2-92-103.</mixed-citation></citation-alternatives></ref><ref id="cit35"><label>35</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii and A. Y. Ukhalov, Izbrannye Zadachi Analiza i Vychislitel'noj Geometrii. Chast' 2. P. G. Demidov Yaroslavl State University, 2022.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii and A. Y. Ukhalov, Izbrannye Zadachi Analiza i Vychislitel'noj Geometrii. Chast' 2. P. G. Demidov Yaroslavl State University, 2022.</mixed-citation></citation-alternatives></ref><ref id="cit36"><label>36</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii and A. Y. Ukhalov, “On optimal interpolation by linear functions on an n-dimensional cube,” Modeling and Analysis of Information Systems, vol. 25, no. 3, pp. 291–311, 2018, doi: 10.18255/1818-1015-2018-3-291-311.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii and A. Y. Ukhalov, “On optimal interpolation by linear functions on an n-dimensional cube,” Modeling and Analysis of Information Systems, vol. 25, no. 3, pp. 291–311, 2018, doi: 10.18255/1818-1015-2018-3-291-311.</mixed-citation></citation-alternatives></ref><ref id="cit37"><label>37</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii, “On some problems for a simplex and a ball in Rⁿ,” Modeling and Analysis of Information Systems, vol. 25, no. 6, pp. 680–691, 2018, doi: 10.18255/1818-1015-2018-6-680-691.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii, “On some problems for a simplex and a ball in Rⁿ,” Modeling and Analysis of Information Systems, vol. 25, no. 6, pp. 680–691, 2018, doi: 10.18255/1818-1015-2018-6-680-691.</mixed-citation></citation-alternatives></ref><ref id="cit38"><label>38</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii and A. Y. Ukhalov, “Linear interpolation on a Euclidean ball in Rⁿ,” Modeling and Analysis of Information Systems, vol. 26, no. 2, pp. 279–296, 2019, doi: 10.18255/1818-1015-2019-2-279-296.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii and A. Y. Ukhalov, “Linear interpolation on a Euclidean ball in Rⁿ,” Modeling and Analysis of Information Systems, vol. 26, no. 2, pp. 279–296, 2019, doi: 10.18255/1818-1015-2019-2-279-296.</mixed-citation></citation-alternatives></ref><ref id="cit39"><label>39</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii, “On properties of a regular simplex inscribed into a ball,” Modeling and Analysis of Information Systems, vol. 28, no. 2, pp. 186–197, 2021, doi: 10.18255/1818-1015-2021-2-186-197.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii, “On properties of a regular simplex inscribed into a ball,” Modeling and Analysis of Information Systems, vol. 28, no. 2, pp. 186–197, 2021, doi: 10.18255/1818-1015-2021-2-186-197.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
