PublicationsPapers

Effective MC-finiteness

Yuval Filmus, Eldar Fischer, Johann A. Makowsky

An integer sequence $(a_n)_{n \in \mathbb{N}}$ is MC-finite if for all $m$, the sequence $a_n \bmod m$ is eventually periodic. There are MC-finite sequences such that $a_n \bmod m$ is not computable (as a function of both $n,m$). We discuss some cases in which this function is computable.

See also our previous paper on the topic.

BibTeX

@inbook{FFM26,
author = {Filmus, Yuval and Fischer, Eldar and Makowsky, Johann A.},
booktitle = {Sum(m)it280: Surveys in Extremal Combinatorics and Combinatorial Geometry},
doi = {10.1007/978-3-032-18810-6_8},
editor = {Katona, Gyula O. H. and Patk{\'o}s, Bal{\'a}zs and Tompkins, Casey},
isbn = {978-3-032-18810-6},
pages = {161--171},
publisher = {Springer Nature Switzerland},
title = {Effective MC-Finiteness},
url = {https://doi.org/10.1007/978-3-032-18810-6_8},
year = {2026}}

copy to clipboard

back to index