Solving Recurrence Relations

Solving Recurrence Relations is the systematic process of determining a closed-form expression or an explicit formula that satisfies a given recurrence relation, thereby transforming a recursively defined sequence into a direct, non-recursive representation.

157

Publications

7.1K

Citations

249

Authors

156

Institutions

Publications per year

2017–2026

16

Authors

249

  1. EH
    E. H. Doha

    Cairo University, Egypt

    4 publications · 178 citations

    4

    h-index

  2. JF
    J. Fernández Rico

    Universidad Autónoma de Madrid, Spain

    3 publications · 107 citations

    3

    h-index

  3. RL
    R. López

    Universidad Autónoma de Madrid, Spain

    3 publications · 107 citations

    3

    h-index

  4. PQ
    Patrice Quinton

    Institut de Recherche en Informatique et Systèmes Aléatoires, France

    3 publications · 244 citations

    3

    h-index

  5. JA
    Jakob Ablinger

    Johannes Kepler University of Linz, Austria

    2 publications · 168 citations

    2

    h-index

1–5 of 249

Venues

  1. Journal of Physics A Mathematical and General

    5 publications · 412 citations

    5

    h-index

  2. Physical review. B, Condensed matter

    PRB · 4 publications · 260 citations

    4

    h-index

  3. Journal of Mathematical Physics

    4 publications · 71 citations

    4

    h-index

  4. The Journal of Chemical Physics

    3 publications · 78 citations

    3

    h-index

  5. Journal of Symbolic Computation

    3 publications · 82 citations

    3

    h-index

1–5