Permutation Posets

Permutation Posets is a mathematical construct defined as a partially ordered set whose elements are permutations ordered by pattern containment, where one permutation is considered less than or equal to another if it occurs as a pattern within it.

15

Publications

456

Citations

22

Authors

22

Institutions

Publications per year

2017–2026

0

Authors

22

  1. ES
    Einar Steingrı́msson

    University of Strathclyde, United Kingdom

    3 publications · 54 citations

    3

    h-index

  2. RP
    Richard P. Stanley

    Massachusetts Institute of Technology, United States

    3 publications · 202 citations

    3

    h-index

  3. PB
    Pierre Bouchard

    Academia Sinica, Taiwan

    1 publications · 11 citations

    1

    h-index

  4. JY
    Jean Yeh

    National Kaohsiung Normal University, Taiwan

    1 publications · 11 citations

    1

    h-index

  5. RW
    Rudolf Winkel

    RWTH Aachen University, Germany

    1 publications · 10 citations

    1

    h-index

1–5 of 22

Venues

  1. The Electronic Journal of Combinatorics

    2 publications · 25 citations

    2

    h-index

  2. Journal of Combinatorial Theory Series A

    2 publications · 158 citations

    2

    h-index

  3. Journal of Combinatorics

    JOC · 1 publications · 21 citations

    1

    h-index

  4. Theoretical Computer Science

    1 publications · 15 citations

    1

    h-index

  5. ArXiv.org

    Repository · 1 publications · 10 citations

    1

    h-index

1–5