Mixed succession rules: the commutative case

DOI10.1016/J.JCTA.2009.11.005zbMATH Open1231.05008arXiv0806.0799OpenAlexW1966700678WikidataQ60692209 ScholiaQ60692209MaRDI QIDQ965232FDOQ965232

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)

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.

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

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

zbMATH Keywords

Riordan arraygenerating treesuccession ruleECO methodrule operator

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Cites Work

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

Cited In (6)

• A linear operator approach to succession rules
• Jumping succession rules and their generating functions
• Production matrices
• On the equivalence problem for succession rules
• Title not available (Why is that?)
• Title not available (Why is that?)

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)