1 citations · 1 across the 4 of their papers we have counts for
7 papers
Flexible Schemes for Pattern-Avoiding Permutations
Yonah Biers-Ariel
We modify the enumeration schemes of Zeilberger and Vatter so that they can efficiently enumerate many new classes of pattern-avoiding permutations including all such classes with…
A Generalization of the "Raboter" Operation
Yonah Biers-Ariel
We generalize an operation described by Sloane on the binary representation of an integer to other bases, thus finding several new sequences.
Counting Words Avoiding a Short Increasing Pattern and the Pattern 1k...2
Yonah Biers-Ariel
We find finite-state recurrences to enumerate the words on the alphabet which avoid the patterns 123 and , and, separately, the words which avoid the pattern…
On The Joint Normality of Certain Statistics on Ordered Trees
Yonah Biers-Ariel
We develop algorithms, implemented in Maple, that study the number of vertices with a particular number of children in a random ordered tree where all vertices must have a number o…
A New Quantity Counted by OEIS Sequence A006012
Yonah Biers-Ariel
We prove an existing conjecture that the sequence defined recursively by counts the number of length- permutations avoiding the four genera…
Counting Permutations that Avoid Many Patterns
Yonah Biers-Ariel, Haripriya Chakraborty, John Chiarelli +8
This paper presents a collection of experimental results regarding permutation pattern avoidance, focusing on cases where there are "many" patterns to be avoided.