Realizability of Some Combinatorial Sequences
Geng-Rui Zhang
School of Mathematical Sciences
Peking University
Beijing 10871
People's Republic of China
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 (m an)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éry 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öder numbers are
not almost realizable.
Full version: pdf,
dvi,
ps,
latex
(Concerned with sequences
A000032
A000041
A000045
A000108
A000110
A000166
A000172
A000225
A000364
A000984
A001003
A001006
A001067
A001263
A001850
A002426
A002445
A002893
A002895
A005258
A005259
A005260
A005725
A006318
A006953
A053175
A054783
A062510
A081085
A122045
A226158.)
Received March 20 2023; revised versions received March 21 2023;
February 26 2024.
Published in Journal of Integer Sequences,
February 28 2024.
Return to
Journal of Integer Sequences home page