Cycle Lemma

Cycle Lemma is a combinatorial theorem that, in the context of bijective combinatorics, characterizes the number of cyclic shifts of a sequence of parentheses or steps that result in a valid Dyck path, distinguishing it from general enumeration lemmas by its focus on cyclic invariance and dominance properties.

19

Publications

646

Citations

34

Authors

26

Institutions

Publications per year

2017–2026

1

Variants

Raney's Lemma

Authors

34

  1. MD
    Michael D. Fried

    University of California, Irvine, United States

    1 publications · 21 citations

    1

    h-index

  2. GC
    Guy Chassé

    1 publications · 12 citations

    1

    h-index

  3. ND
    Nachum Dershowitz

    University of Illinois Urbana-Champaign, United States

    1 publications · 69 citations

    1

    h-index

  4. RP
    Renzo Pinzani

    University of Florence, Italy

    1 publications · 11 citations

    1

    h-index

  5. ED
    Edward Dobson

    Mississippi State University, United States

    1 publications · 12 citations

    1

    h-index

1–5 of 34

Venues

  1. Discrete Mathematics

    6 publications · 146 citations

    6

    h-index

  2. Discrete Applied Mathematics

    3 publications · 52 citations

    3

    h-index

  3. Journal of Combinatorial Theory Series A

    2 publications · 79 citations

    2

    h-index

  4. Graphs and Combinatorics

    1 publications · 27 citations

    1

    h-index

  5. European Journal of Combinatorics

    1 publications · 69 citations

    1

    h-index

1–5