Bijective Enumeration

Bijective Enumeration is a combinatorial method in the theory of generating functions that establishes a one-to-one correspondence between elements of two finite sets to prove their equal cardinality through explicit structural bijections.

63

Publications

2.1K

Citations

107

Authors

81

Institutions

Publications per year

2017–2026

4

Authors

107

  1. GS
    Gilles Schaeffer

    Laboratoire d'Informatique de l'École Polytechnique, France

    5 publications · 317 citations

    5

    h-index

  2. PD
    Philippe Di Francesco

    Institut de Physique Théorique, France

    3 publications · 288 citations

    3

    h-index

  3. LP
    Lara Pudwell

    Valparaiso University, United States

    3 publications · 52 citations

    3

    h-index

  4. JB
    Jérémie Bouttier

    Commissariat à l'Énergie Atomique et aux Énergies Alternatives, France

    3 publications · 279 citations

    3

    h-index

  5. OB
    Olivier Bernardi

    Brandeis University, United States

    3 publications · 162 citations

    3

    h-index

1–5 of 107

Venues

  1. The Electronic Journal of Combinatorics

    14 publications · 704 citations

    12

    h-index

  2. Discrete Mathematics

    6 publications · 156 citations

    6

    h-index

  3. arXiv (Cornell University)

    Repository · 4 publications · 174 citations

    4

    h-index

  4. Proceedings of the American Mathematical Society

    PROC · 2 publications · 45 citations

    2

    h-index

  5. Combinatorics Probability Computing

    2 publications · 72 citations

    2

    h-index

1–5