On the number of fixed points of the map \gamma

Publication date: 4 February 2021

Abstract: We recursively define a sequence

{F_{n, k}}_{n, k i n m a t h b b N}

and we prove that such sequence contains only the symbols

0, 1 .

We investigate some number-theoretic properties of such sequence and of the way it can be generated. The number

F_{n}

can be interpreted as the number of fixed points of semilength

n

of the map

g a m m a

introduced by Barnabei et al. Our results partially answer conjectures posed by Cori et al.

This page was built for publication: On the number of fixed points of the map $\gamma$