We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

math.CO

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Mathematics > Combinatorics

Title: MC-finiteness of restricted set partition functions

Abstract: A sequence $s(n)$ of integers is MC-finite if for every $m \in \mathbb{N}^+$ the sequence $s^m(n) = s(n) \bmod{m}$ is ultimately periodic. We discuss various ways of proving and disproving MC-finiteness. Our examples are mostly taken from set partition functions, but our methods can be applied to many more integer sequences.
Comments: 16 pages, 4 tables
Subjects: Combinatorics (math.CO)
MSC classes: 06A07, 11B30, 05A19
Cite as: arXiv:2302.08265 [math.CO]
  (or arXiv:2302.08265v4 [math.CO] for this version)

Submission history

From: Johann Makowsky [view email]
[v1] Thu, 16 Feb 2023 12:44:02 GMT (20kb)
[v2] Sun, 19 Feb 2023 16:36:29 GMT (20kb)
[v3] Sun, 11 Jun 2023 11:36:10 GMT (29kb)
[v4] Sun, 2 Jul 2023 13:00:51 GMT (29kb)

Link back to: arXiv, form interface, contact.