Self-describing sequences and the Catalan family tree
| dc.creator | Sunik, Zoran | |
| dc.date | 2003-05-22 | |
| dc.date.accessioned | 2026-07-07T04:58:11Z | |
| dc.date.available | 2026-07-07T04:58:11Z | |
| dc.description | 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. | |
| dc.description | 9 pages, 2 figures. submitted to Electronic Journal of Combinatorics | |
| dc.identifier | https://arxiv.org/abs/math/0305319 | |
| dc.identifier | http://arxiv.org/abs/math/0305319 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/67537 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15; 05C05; 11Y55 | |
| dc.title | Self-describing sequences and the Catalan family tree | |
| dc.type | text |