Combinatorial Recurrences

Combinatorial Recurrence is a type of recurrence relation characterized by its derivation from combinatorial structures or counting problems, where the terms are defined through recursive enumeration of discrete configurations.

129

Publications

3.8K

Citations

199

Authors

133

Institutions

Publications per year

2017–2026

14

Variants

Combinatorial Recurrence

Authors

199

  1. FL
    Florian Luca

    Universidad Nacional Autónoma de México, Mexico

    4 publications · 90 citations

    4

    h-index

  2. FQ
    Feng Qi

    Henan Polytechnic University, China

    4 publications · 91 citations

    4

    h-index

  3. AZ
    Andrei Zelevinsky

    Northeastern University, United States

    3 publications · 342 citations

    3

    h-index

  4. FB
    Frits Beukers

    Utrecht University, Netherlands

    3 publications · 67 citations

    3

    h-index

  5. FR
    Frank Ruskey

    University of Victoria, Canada

    3 publications · 34 citations

    3

    h-index

1–5 of 199

Venues

  1. The Electronic Journal of Combinatorics

    10 publications · 256 citations

    10

    h-index

  2. ˜The œFibonacci quarterly

    4 publications · 87 citations

    4

    h-index

  3. Advances in Applied Mathematics

    4 publications · 389 citations

    4

    h-index

  4. arXiv (Cornell University)

    Repository · 4 publications · 61 citations

    4

    h-index

  5. Journal of Number Theory

    4 publications · 113 citations

    4

    h-index

1–5