Establishes the dimension-free bound |A+B| >= (|A||B|)^{log4/log6} for A subset of {0,1}^d and B subset of {0..m}^d, sharp for m>=2.
Duke Math
2 Pith papers cite this work, alongside 177 external citations. Polarity classification is still indexing.
2
Pith papers citing it
177
external citations · OpenAlex
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Proves the stated max-convolution inequality for geometric blocks and two-term sequences via Stolarsky mean comparison, implying an affirmative answer to the BDFKK question.
citing papers explorer
-
Geometric Block Exponents and a Uniform Mixed-Alphabet Sumset Inequality
Establishes the dimension-free bound |A+B| >= (|A||B|)^{log4/log6} for A subset of {0,1}^d and B subset of {0..m}^d, sharp for m>=2.
-
Stolarsky-Type Inequalities in a Max-Convolution Problem
Proves the stated max-convolution inequality for geometric blocks and two-term sequences via Stolarsky mean comparison, implying an affirmative answer to the BDFKK question.