Another look at bijections for pattern-avoiding permutations (Q990769): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: AARON / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.aam.2010.03.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034034747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wilf-equivalence for singleton classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bijections for pattern-avoiding permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decreasing subsequences in permutations and Wilf equivalence for involutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bijections for refined restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutations with restricted patterns and Dyck paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted permutations from Catalan to Fine and back / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined restricted permutations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 03:10, 3 July 2024

scientific article
Language Label Description Also known as
English
Another look at bijections for pattern-avoiding permutations
scientific article

    Statements

    Another look at bijections for pattern-avoiding permutations (English)
    0 references
    0 references
    1 September 2010
    0 references
    bijection
    0 references
    pattern-avoiding permutations
    0 references
    templates
    0 references
    fixed-points
    0 references
    excedances
    0 references

    Identifiers