The $(\min,+)$ convolution is a central problem in fine-grained complexity, and it remains open whether it can be computed in truly subquadratic time. We study it through tropical polynomials, where $(\min,+)$ convolution is exactly tropical polynomial multiplication. We introduce the tropical decomposition width, $\operatorname{tdw}(A)$, which measures how finely a tropical polynomial can be decomposed into factors of small degree. We prove two modular convexity theorems showing that bounded tropical decomposition width forces convexity on arithmetic progression subpolynomials. This yields deterministic algorithms for computing $a\otimes b$ in $$O\left(n\max(\operatorname{tdw}(a),\operatorname{tdw}(b))^2\right)$$ when $\max(\operatorname{tdw}(a),\operatorname{tdw}(b))$ is given, and in $$O\left(ne^{\min(\operatorname{tdw}(a),\operatorname{tdw}(b))(1+o(1))}\right)$$ without prior knowledge of the width. Neither algorithm requires a decomposition of the input sequences. The same structural ideas give a randomized algorithm for Multiple-Sequence $(\min,+)$ Convolution: given $k$ sequences of length at most $n$, their convolution can be computed in $$O\left(kn^2\sqrt{\min(k,n)}\log^{1.5}(kn)\right)$$ time, improving the natural $O(k^2n^2)$ bound. Finally, we introduce interpolation algebras for tropical polynomials and show that classes with bounded tropical decomposition width admit interpolation algebras of finite generating rank, whereas distinguishing all tropical polynomials of degree at most $n$ requires generating rank $\lfloor n/2\rfloor+1$. We also prove that tropical decomposition width cannot decrease under any flat $\mathbb T$-algebra extension. Together, these results connect the tractability of $(\min,+)$ convolution with structural rigidity in tropical polynomial multiplication.

翻译：暂无翻译