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
12
Pattern avoidance in inversion sequences
Toufik Mansour, Mark Shattuck · Pure mathematics and applications · 2015 · 53 citations · Full text
Metric dimension and pattern avoidance in graphs
Jesse Geneson · Discrete Applied Mathematics · 2020 · 33 citations
Non-Contiguous Pattern Avoidance in Binary Trees
Michael Dairyko, Lara Pudwell, Samantha Tyner et al. · The Electronic Journal of Combinatorics · 2012 · 24 citations · Full text
1–5 of 12
15
4
h-index
Rutgers, The State University of New Jersey, United States
2 publications · 39 citations
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 15
13

Valparaiso University
Valparaiso, United States
3 h-index
4 publications
85 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
2 h-index
2 publications
39 citations
University of Tennessee at Knoxville
Knoxville, United States
1 h-index
1 publications
53 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
1 h-index
1 publications
12 citations
Iowa State University
Ames, United States
1 h-index
1 publications
33 citations

Augustana College
Rock Island, United States
1 h-index
1 publications
24 citations
University of Haifa
Haifa, Israel
1 h-index
1 publications
53 citations
Pomona College
Claremont, United States
1 h-index
1 publications
24 citations
1–8 of 13
3 publications · 69 citations
3
h-index
1 publications · 15 citations
1
h-index
Repository · 1 publications · 12 citations
1
h-index
Repository · 1 publications · 24 citations
1
h-index
1 publications · 12 citations
1
h-index
1–5