Jumping succession rules and their generating functions

DOI10.1016/S0012-365X(02)00868-3zbMath1022.05003OpenAlexW2152511644MaRDI QIDQ1408865

Elisa Pergola, Luca Ferrari, Renzo Pinzani, Simone Rinaldi

Publication date: 25 September 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00868-3

zbMATH Keywords

Fibonacci numberssuccession rulerule operatorLucas' identity

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items

From object grammars to ECO systems, Avoiding cross-bifix-free binary words, Recurrence relations, succession rules and the positivity problem, Mixed succession rules: the commutative case, Recurrence Relations, Succession Rules, and the Positivity Problem

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of Baxter permutations
• Dyck path enumeration
• Enumeration of vexillary involutions which are equal to their mirror/complement
• A linear operator approach to succession rules
• An algebraic characterization of the set of succession rules
• Some canonical sequences of integers
• Generating trees and the Catalan and Schröder numbers
• ECO:a methodology for the enumeration of combinatorial objects
• The enumeration of tree-like polyhexes