An algebraic characterization of the set of succession rules

DOI10.1016/S0304-3975(02)00020-8zbMath1021.68068MaRDI QIDQ1603697

Simone Rinaldi, Luca Ferrari, Elisa Pergola, Renzo Pinzani

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

succession rules

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items (13)

Restricted simsun permutations ⋮ Recurrence relations, succession rules and the positivity problem ⋮ Jumping succession rules and their generating functions ⋮ Matrix characterizations of Riordan arrays ⋮ Production matrices and riordan arrays ⋮ Finitely labeled generating trees and restricted permutations ⋮ Sequence characterizations of double Riordan arrays and their compressions ⋮ Mixed succession rules: the commutative case ⋮ Production matrices ⋮ Recurrence Relations, Succession Rules, and the Positivity Problem ⋮ On the equivalence problem for succession rules ⋮ Enumeration of L-convex polyominoes by rows and columns ⋮ A linear operator approach to succession rules

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of Baxter permutations
• Some combinatorial interpretations of \(q\)-analogs of Schröder numbers
• Generating functions for generating trees
• Generating trees and the Catalan and Schröder numbers
• ECO:a methodology for the enumeration of combinatorial objects
• ECO method and hill-free generalized Motzkin paths

This page was built for publication: An algebraic characterization of the set of succession rules