Bounds on superpatterns containing all layered permutations (Q2354608): 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: OEIS / 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/s00373-014-1429-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010338007 / 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: Q4821520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense packing of patterns in a permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic bounds for permutations containing many different patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:22, 10 July 2024

scientific article
Language Label Description Also known as
English
Bounds on superpatterns containing all layered permutations
scientific article

    Statements

    Bounds on superpatterns containing all layered permutations (English)
    0 references
    0 references
    20 July 2015
    0 references
    layered permutations
    0 references
    superpatterns
    0 references
    null-balanced binary trees
    0 references

    Identifiers