Self-describing sequences and the Catalan family tree
classification
🧮 math.CO
keywords
sequencescatalaneveryfixednumberself-describingtransformationtree
read the original abstract
We introduce a transformation of finite integer sequences, show that every sequence eventually stabilizes under this transformation and that the number of fixed points is counted by the Catalan numbers. The sequences that are fixed are precisely those that describe themselves -- every term $t$ is equal to the number of previous terms that are smaller than $t$. In addition, we provide an easy way to enumerate all these self-describing sequences by organizing them in a Catalan tree with a specific labelling system.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.