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
Parents
129
1–5 of 129
199
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 199
133
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
4 h-index
4 publications
165 citations
University of Florence
Florence, Italy
3 h-index
8 publications
92 citations
University of Haifa
Haifa, Israel
3 h-index
4 publications
94 citations
Northeastern University
Boston, United States
3 h-index
3 publications
342 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
5 publications
169 citations
Henan Polytechnic University
Jiaozuo, China
3 h-index
3 publications
66 citations
Indian Institute of Technology Kharagpur
Kharagpur, India
3 h-index
3 publications
97 citations
University of Michigan
Ann Arbor, United States
3 h-index
3 publications
342 citations
1–8 of 133
10 publications · 256 citations
10
h-index
4 publications · 87 citations
4
h-index
4 publications · 389 citations
4
h-index
Repository · 4 publications · 61 citations
4
h-index
4 publications · 113 citations
4
h-index
1–5