A technology for reverse-engineering a combinatorial problem from a rational generating function (Q5933434): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/aama.2000.0711 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963721416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial interpretation of the recurrence \(f_{n+1}=6f_n-f_{n-1}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succession rules and Deco polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed column-convex polyominoes by recurrence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-height of an N-rational series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Maps are Well Labeled Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic languages and polyominoes enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective asymptotics of linear recurrences with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic complexity of computing polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial interpretation of the area of Schröder paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On positive matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4834167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive rational sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bijective recurrences concerning Schröder paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating trees and the Catalan and Schröder numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-avoiding walks, the language of science, and Fibonacci numbers / rank
 
Normal rank

Latest revision as of 16:16, 3 June 2024

scientific article; zbMATH DE number 1598992
Language Label Description Also known as
English
A technology for reverse-engineering a combinatorial problem from a rational generating function
scientific article; zbMATH DE number 1598992

    Statements

    A technology for reverse-engineering a combinatorial problem from a rational generating function (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 May 2002
    0 references
    generating function
    0 references
    context-free language
    0 references
    regular language
    0 references
    combinatorial interpretation
    0 references
    linear recurrence
    0 references
    enumeration
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references