On the cardinality of lower sets and universal discretization
From MaRDI portal
Publication:6406868
DOI10.1016/J.JCO.2022.101726arXiv2208.02113MaRDI QIDQ6406868FDOQ6406868
Authors: Feng Dai, A. V. Prymak, A. V. Shadrin, V. N. Temlyakov, Sergey Tikhonov
Publication date: 3 August 2022
Abstract: A set in is a lower set if implies whenever for all . We derive new and refine known results regarding the cardinality of the lower sets of size in . Next we apply these results for universal discretization of the -norm of elements from -dimensional subspaces of trigonometric polynomials generated by lower sets.
Numerical integration (65D30) Multidimensional problems (41A63) General theory of numerical analysis in abstract spaces (65J05) Combinatorial aspects of partitions of integers (05A17) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Fourier series and coefficients in several variables (42B05)
This page was built for publication: On the cardinality of lower sets and universal discretization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6406868)