English

Realizability of Some Combinatorial Sequences

Number Theory 2024-03-01 v2 Combinatorics Dynamical Systems

Abstract

A sequence a=(an)n=1a=(a_n)_{n=1}^\infty of non-negative integers is called realizable if there is a self-map T:XXT:X\to X on a set XX such that ana_n is equal to the number of periodic points of TT in XX of (not necessarily exact) period nn, for all n1n\geq1. The sequence aa is called almost realizable if there exists a positive integer mm such that (man)n=1(ma_n)_{n=1}^\infty 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.

Keywords

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

R2 v1 2026-06-28T08:43:39.557Z