activity
20162019
most citedExpected Number of Distinct Subsequences in Randomly Generated Binary Strings

2 citations · 3 across the 7 of their papers we have counts for

collaborators
Showing math.COShow all

8 papers · 1 filter

math.CO2019★ 1 cited

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…

math.CO2019

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.

math.CO2018

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…

math.CO2018

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…

math.CO2017

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…

math.CO2017★ 2 cited

Expected Number of Distinct Subsequences in Randomly Generated Binary Strings

Yonah Biers-Ariel, Anant Godbole, Elizabeth Kelley

When considering binary strings, it's natural to wonder how many distinct subsequences might exist in a given string. Given that there is an existing algorithm which provides a str…

math.CO2017

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.

math.CO2016

Some Results on Superpatterns for Preferential Arrangements

Yonah Biers-Ariel, Yiguang Zhang, Anant Godbole

A {\it superpattern} is a string of characters of length that contains as a subsequence, and in a sense that depends on the context, all the smaller strings of length in a…