266 citations · 723 across the 48 of their papers we have counts for
6 papers · 1 filter
The copies of any permutation pattern are asymptotically normal
Miklos Bona
We prove that the number of copies of any given permutation pattern has an asymptotically normal distribution in random permutations.
On Three Different Notions of Monotone Subsequences
Miklos Bona
We review how the monotone pattern compares to other patterns in terms of enumerative results on pattern avoiding permutations. We consider three natural definitions of pattern avo…
Generalized Descents and Normality
Miklos Bona
We use Janson's dependency criterion to prove that the distribution of -descents of permutations of length converge to a normal distribution as goes to infinity. We show…
Real Zeros and Normal Distribution for statistics on Stirling permutations defined by Gessel and Stanley
Miklos Bona
We study Stirling permutations defined by Gessel and Stanley. We prove that their generating function according to the number of descents has real roots only. We use that fact to p…
Real Zeros and Partitions without singleton blocks
Miklós Bóna, István Mező
We prove that the generating polynomials of partitions of an -element set into non-singleton blocks, counted by the number of blocks, have real roots only and we study the asymp…
Where the monotone pattern (mostly) rules
Miklos Bona
We consider pattern containment and avoidance with a very tight definition that was used first by Riordan more than 60 years ago. Using this definition, we prove the monotone patte…