Pattern Avoidance Counting

Pattern Avoidance Counting is a combinatorial enumeration method that systematically calculates the number of objects in a finite set that do not contain specified forbidden configurations, distinguished from other counting techniques by its reliance on the Inclusion-Exclusion Principle to exclude overlapping pattern occurrences.

12

Publications

258

Citations

15

Authors

13

Institutions

Publications per year

2017–2026

1

Authors

15

  1. LP
    Lara Pudwell

    Valparaiso University, United States

    4 publications · 85 citations

    4

    h-index

  2. BN
    Brian Nakamura

    Rutgers, The State University of New Jersey, United States

    2 publications · 39 citations

    2

    h-index

  3. CW
    Casey Wynn

    Hendrix College, United States

    1 publications · 24 citations

    1

    h-index

  4. AV
    Antoine Vella

    University of Waterloo, Canada

    1 publications · 14 citations

    1

    h-index

  5. KP
    Katherine Peske

    Valparaiso University, United States

    1 publications · 15 citations

    1

    h-index

1–5 of 15

Venues

  1. The Electronic Journal of Combinatorics

    3 publications · 69 citations

    3

    h-index

  2. Advances in Applied Mathematics

    1 publications · 15 citations

    1

    h-index

  3. ArXiv.org

    Repository · 1 publications · 12 citations

    1

    h-index

  4. arXiv (Cornell University)

    Repository · 1 publications · 24 citations

    1

    h-index

  5. Journal of Combinatorial Theory Series A

    1 publications · 12 citations

    1

    h-index

1–5