Effective MC-finiteness
Combinatorics
2025-02-17 v1
Abstract
An integer sequence is \emph{MC-finite} if for all , the sequence is eventually periodic. There are MC-finite sequences such that the function is not computable. In \cite{filmus2023mc} we presented concrete examples of MC-finite sequences taken from the Online Encyclopedia of Integer Sequences (OEIS) without discussing the computability of . In this paper we discuss cases when this is effectively computable.
Keywords
Cite
@article{arxiv.2502.10212,
title = {Effective MC-finiteness},
author = {Yuval Filmus and Eldar Fischer and Johann A. Makowsky},
journal= {arXiv preprint arXiv:2502.10212},
year = {2025}
}
Comments
12 pages