DeepAI

AI Chat AI Image Generator AI Video AI Music Generator

On cardinality of the lower sets and universal discretization

08/03/2022

∙

by F. Dai, et al.

∙

∙

A set Q in ℤ_+^d is a lower set if (k_1,…,k_d)∈ Q implies (l_1,…,l_d)∈ Q whenever 0≤ l_i≤ k_i for all i. We derive new and refine known results regarding the cardinality of the lower sets of size n in ℤ_+^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.

F. Dai
7 publications
A. Prymak
2 publications
A. Shadrin
2 publications
V. Temlyakov
12 publications
S. Tikhonov
2 publications

page 1

page 2

page 3

page 4

research

∙ 07/08/2023

On universal sampling recovery in the uniform norm

It is known that results on universal sampling discretization of the squ...

0 V. N. Temlyakov, et al. ∙

research

∙ 01/29/2023

Random points are good for universal discretization

Recently, there was a big progress in studying sampling discretization o...

0 F. Dai, et al. ∙

research

∙ 01/16/2020

Lower density selection schemes via small universal hitting sets with short remaining path length

Universal hitting sets are sets of words that are unavoidable: every lon...

0 Hongyu Zheng, et al. ∙

research

∙ 01/14/2023

Universal discretization and sparse sampling recovery

Recently, it was discovered that for a given function class 𝐅 the error ...

0 F. Dai, et al. ∙

research

∙ 08/19/2019

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs

A set U⊆^2 is n-universal if all n-vertex planar graphs have a planar st...

0 Alexander Choi, et al. ∙

research

∙ 09/21/1999

Reasoning About Common Knowledge with Infinitely Many Agents

Complete axiomatizations and exponential-time decision procedures are pr...

0 Joseph Y. Halpern, et al. ∙

research

∙ 01/02/2022

On universal sampling representation

For the multivariate trigonometric polynomials we study convolution with...

0 V. N. Temlyakov, et al. ∙