English

On the cardinality of lower sets and universal discretization

Numerical Analysis 2025-04-15 v2 Numerical Analysis

Abstract

A set QQ in Z+d\mathbb{Z}_+^d is a lower set if (k1,,kd)Q(k_1,\dots,k_d)\in Q implies (l1,,ld)Q(l_1,\dots,l_d)\in Q whenever 0liki0\le l_i\le k_i for all ii. We derive new and refine known results regarding the cardinality of the lower sets of size nn in Z+d\mathbb{Z}_+^d. Next we apply these results for universal discretization of the L2L_2-norm of elements from nn-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}
}