Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 50 min ago
PreprintarXiv licencearXiv

Binary dimension-free discretization and polynomial complexification on real cubes

Abstract

Let C(d,2) be the optimal dimension-free ratio between the polytorus and Boolean-cube norms of complex multiaffine polynomials of degree at most d. For every d, C(d,2) equals the unrestricted complexification constant of the real cube for complex polynomials of degree at most d. Moreover, limd→∞C(d,2)1/d=1+√2, and for every d≥3, β(1−6/(5d))(1+√2)d≤ C(d,2)≤(1+√2)d, where β=15π/[2(5√(26)+log(5+√(26)))]=0.8473222863….

Related

  1. Hausdorff-Young inequalities for SU(1,1) Fourier products indexed by binary cubes
    Tonći Crmarić, Jelena Rupčić
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  2. Dimension-free estimates for discrete maximal functions over cubes in ℤd
    Mariusz Mirek, Tomasz Z. Szarek, Błażej Wróbel
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  3. Besov and Triebel--Lizorkin Spaces on Filtered Lie Groups with Polynomial Growth, I: Inclusions, Discretization, Duality
    Mattia Calzi
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  4. Randomly shifted lattice rules for SDEs with constant diffusion: error bounds uniform in time discretization and dimension
    Du Ouyang, Josef Dick, Ziyang Ye
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  5. A Dimension Estimate for Polynomial Growth Holomorphic Functions
    Haohao Wang
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
BibTeX
@misc{castanomarin2026binary,
  title = {{Binary dimension-free discretization and polynomial complexification on real cubes}},
  author = {Luis Miguel Castaño-Marín and Daniel Núñez-Alarcón and Joedson Santos},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.30587},
  eprint = {2609.30587},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.30587},
}
RIS
TY  - UNPB
TI  - Binary dimension-free discretization and polynomial complexification on real cubes
AU  - Luis Miguel Castaño-Marín
AU  - Daniel Núñez-Alarcón
AU  - Joedson Santos
PY  - 2026
DA  - 2026/09/24
PB  - arXiv
DO  - 10.48550/arxiv.2609.30587
UR  - https://arxiv.org/abs/2609.30587
AB  - Let C(d,2) be the optimal dimension-free ratio between the polytorus and Boolean-cube norms of complex multiaffine polynomials of degree at most d. For every d, C(d,2) equals the unrestricted complexification constant of the real cube for complex polynomials of degree at most d. Moreover, lim_d→∞C(d,2)^1/d=1+√2, and for every d≥3, β(1−6/(5d))(1+√2)^d≤ C(d,2)≤(1+√2)^d, where β=15π/[2(5√(26)+log(5+√(26)))]=0.8473222863….
ER  -