Effective formulas for linear recurrence sequences of integers
Combinatorics
2020-02-28 v1 Number Theory
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.
Cite
@article{arxiv.2002.11964,
title = {Effective formulas for linear recurrence sequences of integers},
author = {Martin Klazar},
journal= {arXiv preprint arXiv:2002.11964},
year = {2020}
}
Comments
13 pages