Mixed succession rules: the commutative case

DOI10.1016/J.JCTA.2009.11.005MaRDI QIDQ965232zbMATHOpenAlexWikidataFDO

Authors S. Bacchelli, L. Ferrari, R. Pinzani, Renzo Sprugnoli

Publication date 21 April 2010

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

Riordan arraygenerating treesuccession ruleECO methodrule operator

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Abstract: We begin a systematic study of the enumerative combinatorics of mixed succession rules, which are succession rules such that, in the associated generating tree, the nodes are allowed to produce their sons at several different levels according to different production rules. Here we deal with a specific case, namely that of two different production rules whose rule operators commute. In this situation, we are able to give a general formula expressing the sequence associated with the mixed succession rules in terms of the sequences associated with the component production rules. We end by providing some examples illustrating our approach.

Recommendations

• Jumping succession rules and their generating functions
• Production matrices
• An algebraic characterization of the set of succession rules
• scientific article; zbMATH DE number 1919535
• On the equivalence problem for succession rules

Cites work

• scientific article; zbMATH DE number 1522334 (Why is no real title available?)
• A general exhaustive generation algorithm for Gray structures
• A linear operator approach to succession rules
• An algebraic characterization of the set of succession rules
• Analytic combinatorics
• ECO:a methodology for the enumeration of combinatorial objects
• Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
• Generating trees and proper Riordan arrays
• Generating trees and the Catalan and Schröder numbers
• Jumping succession rules and their generating functions
• Left-inversion of combinatorial sums
• Level generating trees and proper Riordan arrays
• On the foundations of combinatorial theory. VIII: Finite operator calculus
• Random generation of trees and other combinatorial objects
• Riordan arrays and combinatorial sums
• Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method.
• The On-Line Encyclopedia of Integer Sequences
• The number of Baxter permutations
• Vexillary involutions are enumerated by Motzkin numbers

Cited in

(6)

• Production matrices
• On the equivalence problem for succession rules
• scientific article; zbMATH DE number 1919535 (Why is no real title available?)
• A linear operator approach to succession rules
• scientific article; zbMATH DE number 939786 (Why is no real title available?)
• Jumping succession rules and their generating functions

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Mixed succession rules: the commutative case

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