Realizability of Some Combinatorial Sequences

Abstract

A sequence a=(an)n=1∞ of non-negative integers is called realizable if there is a self-map T:X X on a set X such that an is equal to the number of periodic points of T in X of (not necessarily exact) period n, for all n≥1. The sequence a is called almost realizable if there exists a positive integer m such that (man)n=1∞ is realizable. In this article, we show that certain wide classes of integer sequences are realizable, which contain many famous combinatorial sequences, such as the sequences of Ap\'ery numbers of both kinds, central Delannoy numbers, Franel numbers, Domb numbers, Zagier numbers, and central trinomial coefficients. We also show that the sequences of Catalan numbers, Motzkin numbers, and large and small Schr\"oder numbers are not almost realizable.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…