Effective formulas for linear recurrence sequences of integers
From MaRDI portal
Abstract: We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be deduced from the Skolem-Mahler-Lech theorem and the Subspace Theorem. We will give details of this deduction that is due to P. Corvaja in the full version of this extended abstract.
This page was built for publication: Effective formulas for linear recurrence sequences of integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6335687)
