The lattice bump multiplier problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3A10456397" target="_blank" >RIV/00216208:11320/22:10456397 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=.qCQCZ.TMl" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=.qCQCZ.TMl</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4064/sm201219-18-4" target="_blank" >10.4064/sm201219-18-4</a>
Alternative languages
Result language
angličtina
Original language name
The lattice bump multiplier problem
Original language description
We study the lattice bump multiplier problem. Precisely, given a smoothbump supported in a ball centered at the origin, we consider the multiplier formed byadding the translations of this bump centered at N distinct lattice points. We investigatethe dependence on N of the Lp norm of the linear and bilinear operators associated withthis multiplier. We obtain sharp dependence on N in the linear case and in the bilinearcase when p > 1.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GA18-07996S" target="_blank" >GA18-07996S: Geometric and Harmonic Analysis</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Studia Mathematica
ISSN
0039-3223
e-ISSN
—
Volume of the periodical
262
Issue of the periodical within the volume
2
Country of publishing house
PL - POLAND
Number of pages
16
Pages from-to
225-240
UT code for WoS article
000697477000001
EID of the result in the Scopus database
—