13 citations · 13 across the 4 of their papers we have counts for
6 papers · 1 filter
A Geometric Form for the Extended Patience Sorting Algorithm
Alexander Burstein, Isaiah Lankham
Patience Sorting is a combinatorial algorithm that can be viewed as an iterated, non-recursive form of the Schensted Insertion Algorithm. In recent work the authors extended Patien…
Combinatorics of patience sorting piles
Alexander Burstein, Isaiah Lankham
Despite having been introduced in 1962 by C.L. Mallows, the combinatorial algorithm Patience Sorting is only now beginning to receive significant attention due to such recent deep…
Packing sets of patterns
Alexander Burstein, Peter Hästö
Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we f…
Restricted Dumont permutations
Alexander Burstein
We analyze the structure and enumerate Dumont permutations of the first and second kinds avoiding certain patterns or sets of patterns of length 3 and 4. Some cardinalities are giv…
On unavoidable sets of word patterns
Alexander Burstein, Sergey Kitaev
We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets o…
Independent sets in certain classes of (almost) regular graphs
Alexander Burstein, Sergey Kitaev, Toufik Mansour
We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between the…