Self-describing sequences and the Catalan family tree
From MaRDI portal
(Redirected from Publication:1408545)
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 is equal to the number of previous terms that are smaller than . 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.
Recommendations
Cited in
(7)- Combinatorics on partial word borders
- scientific article; zbMATH DE number 1919518 (Why is no real title available?)
- Tamari lattices, forests and Thompson monoids
- Action graphs, rooted planar forests, and self-convolutions of the Catalan numbers
- Increasing self-described sequences
- Hypergraph matrix models and generating functions
- Self-referential derivation
This page was built for publication: Self-describing sequences and the Catalan family tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1408545)