2020/02/27 by Martin Klazar, Klazar, Martin
Computer Science · Engineering · Mathematics · #05A15 #11B37 #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT) #graph theory and CDMA systems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2002.11964
openalex publication_date 2020/02/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.