ℓ^p improving estimates are derived for multilinear forms from all distance graphs with 2, 3, or 4 vertices and from chains and simplexes of arbitrary size in Z^d, with some bounds depending only on vertex count rather than graph structure.
On necklaces inside thin subsets ofR d.Math
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
$\ell^{p}$ improving estimates for multilinear forms motivated by distance graphs
ℓ^p improving estimates are derived for multilinear forms from all distance graphs with 2, 3, or 4 vertices and from chains and simplexes of arbitrary size in Z^d, with some bounds depending only on vertex count rather than graph structure.