On the cardinality of lower sets and universal discretization
Preprint
Abstract
A set $Q$ in $\mathbb{Z}_+^d$ is a lower set if $(k_1,\dots,k_d)\in Q$ implies $(l_1,\dots,l_d)\in Q$ whenever $0\le l_i\le k_i$ for all $i$. We derive new and refine known results regarding the cardinality of the lower sets of size $n$ in $\mathbb{Z}_+^d$. Next we apply these results for universal discretization of the $L_2$-norm of elements from $n$-dimensional subspaces of trigonometric polynomials generated by lower sets.
Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Sampling discretization and related problemsJournal of Complexity, 2022
- Polynomial Approximation of Anisotropic Analytic Functions of Several VariablesConstructive Approximation, 2020
- The Marcinkiewicz-Type Discretization TheoremsConstructive Approximation, 2018
- Discrete Least-Squares Approximations over Optimized Downward Closed Polynomial Spaces in Arbitrary DimensionConstructive Approximation, 2017
- Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index setsJournal of Approximation Theory, 2015
- Estimating the Asymptotics of Solid PartitionsJournal of Statistical Physics, 2014
- Multivariate polynomial interpolation on lower setsJournal of Approximation Theory, 2014
- High-Dimensional Adaptive Sparse Polynomial Interpolation and Applications to Parametric PDEsFoundations of Computational Mathematics, 2013
- Notes on higher-dimensional partitionsJournal of Combinatorial Theory, Series A, 2013
- Simple upper bounds for partition functionsThe Ramanujan Journal, 2007