266 citations · 723 across the 48 of their papers we have counts for
46 papers · 1 filter
Nonrationality and Principal permutation classes: the remaining case
Miklos Bona
We complete the proof of the fact that all principal permutation classes generated by a pattern longer than two have a nonrational generating function.
Pattern avoiding permutations and involutions with a unique longest increasing subsequence
Miklos Bona, Elijah DeJonge
We investigate permutations and involutions that avoid a pattern of length three and have a {\em unique} longest increasing subsequence.
Stack words and a bound for 3-stack sortable permutations
Miklos Bona
We use stack words to find a new, simple proof for the best known upper bound for the number of 3-stack sortable permutations of a given length. This is the first time that stack w…
Pattern avoidance in permutations and their squares
Miklos Bona, Rebecca Smith
We study permutations such that both and avoid a given pattern . We obtain a generating function for the case of (equivalently, ), we prove that if…
Cyclic permutations avoiding pairs of patterns of length three
Miklos Bona, Michael Cory
We complete the enumeration of cyclic permutations avoiding two patterns of length three each by providing explicit formulas for all but one of the pairs for which no such formulas…
Limiting probabilities for vertices of a given rank in rooted trees
Miklos Bona, Istvan Mezo
We consider two varieties of labeled rooted trees, and the probability that a vertex chosen from all vertices of all trees of a given size uniformly at random has a given rank. We…