Sorting twice through a stack (Q688711): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4774085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Census of Slicings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Census of Planar Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!) / rank
 
Normal rank

Revision as of 10:26, 22 May 2024

scientific article
Language Label Description Also known as
English
Sorting twice through a stack
scientific article

    Statements

    Sorting twice through a stack (English)
    0 references
    0 references
    19 October 1994
    0 references
    permutation sorting
    0 references
    stack-sorting
    0 references
    Catalan number
    0 references

    Identifiers