Journal of Complexity
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
Main page
About this project
Software
Classifications
Links
Terms of Use

Search papers
Search references

RSS
Current issues
Archive issues
What is RSS






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Journal of Complexity, 2023, Volume 76, 101726
DOI: https://doi.org/10.1016/j.jco.2022.101726
 

This article is cited in 1 scientific paper (total in 1 paper)

On the cardinality of lower sets and universal discretization

F. Daia, A. Prymakb, A. Yu. Shadrinc, V. N. Temlyakovdefg, S. Yu. Tikhonovhij

a Department of Mathematical and Statistical Sciences, University of Alberta Edmonton, Alberta T6G 2G1, Canada
b Department of Mathematics, University of Manitoba, Winnipeg, MB, R3T 2N2, Canada
c Department of Mathematics and Theoretical Physics, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA, UK
d d University of South Carolina, 1523 Greene St., Columbia SC, 29208, USA
e Steklov Institute of Mathematics, Russian Federation
f Moscow Center for Fundamental and Applied Mathematics, Russian Federation
g Lomonosov Moscow State University, Russian Federation
h ICREA, Pg. Lluís Companys 23, 08010 Barcelona, Spain
i Universitat Autònoma de Barcelona, Spain
j Centre de Recerca Matemàtica, Campus de Bellaterra, Edifici C, 08193 Bellaterra (Barcelona), Spain
Citations (1)
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: Lower sets; Downward closed sets; Integer partitions; Universal discretization; Multivariate trigonometric polynomials.
Funding agency Grant number
Natural Sciences and Engineering Research Council of Canada (NSERC) RGPIN-2020-03909
RGPIN-2020-05357
Ministry of Education and Science of the Russian Federation 14.W03.31.0031
Ministerio de Ciencia e Innovación de España PID2020-114948GB-I00
Agencia Estatal de Investigacion CEX2020-001084-M
Ministry of Education and Science of the Republic of Kazakhstan AP09260223
The first named author’s research was partially supported by NSERC of Canada Discovery Grant RGPIN-2020-03909. The second named author’s research was partially supported by NSERC of Canada Discovery Grant RGPIN-2020-05357. The fourth named author’s research was supported by the Russian Federation Government Grant No. 14.W03.31.0031. The fifth named author’s research was partially supported by PID2020-114948GB-I00, 2017 SGR 358, the CERCA Programme of the Generalitat de Catalunya, Severo Ochoa and María de Maeztu Program for Centers and Units of Excellence in R&D (CEX2020-001084-M), Ministry of Education and Science of the Republic of Kazakhstan (AP09260223).
Received: 03.08.2022
Revised: 19.12.2022
Accepted: 22.12.2022
Bibliographic databases:
Document Type: Article
MSC: Primary 65J05; Secondary 05A17; 42B05; 65D30; 41A17; 41A63
Language: English
Linking options:
  • https://www.mathnet.ru/eng/jcomp10
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:25
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024