2025/05/28 by Cornelius Brand, Brand, Cornelius, Radu Curticapean +5 · 2 citations
Computer Science · #Stochastic Gradient Optimization Techniques #Complexity and Algorithms in Graphs #Polynomial and algebraic computation
paper · pdf · doi:10.48550/arxiv.2505.22410
Given two vectors u,v ∈ ℚD over a finite domain D and a function f : D× D→ D, the convolution problem asks to compute the vector w ∈ ℚD whose entries are defined by w(d) = ∑_\substackx,y ∈ D f(x,y)=d u(x)v(y). In parameterized and exponential-time algorithms, convolutions on product domains are particularly prominent: Here, a finite domain B and a function h : B × B → B are fixed, and convolution is done over the product domain D = Bk, using the function hk :D × D→ D that applies h coordinate-wise to its input tuples. We present a new perspective on product-domain convolutions through multilinear algebra. This viewpoint streamlines the presentation and analysis of existing algorithms, such as those by van Rooij et al. (ESA 2009). Moreover, using established results from the theory of fast matrix multiplication, we derive improved O^∗(|B|2ω/3 ⋅ k) = O(|D|1.582) time algorithms, improving upon previous upper bounds by Esmer et al. (Algorithmica 86(1), 2024) of the form ck |B|2k for c < 1. Using the setup described in this note, Strassen's asymptotic rank conjecture from algebraic complexity theory would imply quasi-linear |D|1+o(1) time algorithms. This conjecture has recently gained attention in the algorithms community. (Björklund-Kaski and Pratt, STOC 2024, Björklund et al., SODA 2025) Our paper is intended as a self-contained exposition for an algorithms audience, and it includes all essential mathematical prerequisites with explicit coordinate-based notation. In particular, we assume no knowledge in abstract algebra.