2 citations · 5 across the 3 of their papers we have counts for
4 papers
Permutations with exactly one copy of a decreasing pattern of length k
Miklós Bóna, Alexander Burstein
We construct an injection from the set of permutations of length that contain exactly one copy of the decreasing pattern of length to the set of permutations of length $n+2…
Generating functions of permutations with respect to their alternating runs
Miklós Bóna
We present a short, direct proof of the fact that the generating function of all permutations of a fixed length is divisible by , where $m=\lfloor (n-2)/2 \rfloo…
Most principal permutation classes have nonrational generating functions
Miklós Bóna
We prove that for any fixed , and for most permutation patterns , the number of -avoiding permutations of length that consist of skew…
Log-concavity, the Ulam distance and involutions
Miklós Bóna, Marie-Louise Bruner
We prove that in a large collection of naturally defined sets of permutations of fixed length, the numbers of permutations at Ulam distance k from the identity form a log-concave s…