Production matrices
From MaRDI portal
Publication:1775729
Succession rules have been suggested as a way to generate combinatorial objects of a certain description. This paper studies two types of matrices that can be associated with a succession rule, the production matrix and the ECO (= Enumeration of Combinatorial Objects) matrix. These matrices are intimately connected to the generating functions of the sequences enumerating the combinatorial objects.
Recommendations
Cites work
- A linear operator approach to succession rules
- A methodology for plane tree enumeration
- An algebraic characterization of the set of succession rules
- Approximating algebraic functions by means of rational ones
- Catalan-like numbers and determinants
- Combinatorial aspects of continued fractions
- ECO:a methodology for the enumeration of combinatorial objects
- Exhaustive generation of combinatorial objects by ECO
- Generating functions for generating trees
- Generating trees and forbidden subsequences
- Generating trees and proper Riordan arrays
- Generating trees and the Catalan and Schröder numbers
- scientific article; zbMATH DE number 1577990 (Why is no real title available?)
- scientific article; zbMATH DE number 2040945 (Why is no real title available?)
- scientific article; zbMATH DE number 1522328 (Why is no real title available?)
- scientific article; zbMATH DE number 1552332 (Why is no real title available?)
- scientific article; zbMATH DE number 815575 (Why is no real title available?)
- scientific article; zbMATH DE number 3390782 (Why is no real title available?)
- On some new sequences generalizing the Catalan and Motzkin numbers
- Pascal triangles, Catalan numbers and renewal arrays
- Random generation of trees and other combinatorial objects
- Recursive matrices and umbral calculus
- Riordan arrays and combinatorial sums
- Some canonical sequences of integers
- The enumeration of tree-like polyhexes
- The number of Baxter permutations
- The On-Line Encyclopedia of Integer Sequences
- The Riordan group
Cited in
(53)- Jumping succession rules and their generating functions
- Characteristic polynomials of production matrices for geometric graphs
- Bijections of Motzkin paths using shifted Riordan decompositions
- Sequence characterizations of double Riordan arrays and their compressions
- New results on production matrices for geometric graphs
- From object grammars to ECO systems
- Restricted simsun permutations
- Bijective proofs of recurrences involving two Schröder triangles
- A generalized ordered Bell polynomial
- Lattice paths and branched continued fractions. II: Multivariate Lah polynomials and Lah symmetric functions
- Embedding structures associated with Riordan arrays and moment matrices
- Determinant representations of polynomial sequences of Riordan type
- Some (counter)examples on totally positive Riordan arrays
- A new lower bound on the maximum number of plane graphs using production matrices
- A combinatorial approach to derangement matrix of type \(B\)
- Riordan group involutions
- Restricted signed permutations counted by the Schröder numbers
- On the equivalence problem for succession rules
- New production matrices for geometric graphs
- Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees
- Multiple orthogonal polynomials associated with branched continued fractions for ratios of hypergeometric series
- On the restricted Chebyshev-Boubaker polynomials
- Catalan-like numbers and succession rules
- Generalized Schröder permutations
- An Empirical Analysis of the Product-Process Matrix
- scientific article; zbMATH DE number 1919535 (Why is no real title available?)
- Recurrence relations for the Sheffer sequences
- On a transformation of Riordan moment sequences
- scientific article; zbMATH DE number 6861069 (Why is no real title available?)
- Matrix characterizations of Riordan arrays
- Riordan arrays and \(d\)-orthogonality
- Production matrices for geometric graphs
- Row polynomial matrices of Riordan arrays
- Parametric production matrices and weighted succession rules: a Dyck path example
- Exponential Riordan arrays and Jacobi elliptic functions
- Lattice Paths and Branched Continued Fractions: An Infinite Sequence of Generalizations of the Stieltjes–Rogers and Thron–Rogers Polynomials, with Coefficientwise Hankel-Total Positivity
- Restricting Dyck paths and 312-avoiding permutations
- Production technologies with ratio inputs and outputs
- A simple algorithm for expanding a power series as a continued fraction
- Production matrices and riordan arrays
- Continued fractions for cycle-alternating permutations
- The n-th production matrix of a Riordan array
- The double almost-Riordan group
- Productivity and intermediate products:
- Coefficientwise total positivity and Stieltjes moment properties from Riordan arrays
- Thron-type continued fractions (T-fractions) for some classes of increasing trees
- A linear algebra approach to monomiality and operational methods
- Bidiagonal matrix factorisations related to multiple orthogonal polynomials
- Bidiagonal matrix factorisations associated with symmetric multiple orthogonal polynomials and lattice paths
- A new type of double Riordan arrays
- Abelian networks. II: Halting on all inputs
- Mixed succession rules: the commutative case
- Restricted 123-avoiding Baxter permutations and the Padovan numbers
This page was built for publication: Production matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1775729)
