Using functional equations to enumerate 1324-avoiding permutations (Q402577): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aam.2014.01.006 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: F12345 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: F1234 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962885487 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1309.7117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Upper Bound for 1324-Avoiding Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric functions and P-recursiveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded permutation matrices and the Stanley-Wilf conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting 1324-avoiding permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaches for enumerating permutations with a prescribed number of occurrences of patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Noonan-Zeilberger functional equations to enumerate (in polynomial time!) generalized Wilf classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic values for degrees associated with strips of Young diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some open problems on permutation patterns / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AAM.2014.01.006 / rank
 
Normal rank

Latest revision as of 16:33, 9 December 2024

scientific article
Language Label Description Also known as
English
Using functional equations to enumerate 1324-avoiding permutations
scientific article

    Statements

    Using functional equations to enumerate 1324-avoiding permutations (English)
    0 references
    0 references
    0 references
    28 August 2014
    0 references
    permutation patterns
    0 references
    functional equations
    0 references
    enumeration algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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