English

Effective MC-finiteness

Combinatorics 2025-02-17 v1

Abstract

An integer sequence (an)nN(a_n)_{n \in \mathbb{N}} is \emph{MC-finite} if for all mm, the sequence anmodma_n \bmod m is eventually periodic. There are MC-finite sequences (an)nN(a_n)_{n \in \mathbb{N}} such that the function F:(m,n)anmodmF: (m,n) \mapsto a_n \bmod m 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 FF. In this paper we discuss cases when this FF 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

R2 v1 2026-06-28T21:44:30.480Z