Bell Numbers

Bell Number is a combinatorial enumeration function that counts the number of ways a set of n elements can be partitioned into nonempty, unordered subsets, distinguished from other counting functions by its enumeration of all possible set partitions without regard to subset order.

135

Publications

5.4K

Citations

224

Authors

136

Institutions

Publications per year

2017–2026

42

Authors

224

  1. DS
    Dae San Kim

    Sogang University, South Korea

    17 publications · 472 citations

    14

    h-index

  2. TK
    Taekyun Kim

    Kwangwoon University, South Korea

    13 publications · 309 citations

    11

    h-index

  3. FQ
    Feng Qi

    Henan Polytechnic University, China

    8 publications · 232 citations

    8

    h-index

  4. KA
    K. A. Penson

    Sorbonne Université, France

    5 publications · 195 citations

    5

    h-index

  5. AI
    A. I. Solomon

    The Open University, United Kingdom

    5 publications · 195 citations

    5

    h-index

1–5 of 224

Venues

  1. arXiv (Cornell University)

    Repository · 8 publications · 236 citations

    8

    h-index

  2. Physical Review A

    PRA · 6 publications · 518 citations

    6

    h-index

  3. Physics Letters A

    4 publications · 115 citations

    4

    h-index

  4. Discrete Mathematics

    4 publications · 175 citations

    4

    h-index

  5. The Electronic Journal of Combinatorics

    4 publications · 97 citations

    4

    h-index

1–5