Realizability of Some Combinatorial Sequences
Number Theory
2024-03-01 v2 Combinatorics
Dynamical Systems
Abstract
A sequence of non-negative integers is called realizable if there is a self-map on a set such that is equal to the number of periodic points of in of (not necessarily exact) period , for all . The sequence is called almost realizable if there exists a positive integer such that 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.
Cite
@article{arxiv.2302.09454,
title = {Realizability of Some Combinatorial Sequences},
author = {Geng-Rui Zhang},
journal= {arXiv preprint arXiv:2302.09454},
year = {2024}
}
Comments
25 pages