24 citations · 25 across the 4 of their papers we have counts for
4 papers · 1 filter
Competition graphs induced by permutations
Brian Nakamura, Elizabeth Yang
In prior work, Cho and Kim studied competition graphs arising from doubly partial orders. In this article, we consider a related problem where competition graphs are instead induce…
Using Noonan-Zeilberger Functional Equations to enumerate (in Polynomial Time!) Generalized Wilf classes
Brian Nakamura, Doron Zeilberger
One of the most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given a pattern, or set of patterns, and you are asked to find a "formula"…
Computational Approaches to Consecutive Pattern Avoidance in Permutations
Brian Nakamura
In recent years, there has been increasing interest in consecutive pattern avoidance in permutations. In this paper, we introduce two approaches to counting permutations that avoid…
Automatic Generation of Theorems and Proofs on Enumerating Consecutive-Wilf classes
Andrew Baxter, Brian Nakamura, Doron Zeilberger
This article, dedicated to Herbert Saul Wilf on the occaison of his forthcoming 80-th birthday, describes two complementary approaches to enumeration, the "positive" and the "negat…