We discuss three convolution inequalities that are connected to additive combinatorics. Cloninger and the second author showed that for nonnegative f ∈ L 1 (−1/4, 1/4),which is related to g−Sidon sets (1.28 cannot be replaced by 1.52). We prove a dual statement, related to difference bases, and show that for f ∈ L 1 (R),where the constant 1/2 is trivial, 0.42 cannot be replaced by 0.37. This suggests a natural conjecture about the asymptotic structure of g−difference bases. Finally, we show for all functions f ∈ L 1 (R) ∩ L 2 (R),