Jumping succession rules and their generating functions

DOI10.1016/S0012-365X(02)00868-3zbMATH Open1022.05003OpenAlexW2152511644MaRDI QIDQ1408865FDOQ1408865

S. Rinaldi, E. Pergola, L. Ferrari, R. Pinzani

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The On-Line Encyclopedia of Integer Sequences
• The enumeration of tree-like polyhexes
• Generating trees and the Catalan and Schröder numbers
• Dyck path enumeration
• Some canonical sequences of integers
• ECO:a methodology for the enumeration of combinatorial objects
• The number of Baxter permutations
• An algebraic characterization of the set of succession rules
• Enumeration of vexillary involutions which are equal to their mirror/complement
• A linear operator approach to succession rules

Cited In (7)

• A linear operator approach to succession rules
• Mixed succession rules: the commutative case
• Recurrence Relations, Succession Rules, and the Positivity Problem
• Recurrence relations, succession rules and the positivity problem
• Avoiding cross-bifix-free binary words
• From object grammars to ECO systems
• An algebraic characterization of the set of succession rules

Uses Software

• OEIS

This page was built for publication: Jumping succession rules and their generating functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1408865)