Assess whether guessing elements of M0 is more efficient than guessing full recurrences

Ascertain whether employing a guessing-based ansatz to construct elements of the zero-sum submodule M0 is computationally more efficient than guessing full recurrences for the sequence a(n) = Σk h(n,k), and characterize when such an approach yields practical advantages.

Background

Guessing (via linear algebra on evaluation data) can produce recurrences but may be large and computationally heavy.

The authors suggest instead targeting elements of M0 via guessing, which might be easier to find and still suffice to reduce the telescoper to the minimal recurrence.