26 citations · 74 across the 46 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014
Bounds on Zimin Word Avoidance
Joshua Cooper, Danny Rorabaugh
How long can a word be that avoids the unavoidable? Word encounters word provided there is a homomorphism defined by mapping letters to nonempty words such that …
math.CO2014★ 1 cited
The complexity of counting poset and permutation patterns
Joshua Cooper, Anna Kirkpatrick
We introduce a notion of pattern occurrence that generalizes both classical permutation patterns as well as poset containment. Many questions about pattern statistics and avoidance…
math.NT2014
On the Reciprocal of the Binary Generating Function for the Sum of Divisors
Joshua Cooper, Alexander Riasanovsky
If \(A \) is a set of natural numbers containing \(0 \), then there is a unique nonempty "reciprocal" set \(B \) of natural numbers (containing \(0 \)) such that every positive int…