On the cardinality of lower sets and universal discretization
Numerical Analysis
2025-04-15 v2 Numerical Analysis
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.
Keywords
Cite
@article{arxiv.2208.02113,
title = {On the cardinality of lower sets and universal discretization},
author = {F. Dai and A. Prymak and A. Shadrin and V. Temlyakov and S. Tikhonov},
journal= {arXiv preprint arXiv:2208.02113},
year = {2025}
}