Concepedia

Stack-sortable Permutations

Stack-Sortable Permutations is a combinatorial class of permutations that can be sorted by a single pass through a stack, distinguished from other permutation classes by their avoidance of the 231 pattern.

26

Publications

728

Citations

30

Authors

23

Institutions

Publications per year

2017–2026

8

Variants

Stack-sortable Permutation

Parents

Publications

26

A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!)

Doron Zeilberger · Discrete Mathematics · 1992 · 111 citations

, , +8

A Survey of Stack-Sorting Disciplines

Miklós Bóna · The Electronic Journal of Combinatorics · 2003 · 106 citations · Full text

, , +14

A Lemma and a Conjecture on the Cost of Rearrangements

Alberto Bressan · ArXiv.org · 2003 · 63 citations · Full text

, , +9

Raney Paths and a Combinatorial Relationship between Rooted Nonseparable Planar Maps and Two-Stack-Sortable Permutations

I. P. Goulden, Julian West · Journal of Combinatorial Theory Series A · 1996 · 49 citations

, , +8

Multi-Statistic Enumeration of Two-Stack Sortable Permutations

Mireille Bousquet‐Mélou · The Electronic Journal of Combinatorics · 1998 · 43 citations · Full text

, , +16

1–5 of 26

Authors

30

  1. CD
    Colin Defant

    Princeton University, United States

    5 publications · 72 citations

    5

    h-index

  2. MB
    Miklós Bóna

    University of Florida, United States

    3 publications · 158 citations

    3

    h-index

  3. MB
    Mireille Bousquet‐Mélou

    Laboratoire Bordelais de Recherche en Informatique, France

    2 publications · 59 citations

    2

    h-index

  4. MS
    Muzafer Saračević

    Univerzitet u Novom Pazaru, Serbia

    1 publications · 12 citations

    1

    h-index

  5. AC
    Anders Claesson

    Reykjavík University, Iceland

    1 publications · 17 citations

    1

    h-index

1–5 of 30

Institutions

23

  1. University of Florida

    Gainesville, United States

    4 h-index

    4 publications

    185 citations

  2. Université de Bordeaux

    Bordeaux, France

    3 h-index

    4 publications

    87 citations

  3. Princeton University

    Princeton, United States

    3 h-index

    3 publications

    33 citations

  4. Laboratoire Bordelais de Recherche en Informatique

    Talence, France

    2 h-index

    4 publications

    60 citations

  5. Centre National de la Recherche Scientifique

    Paris, France

    2 h-index

    3 publications

    44 citations

  6. University of Haifa

    Haifa, Israel

    1 h-index

    1 publications

    18 citations

  7. Institut de Mathématiques de Bordeaux

    Talence, France

    1 h-index

    2 publications

    28 citations

  8. Centre d'Analyse et de Mathématique Sociales

    Paris, France

    1 h-index

    2 publications

    70 citations

1–8 of 23

Venues

  1. The Electronic Journal of Combinatorics

    4 publications · 173 citations

    4

    h-index

  2. arXiv (Cornell University)

    Repository · 3 publications · 52 citations

    3

    h-index

  3. Discrete Mathematics & Theoretical Computer Science

    DMTCS · 2 publications · 23 citations

    2

    h-index

  4. Annals of Combinatorics

    AC · 2 publications · 31 citations

    2

    h-index

  5. Journal of Combinatorial Theory Series A

    2 publications · 86 citations

    2

    h-index

1–5