Enumerating permutations avoiding three Babson-Steingrímsson patterns (Q2576462): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Luca Ferrari / rank
Normal rank
 
Property / author
 
Property / author: Renzo Pinzani / rank
Normal rank
 
Property / author
 
Property / author: Luca Ferrari / rank
 
Normal rank
Property / author
 
Property / author: Renzo Pinzani / 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.1007/s00026-005-0246-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079143604 / rank
 
Normal rank

Latest revision as of 20:57, 19 March 2024

scientific article
Language Label Description Also known as
English
Enumerating permutations avoiding three Babson-Steingrímsson patterns
scientific article

    Statements

    Enumerating permutations avoiding three Babson-Steingrímsson patterns (English)
    0 references
    0 references
    0 references
    0 references
    13 December 2005
    0 references
    generalized patterns avoidance
    0 references
    succession rules
    0 references
    Fibonacci and Motzkin numbers
    0 references

    Identifiers