Self-describing sequences and the Catalan family tree

zbMATH Open1028.05006arXivmath/0305319MaRDI QIDQ1408545FDOQ1408545

Authors: Zoran Šuniḱ 

Publication date: 24 September 2003

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/math/0305319

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 1919518
• Increasing self-described sequences
• scientific article; zbMATH DE number 5068439
• SOME TREELIKE OBJECTS
• Sur les polynômes de Catalan simples et doubles. (On simple and double Catalan polynomials)

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Calculation of integer sequences (11Y55)

Cited In (7)

• Combinatorics on partial word borders
• Title not available (Why is that?)
• 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

Uses Software

• OEIS

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)