75 citations · 230 across the 32 of their papers we have counts for
44 papers
A logical limit law for -avoiding permutations
Michael Albert, Mathilde Bouvel, Valentin Féray +1
We prove that the class of 231-avoiding permutations satisfies a logical limit law, i.e. that for any first-order sentence , in the language of two total orders, the probability…
How many pop-stacks does it take to sort a permutation?
Michael Albert, Vincent Vatter
Pop-stacks are variants of stacks that were introduced by Avis and Newborn in 1981. Coincidentally, a 1982 result of Unger implies that every permutation of length n can be sorted…
Two examples of Wilf-collapse
Michael Albert, Vít Jelínek, Michal Opler
Two permutation classes, the X-class and subpermutations of the increasing oscillation are shown to exhibit an exponential Wilf-collapse. This means that the number of distinct enu…
Wilf collapse in permutation classes
Michael Albert, Vít Jelínek, Michal Opler
For a hereditary permutation class , we say that two permutations and of are Wilf-equivalent in , if has the same numb…
Prolific Compositions
Murray Tannock, Michael Albert
Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, hold…
Uniquely-Wilf classes
Michael Albert, Jinge Li
Two permutations in a class are Wilf-equivalent if, for every size, , the number of permutations in the class of size containing each of them is the same. Those infinite cla…