Papers
Topics
Authors
Recent
Search
2000 character limit reached

Effective MC-finiteness

Published 14 Feb 2025 in math.CO | (2502.10212v1)

Abstract: An integer sequence (an)<em>nN(a_n)<em>{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)</em>nN(a_n)</em>{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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.