A linear operator approach to succession rules (Q1601633): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Renzo Pinzani / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Andreas N. Philippou / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Catalan-like numbers and determinants / rank
 
Normal rank
Property / cites work
 
Property / cites work: ECO:a methodology for the enumeration of combinatorial objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive matrices and umbral calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of Baxter permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operator expansion in the derivative and multiplication by<i>x</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic characterization of the set of succession rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating trees and proper Riordan arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Riordan group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating trees and forbidden subsequences / rank
 
Normal rank

Latest revision as of 10:19, 4 June 2024

scientific article
Language Label Description Also known as
English
A linear operator approach to succession rules
scientific article

    Statements

    A linear operator approach to succession rules (English)
    0 references
    0 references
    0 references
    27 June 2002
    0 references
    Among the methods commonly applied in enumerative combinatorics to count combinatorial structures, especially with some restrictive conditions, the enumeration of combinatorial objects (ECO) method is a technique widely used. See, e.g., \textit{E. Barcucci}, \textit{A. Del Lungo}, \textit{E. Pergola} and \textit{R. Pinzani} [J. Difference Equ. Appl. 5, 435-490 (1999; Zbl 0944.05005)]. The authors of the present paper give an algebraic version of the ECO method, and of succession rules in general, by means of linear operators. Then they translate some known results about the relationship between ECO-systems and generating functions into their present language. Finally, they deal with the problem of standard form for succession rules, giving a general solution, which is a compact expression for the desired standard form.
    0 references
    enumerative combinatorics
    0 references
    enumeration of combinatorial objects
    0 references
    generating functions
    0 references

    Identifiers